A tight analysis and near-optimal instances of the algorithm of Anderson and Woll

Theoretical Computer Science

Volumn 329, Issue 1-3, 2004, Pages 285-301

  Malewicz, Grzegorz ^a  

^a University of Alabama   (United States)

Author keywords

Analysis of shared memory algorithms; Certified write All; PRAM simulations

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; PARALLEL PROCESSING SYSTEMS; SYNCHRONIZATION;

ANALYSIS OF SHARED-MEMORY ALGORITHM; CERTIFIED WRITE-ALL; PRAM SIMULATIONS;

ALGORITHMS;

EID: 10044281925     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.10.015     Document Type: Article

References (42)

1. R. J. Anderson, H. Woll, Algorithms for the certified write-all problem, SIAM J. Comput. 26 (5) (1997) 1277 -1283.
2. J. Aspnes, M. Herlihy, Wait-free data structures in the asynchronous PRAM model, in: 2nd Symp. on Parallel Algorithms and Architectures SPAA'90, 1990, pp. 340-349.
3. Y. Aumann, M.A. Bender, L. Zhang, Efficient execution of nondeterministic parallel programs on asynchronous systems, Inform, and Comput. 139 (1) (1997) 1-16.
4. Y. Aumann, Z.M. Kedem, K.V. Palem, M.O. Rabin, Highly efficient asynchronous execution of large-grained parallel programs, in: 34th IEEE Symp. on Foundations of Computer Science FOCS'93, 1993, pp. 271-280.
5. Y. Aumann, M.O. Rabin, Clock construction in fully asynchronous parallel systems and PRAM simulation, Theoret. Comput. Sci. 128 (1994) 3-30.
6. A. Baratloo, P. Dasgupta, Z.M. Kedem, CALYPSO: a novel software system for fault-tolerant parallel processing on distributed platforms, in: 4th Internat. Symp. on High Performance Distributed Computing HPDC'95, 1995, pp. 122-129.
7. A.J. Bernstein, Program analysis for parallel processing, IEEE Trans. Electronic Comput. EC-15 (5) (1966) 757-762.
8. J. Buss, P.C. Kanellakis, P.L. Ragde, A.A. Shvartsman, Parallel algorithms with processor failures and delays, J. Algorithms 20 (1996) 45-86.
9. B. Chlebus, S. Dobrev, D. Kowalski, G. Malewicz, A. Shvartsman, I. Vrto, Towards practical deterministic write-all algorithms, in: 13th Symp. on Parallel Algorithms and Architectures SPAA'01, 2001, pp. 271-280.
10. B.S. Chlebus, A. Gambin, P. Indyk, PRAM computations resilient to memory faults, in: 2nd European Symp. on Algorithms ESA'94, 1994, pp. 401-412.
11. R. Cole, O. Zajicek, The APRAM: incorporating asynchrony into the PRAM model, in: 2nd ACM Symp. on Parallel Algorithms and Architectures SPAA'89, 1989, pp. 169-178.
12. R. Cole, O. Zajicek, The expected advantage of asynchrony, in: 3rd ACM Symp. 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, 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, M.O. Rabin, Parallel processing on networks of workstations: a fault-tolerant, high performance approach, in: 15th Internat. Conf. on Distributed Computing Systems ICDCS'95, 1995, pp. 467-474.
15. S. Fortune, J. Wyllie, Parallelism in random access machines, in: 10th ACM Symp. on Theory of Computing, 1978, pp. 114-118.
16. J.D. Garofalakis, P.G. Spirakis, B. Tampakas, S. Rajsbaum, Tentative and definite distributed computations: an optimistic approach to network synchronization, Theoret. Comput. Sci. 128 (1&2) (1994) 63-74.
17. P.B, Gibbons, A more practical PRAM model, in: 2nd ACM Symp. on Parallel Algorithms and Architectures SPAA'89, 1989, pp. 158-168.
18. J.F. Groote, W.H. Hesselink, S. Mauw, R. Vermeulen, An algorithm for the asynchronous write-all problem based on process collision, Distributed Comput. 14 (2) (2001) 75-81.
19. P.C. Kanellakis, A.A. Shvartsman, Efficient parallel algorithms can be made robust, Distributed Comput. 5 (4) (1992) 201-217.
20. P.C. Kanellakis, A.A. Shvartsman, Fault-Tolerant Parallel Computation, Kluwer Academic Publishers, Dordrecht, 1997.
21. R.M. Karp, M. Luby, F. Meyer auf der Heide, Efficient PRAM simulation on a distributed memory machine, Algorithmica 16 (1996) 517-542.
22. Z.M. Kedem, K.V. Palem, M.O. Rabin, A. Raghunathan, Efficient program transformations for resilient parallel computation via randomization (preliminary version), in: 24th ACM Syrnp. on Theory of Computing STOC'92, 1992, pp. 306-317.
23. Z.M. Kedem, K.V. Palem, A. Raghunathan, P.G. Spirakis, Combining tentative and definite executions for very fast dependable parallel computing (extended abstract), in: 23rd ACM Symp. on Theory of Computing STOC'91, 1991, pp. 381-390.
24. Z.M. Kedem, K.V. Palem, P.G. Spirakis, Efficient robust parallel computations, in: 22nd ACM Symp. on Theory of Computing STOC'90, 1990, pp. 138-148.
25. D.E. Knuth, The Art of Computer Programming, Vol. 3, third ed., Addison-Wesley, Reading, MA, 1998.
26. D.R. Kowalski, A.A. Shvartsman, Performing work with asynchronous processors: message-delay-sensitive bounds, in: 22nd ACM Symp. on Principles of Distributed Computing PODC'03, 2003, pp. 265-274.
27. D.R. Kowalski, A.A. Shvartsman, Writing-all deterministically and optimally using a non-trivial number of asynchronous processors, 16th ACM Symp. on Parallelism in Algorithms and Architectures SPAA'04, 2004, to appear.
28. C.P. Kruskal, L. Rudolph, M. Snir, A complexity theory of efficient parallel algorithms, Theoret. Comput Sci. 71(1) (1990) 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 certified write-all problem with a nontrivial number of asynchronous processors, SIAM J. Comput., to appear.
31. G. Malewicz, Distributed scheduling for disconnected cooperation, Doctoral Dissertation, University of Connecticut, 2003.
32. C. Martel, A. Park, R. Subramonian, Work-optimal asynchronous algorithms for shared memory parallel computers, SIAM J. Comput. 21 (6) (1992) 1070-1099.
33. C. Martel, R. Subramonian, How to emulate synchrony, Technical Report CSE-90-26, UC Davis, 1990.
34. C. Martel, R. Subramonian, Asynchronous PRAM algorithms for list ranking and transitive closure, Internat. Conf. on Parallel Processing ICPP'90, Vol. 3, 1990, pp. 60-63.
35. C. Martel, R. Subramonian, On the complexity of certified write-all algorithms, J. Algorithms 16 (3) (1994) 361-387.
36. J. Naor, R.M. Roth, Constructions of permutation arrays for certain scheduling cost measures, Random Struct. Algorithms 6 (1) (1995) 39-50.
37. R.H.B. Netzer, B.P. Miller, On the complexity of event ordering for shared-memory parallel program executions, Internat. Conf. on Parallel Processing ICPP'90, Vol. 2, 1990, pp. 93-97.
38. N. Nishimura, Asynchronous shared memory parallel computation, in: 3rd ACM Symp. on Parallel Algorithms and Architectures SPAA'90, 1990, pp. 76-84.
39. M.E. Saks, N. Shavit, H. Woll, Optimal time randomized consensus-making resilient algorithms fast in practice, in: 2nd ACM-SIAM Annu. Symp. on Discrete Algorithms SODA'91, 1991, pp. 351-362.
40. A.A. Shvartsman, Achieving optimal CRCW PRAM fault-tolerance, Inform. Process. Lett. 39 (2) (1991) 59 -66.
41. R. Subramonian, Designing synchronous algorithms for asynchronous processors, in: 4th ACM Symp. on Parallel Algorithms and Architectures SPAA'92, 1992, pp. 189-198.
42. L. Valiant, A bridging model for parallel computation, Comm. ACM 33 (8) (1990) 103-111.