The Community for Technology Leaders
Green Image
<p>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.</p>
hypercube networks; fault tolerant computing; parallel algorithms; parallel algorithm; multibutterfly network reconfiguration; faulty switches; deterministic algorithm; off-line computation; worst-case faults.

B. Maggs, S. Plotkin and A. Goldberg, "A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches," in IEEE Transactions on Computers, vol. 43, no. , pp. 321-326, 1994.
80 ms
(Ver 3.3 (11022016))