Configuration of VLSI Arrays in the Presence of Defects
Journal of the ACM (JACM)
A new look at fault tolerant network routing
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Robust algorithms for packet routing in a mesh
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Fast computation using faulty hypercubes
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Computing with unreliable information
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On subcube dependability in a hypercube
SIGMETRICS '91 Proceedings of the 1991 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Approximate load balancing on dynamic and asynchronous networks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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
Embedding and Reconfiguration of Binary Trees in Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes
IEEE Transactions on Computers
Embedding of Rings and Meshes onto Faulty Hypercubes Using Free Dimensions
IEEE Transactions on Computers
A Unified Task-Based Dependability Model for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Routing in Modular Fault-Tolerant Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Embedding Fibonacci Cubes into Hypercubes with Omega(2cn) Faulty Nodes
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Models and Techniques for Communication in Dynamic Networks
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Origin-based fault-tolerant routing in the mesh
HPCA '95 Proceedings of the 1st IEEE Symposium on High-Performance Computer Architecture
Software for multiprocessor networks on chip
Networks on chip
The effect of faults on network expansion
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
A generalized fault-tolerant sorting algorithm on a product network
Journal of Systems Architecture: the EUROMICRO Journal
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
Load-balance and fault-tolerance for embedding a complete binary tree in an IEH with N-expansion
WSEAS Transactions on Computers
Information and Computation
Fault-tolerant mapping of a mesh network in a flexible hypercube
WSEAS Transactions on Computers
Fault-tolerant meshes and tori embedded in a faulty supercube
WSEAS Transactions on Computers
WSEAS Transactions on Information Science and Applications
On fault-tolerant embedding of meshes and tori in a flexible hypercube with unbounded expansion
WSEAS TRANSACTIONS on SYSTEMS
Priority queues resilient to memory faults
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.01 |
We consider the computational power of a hypercube containing a potentially large number of randomly located faulty components. In particular, we describe algorithms for embedding an N/2-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/2-node hypercube are mapped to functioning cells at distance 3 or less apart in the N-node hypercube. The algorithm is deterministic, easy to implement and runs in &Ogr;(log N) steps using only local control. We also describe ways to produce embeddings which allow for low delay simulations, as well as ways to use a faulty hypercube to efficiently simulate a completely functioning hypercube of the same size.