Skip to main content
SpringerLink
Log in
Book cover

Heinz Nixdorf Symposium at the University of Paderborn

Nixdorf 1992: Parallel Architectures and Their Efficient Use pp 146–155Cite as

Chaos router: Finally, a practical adaptive router?

Extended abstract

  • Conference paper
  • First Online:

  • 126 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 678))

Abstract

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.

Supported in part by NSF MIP-9013274, ONR N00014-91-J-1007, and NSF MIP-9213469.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • K. Bolding [1992], 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 [1992], 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 [1985], 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 [1992], 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 [1986], The torus routing chip, Journal of Distributed Computing, Vol. 1, No. 3.

    Google Scholar 

  • W. Dally and C. Seitz [1987], Deadlock-free message routing in multiprocessor interconnection networks, IEEE Transactions on Computers, C-36(5):547–553.

    Google Scholar 

  • C. Fang and T. Szymanski [1991], 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 [1991], 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 [1979], Virtual cut-through: A new computer communication switching technique, Computer Networks, 3:267–286.

    Google Scholar 

  • S. Konstantinidou [1988], personal communication.

    Google Scholar 

  • S. Konstantinidou [1990], Adaptive, minimal routing in hypercubes, Proceedings MIT Conference on Advanced Research in VLSI, pp. 139–153.

    Google Scholar 

  • S. Konstantinidou and L. Snyder [1990], 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 [1991] Deterministic and chaotic routing in multicomputers, PhD Dissertation, University of Washington.

    Google Scholar 

  • S. Konstantinidou and L. Snyder [1991], 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 [1990], Tight bounds for oblivious routing in the hypercube, Proceedings ACM Symposium on Parallel Algorithms and Architectures, pp. 31–36.

    Google Scholar 

  • N. Maxemchuk [1989] 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 [1989], A framework for adaptive routing in multicomputer networks, Proceedings of Symposium on Parallel Algorithms and Architectures, pp. 1–9.

    Google Scholar 

  • B. Smith [1981], Architecture and application of the HEP multiprocessor computer system, Proceedings of SPIE, pp. 241–248.

    Google Scholar 

  • D. Smitley [1989], Design tradeoffs for a high speed network node. Technical Report SRC-TR-89-007, Supercomputing Research Center, Bowie MD.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Washington, USA

    Lawrence Snyder

Authors
  1. Lawrence Snyder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

F. Meyer B. Monien A. L. Rosenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Snyder, L. (1993). Chaos router: Finally, a practical adaptive router?. In: Meyer, F., Monien, B., Rosenberg, A.L. (eds) Parallel Architectures and Their Efficient Use. Nixdorf 1992. Lecture Notes in Computer Science, vol 678. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56731-3_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-56731-3_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56731-8

  • Online ISBN: 978-3-540-47637-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation