A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches,
Abstract
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 offline computation, even though many of the switches may be faulty. The algorithm reconfigures an N-input multibutterfly network in O(log N) time.
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1992
- Accession Number
- ADA322814
Entities
People
- Andrew N. Goldberg
- Bruce Maggs
- Serge Plotkin
Organizations
- Stanford University