Fault tolerance in hypercube-derivative networks (preliminary version)

Authors:
Fred Annexstein
Affiliations:
Department of Computer and Information Science, University of Massachusetts, Amherst, MA
Venue:
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Year:
1991

Citing 5
Cited 3

Broadcasting with random faults

Discrete Applied Mathematics
Efficient dispersal of information for security, load balancing, and fault tolerance

Journal of the ACM (JACM)
Fast computation using faulty hypercubes

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Universal schemes for parallel communication

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Shuffle-Oriented Interconnection Networks

Shuffle-Oriented Interconnection Networks

Survivable Networks with Bounded Delay: The Edge Failure Case

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Self-spanner graphs

Discrete Applied Mathematics - Special issue: Max-algebra
Self-spanner graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present algorithms which reconfigure faulty deBruijn and Butterfly networks. We show that, with high probability, an N-node deBruijn (resp., Butterfly) network with uniformly distributed faulty processors can simulate a fault-free N-node deBruijn (resp., Butterfly) network with a slowdown factor of O(log log N). Our configuration algorithm is deterministic, operates in a distributed fashion, uses only local control, and takes time O(log2 N).