A PRAM (parallel random-access-machine) model that allows processors to have arbitrary asynchronous behavior is introduced. The main result shows that any n-processor CRCW (concurrent-read, concurrent-write) PRAM program can be simulated on an asynchronous CRCW PRAM using O(n) expected work per parallel step and up to n/log n log*n asynchronous processors. It is shown that a synchronization primitive for n parallel instructions can be computed using O(n) expected work by a system of asynchronous processors. Since a special case of asynchronous behavior is a fail-stop error, the simulation technique described above can convert any PRAM program into a PRAM program that is resistant to all fail-stop errors and has the same expected work as the original program
Published in:
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
Date of Conference:
22-24 Oct 1990
- Page(s):
-
590
-
599 vol.2
- Meeting Date :
-
22 Oct 1990-24 Oct 1990
- Print ISBN:
-
0-8186-2082-X
- INSPEC Accession Number:
-
3908538
- Conference Location :
-
St. Louis, MO
- Digital Object Identifier :
-
10.1109/FSCS.1990.89580
- Product Type:
-
Conference Publications