Multiplex communications – Wide area network – Packet switching
Patent
1996-07-01
1999-03-02
Luu, Le Hien
Multiplex communications
Wide area network
Packet switching
39520068, 370229, G06F 1300
Patent
active
058782273
ABSTRACT:
In brief summary, the invention provides a new message packet transfer system, which may be used in, for example, a multiprocessor computer system. The message packet transfer system comprises a plurality of switching nodes interconnected by communication links to define at least one cyclical packet transfer path having a predetermined diameter. The switching nodes may be connected to, for example, digital data processors and memory to form processing nodes in an multiprocessor computer system, and/or to other sources and destinations for digital data contained in the message packets. The switching nodes transfer message packets each from a respective one of the switching nodes as a respective source switching node to a respective one of the switching nodes as a respective destination switching node. At least one of the switching nodes has a plurality of buffers for buffering a corresponding plurality of message packets that it (that is, the at least one of the switching nodes) receives from another of said switching nodes during a message transfer operation, which ensures that deadlock does not occur during the message transfer operation.
REFERENCES:
patent: 4616359 (1986-10-01), Fontenot
patent: 4623996 (1986-11-01), McMillen
patent: 4742511 (1988-05-01), Johnson
patent: 4780870 (1988-10-01), McHarg et al.
patent: 4930122 (1990-05-01), Takahashi et al.
patent: 5347450 (1994-09-01), Nugent
patent: 5400329 (1995-03-01), Tokura et al.
patent: 5544154 (1996-08-01), Glitho
patent: 5583990 (1996-12-01), Birrittella et al.
W. Dally, "Virtual-Channel Flow Control," IEEE Transactins On Parallel And Distributed Systems, vol. 3, No. 2, Mar. 1992, pp. 194-205.
G. Pifarre, et al., "Fully-Adaptive Minimal Deadlock--Free Packet Routing In Hypercubes, Meshes and Other Networks," Proc. 3d Annual ACM Symp. on Parallel Algorithms and Architectures, 1991.
P. Berman, et al., "Adaptive Deadlock- and Livelock-Free Routing With All Minimal Paths In Torus Networks," Proc. ACM Symp. on Parallel Algorithms and Architectures, 1992.
Heller Steven K.
Wade Jon P.
Jordan Richard A.
Luu Le Hien
Sun Microsystems Inc.
LandOfFree
System for performing deadlock free message transfer in cyclic m does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System for performing deadlock free message transfer in cyclic m, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System for performing deadlock free message transfer in cyclic m will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-431225