Message routing in a torus interconnect

Details Message routing in a torus interconnect Message routing in a torus interconnect

2006-07-18

2006-07-18

Shah, Kamini (Department: 2142)

Electrical computers and digital processing systems: multicomput

Computer-to-computer data routing

C709S239000, C370S401000, C370S406000

Reexamination Certificate

active

07080156

ABSTRACT:
Systems and methods for routing messages in an interconnection fabric are provided. The fabric includes a plurality of nodes, each node having, for example, four ports coupled to adjacent nodes in the fabric. A source node initiating a message in the fabric can transmit the message out of one of its four ports. Between a source node and a destination node, there are at least four independent paths which may be taken, depending on the output port from the source node. However, the precise path is not expressly delineated in the message. Instead, the message contains the address of the destination node, the address of the originating node, and a target region for the message. Each intermediate node is configured to receive a message via one of its four ports, and then select an appropriate output port based on the location of the port which received the message combined with the address and target information contained in the message. By providing a system by which four independent paths can be taken by a message, at least three intermediate nodes can fail in the fabric before the message is prevented from reaching the destination node.

REFERENCES:
patent: 4933933 (1990-06-01), Dally et al.
patent: 5701416 (1997-12-01), Thorson et al.
patent: 5915097 (1999-06-01), Chao
patent: 6272548 (2001-08-01), Cotter et al.
patent: 6314487 (2001-11-01), Hahn et al.
patent: 6370585 (2002-04-01), Hagersten et al.
patent: 6631136 (2003-10-01), Chowdhury et al.
patent: 2005/0076137 (2005-04-01), Tang et al.
Tzi-Cker Chiueh, “Trail: A Track-based Logging Disk Architecture for Very Fast Writes”, Experimental Computer Systems Laboratory, Computer Science Department, State University of New York, Stony Brook, NY, Mar. 10, 1994, pp. 1-22.
Yiming Hu and Qing Yang, “DCD—Disk Caching Disk: A New Approach for Boosting I/O Performance”, ACM, Dept. of Electrical & Computer Engineering, University of Rhode Island, Kingston, RI, 1996, pp. 169-178.
May Baker, Satoshi Asami, Etienne Deprit, John Ousterhout, and Margo Seltzer, “Non-Volatile Memory for Fast, Reliable File Systems”, ACM, Computer Science Division, Electrical Engineering and Computer Sciences, University of California, Berkeley, CA 1992, pp. 10-22.
Daniel, Stodolsky, Garth Gibson, and Mark Holland, “Parity Logging Overcoming the Small Write Problem in Redundant Disk Arrays”, IEEE, School of Computer Science and Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburg, PA, 1993, pp. 64-75.

Affiliated with

Also associated with

Rating

Message routing in a torus interconnect does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Message routing in a torus interconnect, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Message routing in a torus interconnect will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3579406