An efficient write-all algorithm for fail-stop PRAM without initialized memory (Q1208446)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 166450
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient write-all algorithm for fail-stop PRAM without initialized memory |
scientific article; zbMATH DE number 166450 |
Statements
An efficient write-all algorithm for fail-stop PRAM without initialized memory (English)
0 references
16 May 1993
0 references
The aim of this paper is to bridge the gap between realizable parallel computers and the parallel random access machines [\textit{S. Fortune} and \textit{J. Wyllie}, Parallelism in random access machines, Proc. 10th ACM Symp. on Theory of Computing, 114-118 (1978)], with their unrealistic features of broad bandwidth memory access, processor synchrony and freedom from faults. The author eliminates the assumption that any amount of clear initial memory is available and presents fault-tolerant algorithms that can be used to simulate parallel random access machines using contaminated memory.
0 references
fault tolerance
0 references
parallel random access machines
0 references
0.8578317165374756
0 references
0.8230445384979248
0 references
0.821530818939209
0 references
