Efficient parallel algorithms on restartable fail-stop processors
The authors study efficient deterministic executions of parallel algorithms on restartable fail-stop CRCW PRAMs. They allow the PRAM processors to be subject to arbitrary stop failures and restarts, that are determined by on-line adversary, and that result in loss of private memory but do not affect shared memory. For this model, they define and justify the complexity measures of: completed work, where processors are charged for completed fixed-size update cycles, and overhead ratio, which amortizes the work over necessary work and failures. We observe that P = N restartable fail-stop processors, the Write-All problem requires omega(N log N) completed work, and this lower bound holds even under the additional assumption that processors can read and locally process the entire shared memory at unit cost. Under this unrealistic assumption they have a matching upperbound. The lower bound also applies to the expected completed work of randomized algorithms that are subject to on line adversaries. Finally, they describe a simple on-line adversary that causes inefficiency in many randomized algorithms.
- Research Organization:
- Brown Univ., Providence, RI (United States). Dept. of Computer Science
- OSTI ID:
- 5216101
- Report Number(s):
- AD-A-236249/9/XAB; CNN: N00014-91-J-1613
- Country of Publication:
- United States
- Language:
- English
Similar Records
A lower bound for the QRQW PRAM
Simulation of parallel random access machines by circuits