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....

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computers Vol. 43; no. 3; pp. 321 - 326
Main Authors Goldberg, A.V., Maggs, B.M., Plotkin, S.A.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.03.1994
Institute of Electrical and Electronics Engineers
Subjects
Applied sciences
Computer networks
Computer science
Computer science; control theory; systems
Exact sciences and technology
Fault diagnosis
Hardware
Laboratories
Licenses
National electric code
Parallel algorithms
Programming languages
Routing
Software
Switches
Fault tolerance
Parallel algorithm
Configuration
Network
Routing
Parallelism
Distributed system
Complexity
Online AccessGet full text
ISSN0018-9340
DOI10.1109/12.272432

Cover

More Information
Summary: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.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-9340
DOI:10.1109/12.272432