A deadlock avoidance method for computer networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1199, Issue , 1997, Pages 61-72

  Abali, Bulent ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; REGRESSION ANALYSIS;

BENCHMARK NETWORKS; DEADLOCK AVOIDANCE; HIGHER NETWORKS; IRREGULAR NETWORKS; MULTISTAGE NETWORKS; NETWORK TOPOLOGY; RECURSIVE PARTITIONING; WORMHOLE ROUTED NETWORKS;

MESH NETWORKING;

EID: 0006704360     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62573-9_5     Document Type: Conference Paper

References (13)

1. W. J. Dally and C. L. Seitz, "Deadlock-free message routing in multiprocessor interconnection networks," IEEE Trans. on Computers, vol. C-36, pp. 547-553, May 1987.
2. R. Horst, "ServerNet Deadlock Avoidance and Fractahedral Topologies," in Prvc. lOth lnt: Parallel Processing Syrup. (IPPS'96), pp. 274-280, April 1996.
3. C. B. Stunkel et al, "The SP2 High-Performance Switch," IBM Systems Journal, vol. 34, no. 2, pp. 185-204, 1995.
4. B. Abali and C. Aykanat, "Routing Algorithms for IBM SP1," Lecture Notes in Computer Science, Springer-Verlag, vol. 853, pp. 161-175, 1994.
5. W. Qiao and L. M. Ni, "Adaptive muting in irregular networks using cut-through switches," in Proc. 25th Int. Conf. Parallel Processing (ICPP), August 1996.
6. A. A. Chien, "A cost and speed model for k-ary n-cube wormhole routers," in Proc. Hot Interconnects'93, August 1993.
7. C. Glass and L. M. Ni, "The turn model for adaptive routing," in Proc. 19th Int. Ann. Syrup. Computer Architecture, pp. 278-287, 1992.
8. H. Sethu, R. E Stucke, and C. B. Stunkel, "Technique for accomplishing deadlock free routing through a multi-stage cross-point packet switch." U.S. Patent 5,453,978, issued 9/26/1995.
9. B. W. Kemighan and S. Lin, "An efficient heuristic procedure for partitioning graphs," Bell System Tech. J., voL 49, pp. 291-307, 1970.
10. H. Sethu, "Routing Restrictions." unpublished.
11. I. D. Scherson and C.-H. Chien, "Least Common Ancestor Networks," in Proc. 7th Int. Parallel Processing Syrup, pp. 507-513, 1993.
12. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. NY: McGraw-Hill, 1990.
13. J. Duato, "A new theory of deadlock-free adaptive routing in wormhole networks," 1EEE Trans. Parallel and Distributed Systems, vol. 4, no. 2, pp. 1320-1331, 1993.