Reconfiguring a hypercube in the presence of faults
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Fault tolerance in hypercube-derivative networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A new look at fault tolerant network routing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Fault tolerance in hypercube-derivative networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Robust algorithms for packet routing in a mesh
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Running algorithms efficiently on faulty hypercubes
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Fast algorithms for bit-serial routing on a hypercube
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Fast-fault-tolerant parallel communication and on-line maintenance using information dispersal
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Coding theory, hypercube embeddings, and fault tolerance
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Fault tolerance in hypercube-derivative networks (preliminary version)
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Running algorithms efficiently on faulty hypercubes (extended abstract)
ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures
Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Optimal routing of parentheses on the hypercube
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Robust bounded-degree networks with small diameters
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Tolerating Faults in Hypercubes Using Subcube Partitioning
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Fault-tolerant meshes with small degree
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Approximate load balancing on dynamic and asynchronous networks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Construction of the mesh and the torus tolerating a large number of faults
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
On the fault tolerance of the butterfly
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Optimal Simulation of Full Binary Trees on Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Global Commutative and Associative Reduction Operations in Faulty SIMD Hypercubes
IEEE Transactions on Computers
All-To-All Broadcast and Matrix Multiplication in Faulty SIMD Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Fault tolerant networks with small degree
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fault-Tolerant Meshes with Small Degree
IEEE Transactions on Computers
Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares
IEEE Transactions on Computers
Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes
IEEE Transactions on Computers
Subcube Fault Tolerance in Hypercube Multiprocessors
IEEE Transactions on Computers
Free Dimensions-An Effective Approach to Achieving Fault Tolerance in Hypercubes
IEEE Transactions on Computers
Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Nearly Optimal One-to-Many Parallel Routing in Star Networks
IEEE Transactions on Parallel and Distributed Systems
On Some Global Operations in Faulty SIMD Hypercubes
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Dynamically Fault-Tolerant Content Addressable Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Routing complexity of faulty networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Routing complexity of faulty networks
Random Structures & Algorithms
Priority queues resilient to memory faults
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.02 |
We consider the computational power of a hypercube containing a potentially large number of randomly located faulty components. We describe a randomized algorithm which embeds an N-node hypercube in an N-node hypercube with faulty processors. Provided that the processors of the N-node hypercube are faulty with probability p N-node hypercube with faults can simulate T steps of an N-node fault-free hypercube in O(T) steps. The embedding is easy to construct in polylogarithmic time using only local control. We also describe O(log N)-step routing algorithms which ensure the delivery of messages with high probability even when a constant fraction of the nodes and edges have failed. The routing results represent the first adaptive routing algorithms for which an effective theoretical analysis has been achieved.