Chaos router: Finally, a practical adaptive router?
The Chaos router is compared with several contemporary adaptive router designs as well as with the state-of-the-art oblivious router used in contemporary parallel machines. The Chaos router is argued to approximate the oblivious router for raw performance and to be superior (as indicated in simulation studies) at high traffic loads and nonuniform loads.
KeywordsVirtual Channel Productive Channel Deadlock Prevention Critical Path Delay High Traffic Load
Unable to display preview. Download preview PDF.
- K. Bolding , Nonuniformities introduced by virtual channel deadlock prevention, Technical Report TR 92-07-07, Computer Science and Engineering, University of Washington.Google Scholar
- K. Bolding and L. Snyder , Mesh and torus chaotic routing, Proceedinsgs Brown/MIT Conference on Advanced Research in VLSI, MIT Press, pp. 333–347.Google Scholar
- A. Borodin and J. Hopcroft , Routing, merging and sorting on parallel models of computation, Journal of Computer and Systems Sciences, 30:130–145.Google Scholar
- R. Cypher and L. Gravano , Adaptive, Deadlock-Free Packet Routing in Torus Networks with Minimal Storage, Proceedings of International Conference on Parallel Processing, 3:204–211.Google Scholar
- W. Dally and C. Seitz , The torus routing chip, Journal of Distributed Computing, Vol. 1, No. 3.Google Scholar
- W. Dally and C. Seitz , Deadlock-free message routing in multiprocessor interconnection networks, IEEE Transactions on Computers, C-36(5):547–553.Google Scholar
- C. Fang and T. Szymanski , An analysis of deflection routing in multi-dimensional regular mesh networks, Proceedings IEEE INFOCOM '91, pp. 859–868.Google Scholar
- S. Felperin, G. Pifarre, L. Gravano and J. Sanz , Fully adaptive, minimal deadlock-free routing in hypercubes, meshes and other networks, Proceedings ACM Symposium on Parallel Algorithms and Architectures, pp. 278–291.Google Scholar
- P. Kermani and L. Kleinrock , Virtual cut-through: A new computer communication switching technique, Computer Networks, 3:267–286.Google Scholar
- S. Konstantinidou , personal communication.Google Scholar
- S. Konstantinidou , Adaptive, minimal routing in hypercubes, Proceedings MIT Conference on Advanced Research in VLSI, pp. 139–153.Google Scholar
- S. Konstantinidou and L. Snyder , The chaos router: A practical application of randomization in network routing, Proceedings ACM Symposium on Parallel Algorithms and Architectures, pp. 21–30.Google Scholar
- S. Konstantinidou  Deterministic and chaotic routing in multicomputers, PhD Dissertation, University of Washington.Google Scholar
- S. Konstantinidou and L. Snyder , The chaos router: Architecture and performance, Proceedings International Symposium on Computer Architecture, IEEE pp. 212–222.Google Scholar
- D. Krizanc, C. Kaklamanis and A. Tsantilas , Tight bounds for oblivious routing in the hypercube, Proceedings ACM Symposium on Parallel Algorithms and Architectures, pp. 31–36.Google Scholar
- N. Maxemchuk  Comparison of deflection and store-and-forward techniques in the manhattan street and shuffle-exchange networks, Proceedings of IEEE INFOCOM '89, pp. 800–809.Google Scholar
- J. Ngai and C. Seitz , A framework for adaptive routing in multicomputer networks, Proceedings of Symposium on Parallel Algorithms and Architectures, pp. 1–9.Google Scholar
- B. Smith , Architecture and application of the HEP multiprocessor computer system, Proceedings of SPIE, pp. 241–248.Google Scholar
- D. Smitley , Design tradeoffs for a high speed network node. Technical Report SRC-TR-89-007, Supercomputing Research Center, Bowie MD.Google Scholar