The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (1994 vol.43)
pp: 321-326
ABSTRACT
<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>
INDEX TERMS
hypercube networks; fault tolerant computing; parallel algorithms; parallel algorithm; multibutterfly network reconfiguration; faulty switches; deterministic algorithm; off-line computation; worst-case faults.
CITATION
A.V. Goldberg, B.M. Maggs, S.A. Plotkin, "A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches", IEEE Transactions on Computers, vol.43, no. 3, pp. 321-326, March 1994, doi:10.1109/12.272432
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool