Efficient program transformations for resilient parallel computation via randomization

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 306-317

  Kedem, Z M ^a   Palem, K V ^b   Rabin, M O ^c,d   Raghunathan, A ^e  

^a NEW YORK UNIVERSITY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c HARVARD UNIVERSITY   (United States)

^d HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^e UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS MACHINERY; COMPUTATION THEORY; PARALLEL PROCESSING SYSTEMS; AUTOMATA THEORY; RANDOM PROCESSES; SYNCHRONIZATION;

ASYNCHRONOUS MACHINE; ASYNCHRONY; PARALLEL COMPUTATION; PARALLEL MACHINE; PROGRAM TRANSFORMATIONS; SPACE EFFICIENT;

PROGRAM PROCESSORS;

ASYNCHRONOUS MACHINES; CONTINUALLY PROGRESSIVE EXECUTION; PRIMITIVES; PROGRAM TRANSFORMATIONS; RANDOMIZATION; READ AND WRITE INSTRUCTIONS;

EID: 0026981386     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129742     Document Type: Conference Paper

References (35)

1. M. Ben-Or, "Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols," Proc. 2nd ACM Symposium on Principles of Distributed Computing, 27-30, 1983.
2. Y. Aumann and M. Ben-Or, "Asymptotically Optimal PRAM Emulation on Faulty Hypercube," Proc. 32nd IEEE Symp. on Foundations of Computer Science, pp. 440-446, 1991.
3. Y. Aumann and M. Ben-Or, "Computing with Faulty Arrays," Proc. 24th ACM Symposium on Theory of Computing, 1992 (to appear).
4. S. Ben-David, A. Borodin, R. Karp, E. Tardos, and A. Wigderson, "On the Power of Randomization in Online Algorithms," Proc. 22nd ACM Symposium on Theory of Computing, 1990.
5. P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems, Addison-Wesley, 1987.
6. F. Christian, "Probabilistic Clock Syn- chronization," Distributed Computing, 3:146-158, 1989.
7. R. Cole and O. Zajicek, "The APRAM: Incorporating Asynchrony into the PRAM Model," Proc. 1989 ACM Symp. on Parallel Algorithms and Architectures, 170-178, 1989.
8. R. Cole and O. Zajicek, "The Expected Advantage of Asynchrony," Proc. 2nd ACM Symp. on Parallel Algorithms and Architectures, 85-94, 1990.
9. D. Dolev, J. Halpern, B. Simons, and R. Strong, "Fault-tolerant Clock Synchronization," Proc. 3rd ACM Symp. on Principles of Distributed Computing, 89-102, 1984.
10. M. Dubois, C. Scheurich, and F. Briggs, "Synchronization, Coherence, and Event Ordering in Multiprocessors," IEEE Computer, 9-21, 1988.
11. M. Fischer, N. Lynch, and M. Paterson, "Impossibility of Distributed Consensus," j. of the ACM, 32(2):374-382, 1985.
12. S. Fortune and J. Wyllie, "Parallelism in Random Access Machines," Proc. 10th ACM Symp. on Theory of Computing, 114-118, 1978.
13. P. Gibbons, "A More Practical PRAM Model," Proc. 1989 ACM Symp. on Parallel Algorithms and Architectures, 158168, 1989.
14. M. Herlihy, "Impossibility and Universal- ity results for Wait-free Synchronization," Proc. 7th ACM Symp. on Principles of Distributed Computing, 276-290, 1988.
15. M. Herlihy, "A Methodology for Imple- menting Highly Concurrent Data Structures," Proc. 2nd ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming, 197-206, 1990.
16. M. Herlihy, "Wait-free Synchronization," ACM Trans, on Programming Languages and Systems, 13(1):124-149,1991.
17. M. Herlihy, "Impossibility Results for Asynchronous PRAM," Proc. 3rd ACM Symp. on Parallel Algorithms and Architectures, 327-336, 1991.
18. M. Herlihy, "Randomized Wait-Free Concurrent Objects," Proc. 10th ACM Symp. on Principles of Distributed Computing, 11-21, 1991.
19. P. Kanellakis and A. Shvartsman, "Efficient Parallel Algorithms Can be Made Robust," Proc. 8th ACM Symp. on Principles of Distributed Computing, 211-222, 1989.
20. P. Kanellakis and A. Shvartsman, "Efficient Parallel Algorithms on Restartable Fail-stop Processors," Proc. 10th ACM Symp. on Principles of Distributed Computing, 23-36, 1991.
21. Z. Kedem, K. Palem, and P. Spirakis, "Efficient Robust Parallel Computations," Proc. 22nd ACM Symp. on Theory of Computing, 138-148, 1990.
22. Z. Kedem, K. Palem, A. Raghunathan, and P. Spirakis, "Combining Tentative and Definite Algorithms for Very Fast Dependable Parallel Computing," Proc. 23rd ACM Symp. on Theory of Computing, 381-390, 1991.
23. L. Lamport, "Time, Clocks and the Ordering of Events in a Distributed System," Comm. of the ACM, 21(7):558-565, 1978.
24. J. Lundelius and N. Lynch, "An Upper and Lower Bound for Clock Synchronization," Information and Control, 62:190204, 1984.
25. L. Lamport and P. Melliar-Smith, "Syn- chronizing Clocks in the Presence of Faults," J. of the ACM, 32(l):52-78, 1985.
26. C. Martel, A. Park, and R. Subra-monian, "Fast Asynchronous Algorithms for Shared Memory Parallel Computers," Tech. Rep. CSE-89-8, Univ. of California-Davis, 1-17, July 25, 1989.
27. C. Martel and R. Subramonian, "On the Complexity of Certified Write All Algorithms," Manuscript, 1991.
28. C. Martel, R. Subramonian, and A. Park, "Asynchronous PRAMs are (Almost) as Good as Synchronous PRAMs," Proc. 32nd IEEE Symp. on Foundations of Computer Science, 590-599, 1990.
29. N. Nishimura, "Asynchrony in Shared Memory Parallel Computations," TR-253/91, University of Toronto, 1991.
30. S. Plotkin, "Sticky Bits and Universality of Consensus," Proc. 8th ACM Symp. on Principles Distributed Computing, 159176, 1989
31. M. Rabin, "The Choice Coordination Problem," Acta Informatica, 17:121-134, 1982.
32. M. Rabin, "Randomized Byzantine Gen- erals," Proc. 24th IEEE Symp. on Foundations of Computer Science, 403-409, 1983.
33. M. Rabin, "Efficient Dispersal of In- formation for Security, Load Balancing and Fault Tolerance," J. of the ACM, 36(2):335-348, 1989.
34. R. Subramonian, Asynchronous Algorithms for Shared-Memory Parallel Computers, Ph.D. Dissertation, University of California, Davis, 1991.
35. L. Valiant, "A Bridging Model for Parallel Computation," Comm. of the ACM, 33(8):103-111, 1990.