Asymptotically optimal PRAM emulation on faulty hypercubes (extended abstract)

Authors:
Yonatan Aumann;Michael Ben-Or
Affiliations:
-;-
Venue:
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Year:
1991

Citing 0
Cited 4

Computing with faulty arrays

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Efficient program transformations for resilient parallel computation via randomization (preliminary version)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Deterministic computations on a PRAM with static processor and memory faults

Fundamenta Informaticae
Deterministic Computations on a PRAM with Static Processor and Memory Faults

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

A scheme for emulating the parallel random access machine (PRAM) on a faulty hypercube is presented. All components of the hypercube, 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. The scheme, which rests on L.G. Valiant's BSP model (1990), is the first to achieve optimal and work-preserving PRAM emulation on a dynamically faulty network.