Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Robust algorithms for packet routing in a mesh
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Efficient parallel algorithms can be made robust
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Work-preserving emulations of fixed-connection networks
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A bridging model for parallel computation
Communications of the ACM
Efficient robust parallel computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Combining tentative and definite executions for very fast dependable parallel computing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Asymptotically optimal PRAM emulation on faulty hypercubes (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Multi-scale self-simulation: a technique for reconfiguring arrays with faults
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Approximate load balancing on dynamic and asynchronous networks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Improved methods for hiding latency in high bandwidth networks (extended abstract)
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Automatic methods for hiding latency in high bandwidth networks (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Efficient automatic simulation of parallel computation on networks of workstations
Discrete Applied Mathematics
Efficient automatic simulation of parallel computation on networks of workstations
Discrete Applied Mathematics
| Hi-index | 0.00 |
We present and O(1) slowdown emulation of a fault-free N x N two dimensional mesh with a slack of O(log N log log N) by a faulty mesh of the same size and slack. All components of the faulty mesh, including the memory modules, are assumed to be subject to failure. The faults may occur at any time during the emulation and the system readjusts dynamically.