A work-optimal deterministic algorithm for the certified write-all problem with a nontrivial number of asynchronous processors

SIAM Journal on Computing

Volumn 34, Issue 4, 2005, Pages 993-1024

  Malewicz, Grzegorz ^a,b  

^a Department of Computer Science   (United States)

^b ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

Asynchrony; Certified write all; Design and analysis of parallel algorithms; Deterministic algorithms

Indexed keywords

ASYNCHRONY; CERTIFIED WRITE-ALL; DESIGN AND ANALYSIS OF PARALLEL ALGORITHMS; DETERMINISTIC ALGORITHMS;

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; PROGRAM PROCESSORS; SYNCHRONIZATION;

ALGORITHMS;

EID: 24344488448     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703428014     Document Type: Article

References (42)

1. R. J. ANDERSON AND H. WOLL, Algorithms for the certified write-all problem, SIAM J. Comput., 26 (1997), pp. 1277-1283.
2. J. ASPNES AND M. HERLIHY, Wait-free data structures in the asynchronous PRAM model, in 2nd Symposium on Parallel Algorithms and Architectures SPAA'90, 1990, pp. 340-349.
3. Y. AUMANN, M. A. BENDER, AND L. ZHANG, Efficient execution of nondeterministic parallel programs on asynchronous systems, Inform, and Comput., 139 (1997), pp. 1-16.
4. Y. AUMANN, Z. M. KEDEM, K. V. PALEM, AND M. O. RABIN, Highly efficient asynchronous execution of large-grained parallel programs, in 34th IEEE Symposium on Foundations of Computer Science FOCS'93, 1993, pp. 271-280.
5. Y. AUMANN AND M. O. RABIN, Clock construction in fully asynchronous parallel systems and PRAM simulation, Theoret. Comput. Sci., 128 (1994), pp. 3-30.
6. A. BARATLOO, P. DASGUPTA, AND Z. M. KEDEM, CALYPSO: A novel software system for fault-tolerant parallel processing on distributed platforms, in 4th International Symposium on High Performance Distributed Computing HPDC'95, 1995, pp. 122-129.
7. A. J. BERNSTEIN, Program analysis for parallel processing, IEEE Transactions on Electronic Computers, EC-15 (1966), pp. 757-762.
8. J. BUSS, P. C. KANELLAKIS, P. L. RAGDE, AND A. A. SHVARTSMAN, Parallel algorithms with processor failures and delays, J. Algorithms, 20 (1996), pp. 45-86.
9. B. CHLEBUS, S. DOBREV, D. KOWALSKI, G. MALEWICZ, A. SHVARTSMAN, AND I. VRTO, Towards practical deterministic Write-All algorithms, in 13th Symposium on Parallel Algorithms and Architectures SPAA'01, 2001, pp. 271-280.
10. B. S. CHLEBUS, A. GAMBIN, AND P. INDYK, PRAM computations resilient to memory faults, in 2nd European Symposium on Algorithms ESA'94, 1994, pp. 401-412.
11. R. COLE AND O. ZAJICEK, The APRAM: Incorporating asynchrony into the PRAM model, in 2nd ACM Symposium on Parallel Algorithms and Architectures SPAA'89, 1989, pp. 169-178.
12. R. COLE AND O. ZAJICEK, The expected advantage of asynchrony, in 3rd Annual ACM Symposium on Parallel Algorithms and Architectures SPAA'90, 1990, pp. 85-94.
13. D. CULLER, R. KARP, D. PATTERSON, A. SAHAY, K. E. SCHAUSER, E. SANTOS, R. SUBRAMONIAN, AND T. VAN EICKEN, LogP: Towards a realistic model of parallel computation, in 4th ACM Principles and Practices of Parallel Programming, 1993, pp. 1-12.
14. P. DASGUPTA, Z. M. KEDEM, AND M. O. RABIN, Parallel processing on networks of workstations: A fault-tolerant, high performance approach, in 15th International Conference on Distributed Computing Systems ICDCS'95, 1995, pp. 467-474.
15. S. FORTUNE AND J. WYLLIE, Parallelism in random access machines, in 10th Annual ACM Symposium on Theory of Computing, 1978, pp. 114-118.
16. J. D. GAROFALAKIS, P. G. SPIRAKIS, B. TAMPAKAS, AND S. RAJSBAUM, Tentative and definite distributed computations: An optimistic approach to network synchronization, Theoretical Computer Science, 128 (1-2) (1994), pp. 63-74.
17. P. B. GIBBONS, A more practical PRAM model, in 2nd ACM Symposium on Parallel Algorithms and Architectures SPAA'89, 1989, pp. 158-168.
18. J. F. GROOTE, W. H. HESSELINK, S. MAUW, AND R. VERMEULEN, An algorithm for the asynchronous write-all problem based on process collision, Distributed Computing, 14 (2001), pp. 75-81.
19. M. HERLIHY, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, 13 (1991), pp. 124-149.
20. P. C. KANELLAKIS AND A. A. SHVARTSMAN, Efficient parallel algorithms can be made robust, Distributed Computing, 5 (1992), pp. 201-247.
21. P. C. KANELLAKIS AND A. A. SHVARTSMAN, Fault-Tolerant Parallel Computation, Kluwer Academic Publishers, Boston, MA, 1997.
22. R. M. KARP, M. LUBY, AND F. MEYER AUF DER HEIDE, Efficient PRAM simulation on a distributed memory machine, Algorithmica, 16 (1996), pp. 517-542.
23. Z. M. KEDEM, K. V. PALEM, M. O. RABIN, AND A. RAGHUNATHAN, Efficient program transformations for resilient parallel computation via randomization (preliminary version), in 24th Annual ACM Symposium on Theory of Computing STOC'92, 1992, pp. 306-317.
24. Z. M. KEDEM, K. V. PALEM, A. RAGHUNATHAN, AND P. G. SPIRAKIS, Combining tentative and definite executions for very fast dependable parallel computing (extended abstract), in 23rd Annual ACM Symposium on Theory of Computing STOC'91, 1991, pp. 381-390.
25. Z. M. KEDEM, K. V. PALEM, AND P. G. SPIRAKIS, Efficient robust parallel computations, in 22nd Annual ACM Symposium on Theory of Computing STOC'90, 1990, pp. 138-148.
26. D. R. KOWALSKI AND A. A. SHVARTSMAN, Writing-All deterministically and optimally using a non-trivial number of asynchronous processors, in 16th Annual ACM Symposium on Parallelism in Algorithms and Architectures SPAA'04, 2004, pp. 311-320.
27. D. E. KNUTH, The Art of Computer Programming, Vol. 3, 3rd ed., Addison-Wesley, Reading, MA, 1998.
28. C. P. KRUSKAL, L. RUDOLPH, AND M. SNIR, A complexity theory of efficient parallel algorithms, Theoret. Comput. Sci., 71 (1990), pp. 95-132.
29. L. LOVÁSZ, Combinatorial Problems and Exercises, 2nd ed., North-Holland, Amsterdam, 1993.
30. G. MALEWICZ, A work-optimal deterministic algorithm for the asynchronous Certified Write-All problem, in 22nd Annual ACM Symposium on Principles of Distributed Computing PODC'03, 2003, pp. 255-264.
31. G. MALEWICZ, A tight analysis and near-optimal instances of the algorithm of Anderson and Woll, Theoretical Computer Science, 329 (2004), pp. 285-301.
32. G. MALEWICZ, Distributed Scheduling for Disconnected Cooperation, doctoral dissertation, Computer Science, University of Connecticut, Storrs, CT, 2003.
33. C. MARTEL, A. PARK, AND R. SUBRAMONIAN, Work-optimal asynchronous algorithms for shared memory parallel computers, SIAM J. Comput., 21 (1992), pp. 1070-1099.
34. C. MARTEL, AND R. SUBRAMONIAN, How to Emulate Synchrony, Technical Report CSE-90-26, UC Davis, Davis, CA, 1990.
35. C. MARTEL AND R. SUBRAMONIAN, Asynchronous PRAM algorithms for list ranking and transitive closure, in International Conference on Parallel Processing ICPP'90, Vol. 3, 1990, pp. 60-63.
36. C. MARTEL AND R. SUBRAMONIAN, On the complexity of certified write-all algorithms, J. Algorithms, 16 (1994), pp. 361-387.
37. J. NAOR AND R. M. ROTH, Constructions of permutation arrays for certain scheduling cost measures, Random Structures Algorithms, 6 (1995), pp. 39-50.
38. R. H. B. NETZER AND B. P. MILLER, On the complexity of event ordering for shared-memory parallel program executions, in the International Conference on Parallel Processing ICPP'90, Vol. 2, 1990, pp. 93-97.
39. N. NlSHIMURA, Asynchronous shared memory parallel computation, SIAM J. Sci. Comput., 23 (1994), pp.1231-1252.
40. A. A. SHVARTSMAN, Achieving optimal CRCW PRAM fault-tolerance, Inform. Process. Lett., 39 (1991), pp. 59-66.
41. R. SUBRAMONIAN, Designing synchronous algorithms for asynchronous processors, in 4th Annual ACM Symposium on Parallel Algorithms and Architectures SPAA'92, 1992, pp. 189-198.
42. L. VALIANT, A bridging model for parallel computation, Communications of the ACM, 33 (1990), pp. 103-111.