A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches

This paper describes a deterministic algorithm for reconfiguring a multibutterfly network with faulty switches. Unlike previous reconfiguration algorithms, the algorithm is performed entirely by the network, without the aid of any off-line computation, even though many of the switches may be faulty. The algorithm reconfigures an N-input multibutterfly network in O(logN) time. After reconfiguration, the multibutterfly can tolerate f worst-case faults and still route any permutation between some set of N/spl minus/O(f) inputs and N/spl minus/O(f) outputs in O(log N) time. >

[1]  Bruce M. Maggs,et al.  Simple algorithms for routing on butterfly networks with bounded queues , 1992, STOC '92.

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

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

[4]  Ronald I. Greenberg,et al.  Randomized Routing on Fat-Trees (Preliminary Version) , 1985, FOCS.

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

[6]  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..

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

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

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

[10]  Bruce M. Maggs,et al.  Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks , 1992, IEEE Trans. Computers.

[11]  Eli Upfal,et al.  An O(logN) deterministic packet routing scheme , 1989, STOC '89.

[12]  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.

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