This Article 
 Bibliographic References 
 Add to: 
The Case for Chaotic Adaptive Routing
December 1997 (vol. 46 no. 12)
pp. 1281-1292

Abstract—Chaotic routers are randomizing, nonminimal adaptive packet routers designed for use in the communication networks of parallel computers. Chaotic routers combine the flexibility found in adaptive routing with a design simple enough to be competitive with the most streamlined oblivious routers. We review chaotic routing and compare it with other contemporary network routing approaches, including state-of-the-art oblivious and adaptive routers. A detailed head-to-head comparison between oblivious, minimal adaptive, and chaotic routing is then presented, exploring the performance of comparable VLSI implementations through analysis and simulation. The results indicate that chaotic routers provide very effective and efficient high-performance message routing.

[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.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[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, vol. 5, no. 3, pp. 225-246, Mar. 1994.
[6] G. Waldman, J. Wootton, and G. Hobson, “Visual Detection with Search: An Empirical Model,” IEEE Trans. Systems, Man, and Cybernetics, vol. 21, pp. 596-606, 1991.
[7] L.G. Valiant and G.J. Brebner,"Universal Schemes for Parallel Communication," Proc. 13th Ann. ACM Symp. Theory of Computing, pp. 263-277, May 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. 19th Int'l Symp. Computer Architecture, vol. 20, no. 2, pp. 278-287, May 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. 19th Int'l Symp. Computer Architecture, vol. 20, no. 2, 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. 3rd ACM Symp. Parallel Algorithms Architectures, June 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. 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. Felperin, L. Gravano, G. Pifarre, and J. Sanz, "Fully-adaptive routing: Packet switching performance and wormhole algorithms," Proc. Supercomputing '91, pp. 654-663, 1991.
[17] P. Berman, L. Gravano, J. Sanz, and G. Pifarre, "Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks," Proc. Fourth ACM Symp. Parallel Algorithms and Architectures, June 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 Communication Workshop, 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. INFORCOM '89, vol. 3, pp. 800-809, Apr. 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. ACM Symp. Parallel Algorithms Architectures, 1989.
[25] S. Konstantinidou and L. Snyder, "The Chaos Router: A Practical Application of Randomization in Network Routing," Proc. 2nd ACM Symp. Parallel Algorithms Architectures, 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 Tech nology, 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,” Proc. 1993 Symp. Research on Integrated Systems, pp. 320-337, 1993.
[33] K. Bolding and W. Yost, "Design of a Router for Fault-Tolerant Networks," Proc. 1994 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.J. 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. 11th Ann. Symp. Theory of Computing, pp. 81-88, 1979.
[38] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[39] M.J. Pertel, "A Critique of Adaptive Routing," Technical Report CS-TR-92-06, Dept. of Computer Science, California Inst. of Tech nology, 1992.

Index Terms:
Routing, interconnection networks, adaptive, multicomputer, VLSI, nonminimal, torus, mesh.
Kevin Bolding, Melanie Fulgham, Lawrence Snyder, "The Case for Chaotic Adaptive Routing," IEEE Transactions on Computers, vol. 46, no. 12, pp. 1281-1292, Dec. 1997, doi:10.1109/12.641929
Usage of this product signifies your acceptance of the Terms of Use.