Advertisement

The role of randomness in the design of interconnection networks

  • Tom Leighton
  • Bruce Maggs
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 678)

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.

Keywords

Interconnection Network Circuit Switching Expansion Property Path Extension Unique Neighbor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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. [2]
    M. Ajtai, J. Komlos, and E. Szemeredi. Sorting in c logr n parallel steps. Combinatorica, 3:1–19, 1983.Google Scholar
  3. [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. [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. [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. [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. [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. [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. [9]
    C. P. Kruskal and M. Snir. A unified theory of interconnection network structure. Theoretical Computer Science, 48:75–94, 1986.Google Scholar
  10. [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. [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. [12]
    F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, San Mateo, CA, 1992.Google Scholar
  13. [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. [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. [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. [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. [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. [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

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Tom Leighton
    • 1
  • Bruce Maggs
    • 2
  1. 1.Mathematics Department and Laboratory for Computer ScienceMassachusetts Institute of TechnologyCambridge
  2. 2.NEC Research InstitutePrinceton

Personalised recommendations