Boots – shoes – and leggings
Patent
1992-11-30
1996-07-02
Lall, Parshotam S.
Boots, shoes, and leggings
3952001, 395375, 364DIGI, 364DIGII, 370 941, H04J 326
Patent
active
055331980
ABSTRACT:
A method of routing messages within an n-dimensional network topology. Two directions are associated with each dimension in the n-dimensional network, for a total of 2n directions. A direction order is assigned which prioritizes the order in which a packet is routed across the 2n possible directions. Such an approach provides deadlock-free, fault tolerant wormhole routing in networks without wrap-around channels. For networks with wrap-around channels, the above method of wormhole routing is enhanced by placing a first direction from each of the n dimensions within a first group of directions. The second direction from each dimension is placed within a second group of directions. A packet to be routed from a source node to a destination node is routed in all relevant directions in the first group of directions in any order before being routed in the second group of directions. If, while traveling in a direction within the first group of directions, the packet is routed across a wrap-around channel, all further routing in that direction must be completed before moving in another direction. Routing then proceeds, if necessary, in the other directions of that first group of directions. Likewise, if, while traveling in a direction within the second group of directions, the packet is routed across a wrap-around channel, all further routing in that direction must be completed before moving in another of the second group of directions. A free hop mechanism is also taught for increase flexibility.
REFERENCES:
patent: 4933933 (1990-06-01), Dally et al.
patent: 5008882 (1991-04-01), Peterson et al.
patent: 5105424 (1992-04-01), Flaig et al.
patent: 5157692 (1992-10-01), Horie et al.
patent: 5175733 (1992-12-01), Nugent
patent: 5218676 (1992-06-01), Ben-Ayed et al.
patent: 5280474 (1994-01-01), Nickolls et al.
patent: 5333279 (1994-07-01), Dunning
Trunk congestion control in heterogeneous circuit switched networks by Wang et al., 1992 IEEE, pp. 1156-1161.
Introduction to the configurable highly parallel computer by Snyder, IEEE, 1982 publication pp. 310 -319.
An Adaptive and fault tolerant warmhole routing strategy for K-ary n tubes by Linder et al., 1991 IEEE pp. 2-12.
The J. Machine Network by Nuth, IEEE 1992 publication pp. 420-423.
Performance Evaluation of Multicast Warmhole routing in 2D-Tonas Multicomputers by Yang et al., IEEE 1992 p. 173, 178.
IBM Technical Disclosure Bulletin, vol. 35, No. 7, Dec., 1992, New York, US, pp.232-233, "Deadlock-Free Routing Schemes on Multistage Interconnection Networks".
NTC'77 Conference Record, vol. 2, Dec. 5, 1977, Los Angeles, USA, pp. 2821-2825, R. Gallager, "Scale Factors for Distributed Routing Algorithms".
"The Turn Model for Adaptive Routing," C. J. Glass et al., Computer Architecture News, vol. 20, No. 2, pp. 278-87, May 1992.
"Adaptive low latency, deadlock-free packet routing for networks or processors," J. Yantchev et al., IEE Proceedings, pp. 178-186, vol. 136, Pt. E., No. 3, May 1989.
"Deadlock-Free Message Routing in Multiprocessor Interconnection Network," W. J. Dally et al., IEEE Transactions on Computers, pp. 547-553, vol. C-36, No. 5, May 1987.
"Performance Analysis of k-ary n-cube Interconnection Networks," W. J. Dally, IEEE Transactions on Computers, pp. 775-785, vol. 39, No. 6, Jun. 1990.
"Virtual-Channel Flow Control," W. J. Dally, Proceedings of the 17th Annual Symposium on Computer Architecture in Seattle, WA, May 28-31, 1990, pp. 60-68.
Cray Research Inc.
Lall Parshotam S.
Maung Zarni
LandOfFree
Direction order priority routing of packets between nodes in a n does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Direction order priority routing of packets between nodes in a n, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Direction order priority routing of packets between nodes in a n will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1514848