Combining tentative and definite executions for very fast i)ependable parallel computing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130073, Issue , 1991, Pages 381-390

  Kedem, Z M ^a,b   Palem, K V ^c   Raghunathan, A ^d   Spirakis, P G ^e  

^a ÉCOLE DES HAUTES ÉTUDES EN SCIENCES SOCIALES   (France)

^b NEW YORK UNIVERSITY   (United States)

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

^d UNIVERSITY OF CALIFORNIA   (United States)

^e UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; PROGRAM PROCESSORS;

DYNAMIC RESOURCES; EFFICIENT STRATEGY; FAILURE MODEL; NON-TRIVIAL PROGRAMS; PARALLEL MACHINE; ROBUST EXECUTION; UNRELIABLE MACHINE;

PARALLEL PROCESSING SYSTEMS;

EID: 84990703309     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. A. Aggarwal, A. Chandra, and M. Snir, "Hierarchical Memory with Block transfer, " Proc. 28th IEEE Symp. on Foundations of Computer Science, pp. 204-216, 1987
2. A. Aho, J. Hopcroft, J. Unman The Design and Analysia of Computer Algorithms, Addison-Wesley 1974
3. P. Bernstein, V. Hadzilacos, and N. Good- Z. Kedem, K. Palem, and P. Spirakis, "Effi-man, Concurrency Control and Recovery in Database Sema, Addison-Wesley, 1987
4. R. Brent, "The Parallel Evaluation of General Arithmetic Expressions, JA CM, vol 21, no. 3, pp. 201-206, 1974
5. S. Cook, C. Dwork, and R. Reischuk, "Up per and Lower time Bounds for Parallel Random Access Machines without Simult neous Writes, SIAM J. Computing, vol. 15, no. 1, pp. 87-97, 1986
6. W. Cellary, E. Gelenbe, and T. Morzy, Concurrency Control in Distributed Database Sydems, North-Holland, 1988
7. R. Cole and O. Zajicek, "The APRAM: Incorporating Asynchrony into the PRAM Model, " PTOC.1989A CM Symp. on Parallel Algorithms and Architectures, pp. 170-178, 1989
8. R. Cole and O. Zajicek, "The Expected Advantage of Asynchrony, W PTOC. 2nd Annual ACM Symp, on Parallel Algorithms and Architectures, pp. 85-94, 1990
9. S. Fortune and J. W yllie, "Parallelism in Random Access Machines, " Proc. 10th ACM Symp. on Theorg of Computing, pp 114-118, 1978
10. P. Gibbons, "A More Practical PRAM Model, " Proc. 1989 ACM Symp. on Parallel Algorithms and Architectures, pp. 158-168, 1989
11. D. Jefferson, "Virtual Time II: Storage Management in Distributed Simulation, " PTOC. 9th A CM Symp. on Principles of Distributed Computing, pp. 75-89, 1990
12. P. Kanellakh and A. Shvartsman, "Efficient Parallel Algorithms Can be Made Robust , " Tech. Rep. CS-89-35, Brown Univ., pp. 1-28, October 24, 1989. (Preliminary version appeared in PTOC, 8th ACM SwnP. on Principles of Diibuted Computing, pp. 21 l-222, 1989.)
13. P. Kanellakis and A. Shvartsman, On Efficient Parallel Algorithms in the Presence of Omiwion Errors, " Unpublished manuscript, October 9, 1990
14. cient Robust Parallel Computations, n Proc 22nd ACM Symp, on Theory of Computing, pp. 138-148, 1990
15. C. Martel, A. Park, and R. Subramonian, "Fast Asynchronous Algorithms for Shared Memory Parallel Computers, n Tech. Rep
16. CSE-89-8, Univ. of California-Davis, pp. l-17, July 25, 1989
17. C. Martel, R. Subramonian, and A. Park, Asynchronous PRAMs are (Almost) as Good aa Synchronous PRAMs, " PTOC. 82nd IEEE Symp. on Foundations of ComputeT Science, pp. 590-599, 1990
18. N. Nishimura, "Asynchronous Shared Memory Parallel Computations, " Proc. 2nd Annual ACM Symp. on Parallel Algorithms and Architectures, pp. 76-84, 1990
19. M. Rabin, "Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance, " JACM, vol. 36, no. 2, pp. 335-348, 1989
20. A. Ranade, "How to Emulate Shared Memory, " Proc. 28th IEEE Symp. on Foundation of Computer Science, pp. 185-194, 1987
21. A. Shvartsman, Achieving Optimal CRCW Fault-Tolerance, " Tech. Rep CS-89-49, Brown Univ., pp: 1-8, December 22, 1989
22. D. Shasha and J. Turek, Beyond Fail-stop: Wait-free Serializability and Resiliency in the Presence of Slow-down Failures, n Tech Rep. 514, Dept. of Computer Science, New York Univ., pp. 1-22, September, 1990
23. L. Vahant, A Bridging Model for Parallel Computation, " CA CM, vol. 33, no. 8, pp 103-111, 1990