Issue No. 12 - December (1997 vol. 46)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.641929
<p><b>Abstract</b>—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.</p>
Routing, interconnection networks, adaptive, multicomputer, VLSI, nonminimal, torus, mesh.
K. Bolding, L. Snyder and M. Fulgham, "The Case for Chaotic Adaptive Routing," in IEEE Transactions on Computers, vol. 46, no. , pp. 1281-1292, 1997.