An efficient write-all algorithm for fail-stop PRAM without initialized memory (Q1208446): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(92)90090-i / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074323379 / rank | |||
Normal rank | |||
Latest revision as of 09:57, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient write-all algorithm for fail-stop PRAM without initialized memory |
scientific article |
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
