The case for chaotic adaptive routing

IEEE Transactions on Computers

Volumn 46, Issue 12, 1997, Pages 1281-1292

  Bolding, Kevin ^a,c   Fulgham, Melanie ^b   Snyder, Lawrence ^b,c  

^a SEATTLE PACIFIC UNIVERSITY   (United States)

^b University of Washington   (United States)

^c IEEE   (United States)

Author keywords

Adaptive; Interconnection networks; Mesh; Multicomputer; Nonminimal; Routing; Torus; VLSI

Indexed keywords

ADAPTIVE SYSTEMS; COMPUTER NETWORKS; COMPUTER SIMULATION; INTERCONNECTION NETWORKS; PACKET NETWORKS; PARALLEL PROCESSING SYSTEMS; VLSI CIRCUITS;

ADAPTIVE PACKET ROUTERS; CHAOTIC ROUTERS;

DATA COMMUNICATION SYSTEMS;

EID: 0031386006     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.641929     Document Type: Article

References (39)

1. W. Dally, "Wire-Efficient VLSI Multiprocessor Communication Networks," Proc. Stanford Conf. Advanced Research in VLSI, P. Losleben, ed., pp. 391-415. MIT Press, Mar. 1987.
2. P. Kermani and L. Kleinrock, "Virtual Cut-Through: A New Computer Communication Switching Technique," Computer Networks, vol. 3, pp. 267-286, 1979.
3. W. Dally and C. Seitz, "Deadlock-Free Message Routing in Multi-Processor Interconnection Networks," IEEE Trans. Computers, vol. 36, no. 5, pp. 547-553, May 1987.
4. K. Bolding, "Non-Uniformities Introduced by Virtual Channel Deadlock Prevention," Technical Report UW-CSE-92-07-07, Univ. of Washington, Seattle, July 1992.
5. V.S. Adve and M.K. Vernon, "Performance Analysis of Mesh Interconnection Networks with Deterministic Routing," IEEE Trans. Parallel and Distributed Systems, 1993.
6. C. Kaklamanis, D. Krizanc, and T. Tsantilas, "Tight Bounds for Oblivious Routing in the Hypercube," Proc. Symp. Parallel Algorithms and Architectures, pp. 31-35, 1990.
7. L.G. Valiant and G.J. Brebner, "Universal Schemes for Parallel Communication," Proc. 13th ACM Symp. Theory of Computing, pp. 263-277, 1981.
8. G.F. Pfister and V.A. Norton, "'Hot Spot' Contention and Combining in Multistage Interconnection Networks," IEEE Trans. Computers, vol. 34, no. 10, Oct. 1985.
9. C.J. Glass and L.M. Ni, "The Turn Model for Adaptive Routing," Proc. Int'l Symp. Computer Architecture, 1992.
10. S. Konstantinidou, "Adaptive, Minimal Routing in Hypercubes," Proc. Sixth MIT Conf. Advanced Research in VLSI, pp. 139-153, 1990.
11. A.A. Chien and J.H. Kim, "Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors," Proc. Int'l Symp. Computer Architecture, pp. 268-277, May 1992.
12. G.D. Pifarré, L. Gravano, S.A. Felperin, and J.L.C. Sanz, "Fully-Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes and Other Networks," Proc. Symp. Parallel Algorithms and Architectures, pp. 278-290, 1991.
13. R. Cypher and L. Gravano, "Adaptive, Deadlock-Free Packet Routing in Torus Networks with Minimal Storage," Proc. Int'l Conf. Parallel Processing, pp. 204-211, 1992.
14. J. Yantchev and C.R. Jesshope, "Adaptive, Low Latency, Deadlock-Free Packet Routing for Networks of Processors," IEE Proc., Part E, vol. 136, no. 3, pp. 178-186, May 1989.
15. D.H. Linder and J.C. Harden, "An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes," IEEE Trans. Computers, vol. 40, no. 1, pp. 2-12, Jan. 1991.
16. S.A. Felperin, L. Gravano, G. Pifarré, and J.L.C. Sanz, "Fully-Adaptive Routing: Packet Switching Performance and Wormhole Algorithms," Supercomputing, pp. 654-663, 1991.
17. P.E. Berman, L. Gravano, G. Pifarré, and J.L.C. Sanz, "Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks," Proc. Symp. Parallel Algorithms and Architectures, 1992.
18. R.V. Boppana and S. Chalasani, "New Wormhole Routing Algorithms for Multicomputers," Technical Report ECE-92-7, Univ. of Wisconsin, Madison, Oct. 1992.
19. T. Nguyen and L. Snyder, "Performance of Minimal Adaptive Routers," Proc. Parallel Computer Routing and Comm. Workshop, pp. 60-71, May 1994.
20. B.J. Smith, "Architecture and Applications of the HEP Multiprocessor Computer System," Proc. SPIE, pp. 241-248, 1981.
21. N.F. Maxemchuk, "Comparison of Deflection and Store-and-Forward Techniques in the Manhattan Street and Shuffle-Exchange Networks," Proc. IEEE INFOCOM '89, pp. 800-809, 1989.
22. C. Fang and T. Szymanski, "An Analysis of Deflection Routing in Multi-Dimensional Regular Mesh Networks," Proc. IEEE INFOCOM '91, pp. 859-868 Apr. 1991.
23. D. Smitley, "Design Tradeoffs for a High Speed Network Node," Technical Report SRC-TR-89-007, Supercomputing Research Center Inst. for Defense Analysis, Bowie, Md., July 1989.
24. J.Y. Ngai and C.L. Seitz, "A Framework for Adaptive Routing in Multicomputer Networks," Proc. Symp. Parallel Algorithms and Architectures, pp. 1-9, 1989.
25. S. Konstantinidou and L. Snyder, "The Chaos Router: A Practical Application of Randomization in Network Routing," Proc. Symp. Parallel Algorithms and Architectures, pp. 21-30, 1990.
26. B. Coates, A. Davis, and K. Stevens, "The Post Office Experience: Designing a Large Asynchronous Chip," Proc. HICSS, 1993.
27. W.J. Dally and H. Aoki, "Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 4, pp. 466-475, Apr. 1993.
28. J.Y. Ngai, "A Framework for Adaptive Routing in Multicomputer Networks," PhD thesis, California Inst. of Technology, Pasadena, May 1989.
29. K. Bolding, "Chaotic Routing: Design and Implementation of an Adaptive Multicomputer Network Router," PhD thesis, Univ. of Washington, Seattle, July 1993.
30. K. Aoyama, "Design Issues in Implementing an Adaptive Router," MS thesis, Univ. of Illinois at Urbana-Champaign, 1993.
31. M.L. Fulgham and L. Snyder, "A Comparison of Input and Output Driven Routers," Lecture Notes in Computer Science, Proc. Euro-Par '96, 1996.
32. C.L. Seitz and W.-K. Su, "A Family of Routing and Communication Chips Based on the Mosaic," Symp. Integrated Systems: Proc. of the 1993 Washington Conf., pp. 320-337, 1993.
33. K. Bolding and W. Yost, "Design of a Router for Fault-Tolerant Networks," Proc. Parallel Computer Routing and Comm. Workshop, pp. 226-240, May 1994.
34. N. McKenzie, K. Bolding, C. Ebeling, and L. Snyder, "CRANIUM: An Interface for Message Passing on Adaptive Packet Routing Networks," Proc. Parallel Computer Routing and Comm. Workshop, pp. 266-280, May 1994.
35. W. Dally, "Virtual-Channel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
36. K. Bolding, M. Fulgham, and L. Snyder, "The Case for Chaotic Adaptive Routing," Technical Report CSE-94-02-04, Univ. of Washington, Feb. 1994.
37. C.D. Thompson, "Area-Time Complexity for VLSI," Proc. Ann. Sym. Theory of Computing, pp. 81-88, May 1979.
38. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, 1992.
39. M.J. Pertel, "A Critique of Adaptive Routing," Technical Report CS-TR-92-06, California Inst. of Technology, Pasadena, June 1992.