Clock construction in fully asynchronous parallel systems and PRAM simulation

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 1992-October, Issue , 1992, Pages 147-156

  Aumann, Yonatan ^a   Rabin, Michael O ^a,b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION LANGUAGES;

ASYNCHRONOUS PARALLEL; ASYNCHRONOUS SYSTEM; DYNAMIC SCHEDULERS;

CLOCKS;

EID: 84990672189     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1992.267777     Document Type: Conference Paper

References (13)

1. R. Cole and O. Zajicek. The APRAM: Incorporating asynchrony into the PRAM model. In Proc. of the 1st ACM Symposium on Parallel Architectures and Algorithms, pages 169-178, 1989.
2. P. B. Gibbons. A more practical PRAM model. In Proc. of the 1st ACM Symposium on Parallel Architectures and Algorithms, pages 158-168, 1989.
3. M. Herlihy. Impossibility and universality results for wait-free synchronization. In Proceedings of the 7th Annual ACM Symposium on the Principles of Distributed Computing, pages 276-290, 1988.
4. M. Herlihy. Impossibility results for asynchronous PRAM. In Proc. of the 3rd ACM Symposium on Parallel Architectures and Algorithms, pages 327-336, 1991.
5. Z. M. Kedem, K. V. Palem, M. O. Rabin, and A. Raghunathan. Efficient program transformation for resilient parallel computation via randomization. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, 1992.
6. Z.M. Kedem, K.V. Palem, A. Raghunathan, and P.G. Spirakis. Combining tentative and definite executions for very fast dependable parallel computing. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pages 381-390, 1991.
7. Z.M. Kedem, K.V. Palem, and P.G. Spirakis. Efficient robust parallel computations. In Proceedings of the 22rd Annual ACM Symposium on Theory of Computing, pages 138-148, 1990.
8. P Kanellakis and A. Shvartsman. Effecient parallel algorothms on restartable fail-stop processors. In Proceedings of the 10th Annual ACM Symposium on the Principles of Distributed Computing, pages 23-36, 1991.
9. L. Lamport. On interprocess communication. Part i: Basic formalism, and Part ii: Algorithms. Distributed Computing, 1(12):77-101, 1986.
10. C. Martel, R. Subramonian and A. Park. Asynchronous PRAMs are (almost) as good as synchronous PRAMs. In Proceedings of the 31st Annual Symposium on the Foundations of Computer Science, pages 590-599, 1990.
11. C. Martel and R. Subramonian. On the complexity of certified write-all algorithms. Unpublished Manuscript.
12. M. Nishimura. Asynchronous shared memory parallel computations. In Proc. of the 2nd ACM Symposium on Parallel Architectures and Algorithms, pages 76-84, 1990.
13. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, August 1990.