公开(公告)号：KR880000577B1

公开(公告)日：1988-04-15

申请号：KR830000173

申请日：1983-01-18

Applicant: TANDEM COMPUTERS INC

Inventor： HUMPREY RICHARD A ,  FISHER STEVEN D ,  WIERENGA STEVEN W ,  SJOSTEDT JON

IPC: G06F12/00 ,  G06F11/00 ,  G06F11/10 ,  G06F11/30 ,  G06F12/16 ,  G11C29/02 ,  G06F13/00

公开(公告)号：CA1203027A

公开(公告)日：1986-04-08

申请号：CA419694

申请日：1983-01-18

Applicant: TANDEM COMPUTERS INC

Inventor： HUMPHREY RICHARD A ,  FISHER STEVEN D ,  WIERENGA STEVEN W ,  SJOSTEDT JON

IPC: G06F12/00 ,  G06F11/00 ,  G06F11/10 ,  G06F11/30 ,  G06F12/16 ,  G11C29/02 ,  G06F13/16 ,  G11C29/00

Abstract: A memory system for a computer detects data errors, address errors and operation errors to increase the reliability of data stored in the memory system. Address errors are detected by encoding address parity information into the data check field of each memory location. A signal is generated in each memory module indicating the status of operations of that memory module and is transmitted to the processor subsystem of the computer for comparison with a signal indicating the status of operations of the processor subsystem to insure that all memory modules and the memory control in the processor are receiving the same commands.

公开(公告)号：CA1210872A

公开(公告)日：1986-09-02

申请号：CA439851

申请日：1983-10-27

Applicant: TANDEM COMPUTERS INC

Inventor： ALLEN JAMES C ,  BARTLETT WENDY B ,  JOHNSON HOKE S ,  FISHER STEVEN D ,  LARSON RICHARD O ,  PECK JOHN C

IPC: G06F13/00 ,  G06F15/173 ,  G06F13/38

Abstract: A plurality of multiprocessor systems is arranged in a high speed network to allow any processor in one system to communicate with any processor in another system. The network may be configured as a multi-node dual bidirectional ring having a multiprocessor system at each node. Packets of information may be passed around the ring in either of two directions and are temporarily stored in buffer memory locations dedicated to a selected destination processor in a selected direction between each successive transfer between neighboring nodes. The buffer locations are managed so that a node can request an adjacent node to stop transmitting packets if the buffer is becoming full from that direction and request resumption of transmission of packets as the buffer empties.