Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks

Simple deterministic O(log N)-step algorithms for routing permutations of packets in multibutterflies and randomly wired splitter networks are described. The algorithms are robust against faults (even in the worst case), and are efficient from a practical point of view. As a consequence, it is found that the multibutterfly is an excellent candidate for a high-bandwidth low-diameter switching network underlying a shared-memory machine. >

[1]  Frank Thomson Leighton,et al.  Tight Bounds on the Complexity of Parallel Sorting , 1984, IEEE Transactions on Computers.

[2]  Joel Friedman,et al.  Expanding graphs contain all small trees , 1987, Comb..

[3]  János Komlós,et al.  Sorting in c log n parallel sets , 1983, Comb..

[4]  E T. Leighton,et al.  Introduction to parallel algorithms and architectures , 1991 .

[5]  S. K. Park,et al.  Random number generators: good ones are hard to find , 1988, CACM.

[6]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[7]  R.R. Kock.  Increasing the size of a network by a constant factor can increase performance by more than a constant factor , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[8]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[9]  Marc Snir,et al.  A Unified Theory of Interconnection Network Structure , 1986, Theor. Comput. Sci..

[10]  Richard Koch.  Increasing the Size of a Network by a Constant Factor can Increase Performance by more than a Constant Factor , 1992, SIAM J. Comput..

[11]  Bruce M. Maggs,et al.  On-line algorithms for path selection in a nonblocking network , 1990, STOC '90.

[12]  Thomas F. Knight,et al.  Technologies for low latency interconnection switches , 1991, SPAA '89.

[13]  Eli Upfal,et al.  An O(log N) deterministic packet-routing scheme , 1992, JACM.

[14]  Anna R. Karlin,et al.  Asymptotically tight bounds for computing with faulty arrays of processors , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[15]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[16]  M. Murty.  Ramanujan Graphs , 1965 .

[17]  Michael O. Rabin,et al.  Efficient dispersal of information for security, load balancing, and fault tolerance , 1989, JACM.

[18]  C. Thomborson,et al.  A Complexity Theory for VLSI , 1980 .

[19]  Bruce M. Maggs,et al.  A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches , 1994, IEEE Trans. Computers.

[20]  Marc Snir,et al.  The Performance of Multistage Interconnection Networks for Multiprocessors , 1983, IEEE Transactions on Computers.

[21]  Nabil Kahale,et al.  Better expansion for Ramanujan graphs , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[22]  Eli Upfal,et al.  Fault Tolerance in Networks of Bounded Degree , 1988, SIAM J. Comput..

[23]  Bruce M. Maggs,et al.  Empirical evaluation of randomly-wire multistage networks , 1990, Proceedings., 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[24]  Norihisa Suzuki,et al.  Fault-tolerant Design for Multistage Routing Networks , 1992 .

[25]  Frank Thomson Leighton,et al.  Fast computation using faulty hypercubes , 1989, STOC '89.

[26]  Scott E. Fahlman,et al.  The hashnet interconnection scheme , 1980 .

[27]  Randall Rettberg,et al.  The Monarch parallel processor hardware design , 1990, Computer.