Skip to main content
SpringerLink
Log in

The role of randomness in the design of interconnection networks

  • Conference paper
  • First Online:
Parallel Architectures and Their Efficient Use (Nixdorf 1992)

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

Included in the following conference series:

  • 124 Accesses

Abstract

It has recently been discovered that randomly-wired interconnection networks outperform traditional well-structured networks in several notable respects. Among other things, randomly-wired networks have been found to be exceptionally fault-tolerant and well-suited for both packet-routing and circuit-switching applications. In this paper, we survey the recent research on interconnection networks, highlighting the discovery of randomness as a useful and powerful design tool.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Aiello, T. Leighton, B. Maggs, and M. Newman. Fast algorithms for bit-serial routing on a hypercube. In Proceedings of the 1990 ACM Symposium on Parallel Algorithms and Architectures, pages 55–64, July 1990.

    Google Scholar 

  2. M. Ajtai, J. Komlos, and E. Szemeredi. Sorting in c logr n parallel steps. Combinatorica, 3:1–19, 1983.

    Google Scholar 

  3. S. Arora, T. Leighton, and B. Maggs. On-line algorithms for path selection in a non-blocking network. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 149–158, May 1990.

    Google Scholar 

  4. L. A. Bassalygo and M. S. Pinsker. Complexity of optimum nonblocking switching network without reconnections. Problems of Information Transmission, 9:64–66, 1974.

    Google Scholar 

  5. A. DeHon, T. Knight, and H. Minsky. Fault-tolerant design for multistage routing networks. Unpublished manuscript, AI Lab, MIT, Cambridge, MA, 1990.

    Google Scholar 

  6. S. E. Fahlman. The hashnet interconnection scheme. Technical Report CMU-CS-80-125, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA, June 1980.

    Google Scholar 

  7. R. R. Koch. Increasing the size of a network by a constant factor can increase performance by more than a constant factor. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 221–230. IEEE, October 1988.

    Google Scholar 

  8. S. Konstantinidou and E. Upfal. Experimental Comparison of Multistage Networks. Manuscript in Preparation, IBM Almaden Research Center, Almaden, CA, October 1991.

    Google Scholar 

  9. C. P. Kruskal and M. Snir. A unified theory of interconnection network structure. Theoretical Computer Science, 48:75–94, 1986.

    Google Scholar 

  10. C. P. Kruskal and M. Snir. The performance of multistage interconnection networks for multiprocessors. IEEE Transactions on Computers, C-32(12):1091–1098, December.

    Google Scholar 

  11. F. T. Leighton. Tight bounds on the complexity of parallel sorting. IEEE Transactions on Computers, C-34(4):344–354, April 1985.

    Google Scholar 

  12. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Mateo, CA, 1992.

    Google Scholar 

  13. T. Leighton, C. Leiserson, and M. Klugerman. Theory of Parallel and VLSI Computation: Lecture Notes. MIT/LCS/RSS 10, January, 1991.

    Google Scholar 

  14. T. Leighton, D. Lisinski, and B. Maggs. Empirical analysis of randomlywired multistage networks. Proceedings of the IEEE International Conference on Computer Design, September 1990, pp. 380–385.

    Google Scholar 

  15. T. Leighton and B. Maggs. Expanders might be practical: Fast algorithms for routing around faults in multibutterflies. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 384–389. IEEE, October 1989.

    Google Scholar 

  16. T. Leighton and G. Plaxton. A (fairly) simple circuit that (usually) sorts. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 264–274. IEEE, October 1990.

    Google Scholar 

  17. R. D. Rettberg, W. R. Crowther, P. P. Carvey, and R. S. Tomlinson. The monarch parallel processor hardware design. Computer, 23(4):18–30, April 1990.

    Google Scholar 

  18. E. Upfal. An O(log N) deterministic packet routing scheme. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 241–250, May 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics Department and Laboratory for Computer Science, Massachusetts Institute of Technology, 02139, Cambridge, Massachusetts

    Tom Leighton

  2. NEC Research Institute, 4 Independence Way, 08540, Princeton, New Jersey

    Bruce Maggs

Authors
  1. Tom Leighton
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bruce Maggs
    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

Leighton, T., Maggs, B. (1993). The role of randomness in the design of interconnection networks. 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_13

Download citation

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

  • 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