Writing-all deterministically and optimally using a non-trivial number of asynchronous processors

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 311-320

  Kowalski, Dariusz R ^a,b   Shvartsman, Alexander A ^c,d  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF WARSAW   (Poland)

^c University of Connecticut   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Asynchrony; Distributed algorithms; Shared memory; Work; Write All

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; MICROPROCESSOR CHIPS; MULTI AGENT SYSTEMS; PROBLEM SOLVING;

ASYNCHRONOUS PROCESSORS; NON-TRIVIAL NUMBERS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 8344232246     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007964     Document Type: Conference Paper

References (27)

1. Ajtai, M., Aspnes, J., Dwork, C., Waarts, O.: A theory of competitive analysis of distributed algorithms. Proc. of the 35th IEEE Symp. of Found. of Computer Science, FOCS'1994, 401-411
2. Alon, N., Spencer, J.: The probabilistic method. John Wiley, Second Edition (2000)
3. Anderson, R.J., Woll, H.: Algorithms for the certified Write-All problem. SIAM Journal on Computing 26 (5) (1997) 1277-1283
4. Aumann, Y., Rabin, M.O.: Clock construction in fully asynchronous parallel systems and PRAM simulation. Proc. of the 33rd IEEE Symp. on Foundations of Computer Science, FOCS'1992, 147-156
5. Aumann, Y., Kedem, Z.M., Palem, K.V., Rabin, M.O.: Highly efficient asynchronous execution of large-grained parallel programs. Proc. of the 34th IEEE Symp. on Foundations of Computer Science, FOCS'1993, 271-280
6. Buss, J., Kanellakis, P.C., Ragde, P.L., Shvartsman, A.A.: Parallel algorithms with processor failures and delays. J. of Algorithms 20 (1996) 45-86
7. Chlebus, B., Dobrev, S., Kowalski, D., Malewicz, G., Shvartsman, A., Vrto, I.: Towards practical deterministic Write-All algorithms. Proc. of the 13th ACM Symposium on Parallel Algorithms and Architectures, SPAA'2001, 271-280
8. R. Cole and O. Zajicek: The expected advantage of asynchrony. Proc. of the 2nd ACM Symp. on Parallel Algorithms and Architectures, SPAA'1990, 85-94
9. Dasgupta, P., Kedem, Z., Rabin, M.: Parallel processing on networks of workstation: A fault-tolerant, high performance approach. Proc. of the 15th International Conference on Distributed Computing Systems, ICDCS'1995, 467-474
10. De Prisco, R., Mayer, A., Yung, M.: Time-optimal message-efficient work performance in the presence of faults. Proc. of the 13th ACM Symp. on Principles of Distributed Computing, PODC'1994, 161-172
11. Dwork, C., Halpern, J., Waarts, O.: Performing work efficiently in the presence of faults. SIAM J. on Computing 27 (1998) 1457-1491
12. Galil, Z., Mayer, A., Yung, M.: Resolving message complexity of byzantine agreement and beyond. Proc. of the 36th IEEE Symp. on Foundations of Computer Science, FOCS'1995, 724-733
13. Gibbons, P.: A more practical PRAM model. Proc. of the 1st ACM Symposium on Parallel Algorithms and Architectures, SPAA'1989, 158-168
14. Groote, J.F., Hesselink, W.H., Mauw, S., Vermeulen, R.: An algorithm for the asynchronous write-all problem based on process collision. Distributed Computing (2001) 14:75-81
15. Kanellakis, P.C., Shvartsman, A.A.: Efficient parallel algorithms can be made robust. Distributed Computing 5 (1992) 201-217
16. Kanellakis, P.C., Shvartsman, A.A.: Fault-tolerant parallel computation. Kluwer Academic Publishers (1997)
17. Kedem, Z.M., Palem, K.V., Rabin, M.O., Raghunathan, A.: Efficient program transformations for resilient parallel computation via randomization. Proc. of the 24th ACM Symp. on Theory of Computing, STOC'1992, 306-318
18. Kedem, Z.M., Palem, K.V., Raghunathan, A., Spirakis, P.: Combining tentative and definite executions for dependable parallel computing. Proc. of the 23rd ACM Symposium on Theory of Computing, STOC'1991, 381-390
19. Kedem, Z.M., Palem, K.V., Spirakis, P.: Efficient robust parallel computations. Proc. of the 22nd ACM Symp. on Theory of Computing, STOC'1990, 138-148
20. Knuth, D.E.: The art of computer programming Vol. 3 (third edition). Addison-Wesley Pub Co. (1998)
21. Malewicz, G.: A work-optimal deterministic algorithm for the asynchronous Certified Write-All problem. Proc. of the 22nd ACM Symposium on Principles of Distributed Computing, PODC'2003, 255-264
22. Martel, C., Park, A., Subramonian, R.: Work-optimal asynchronous algorithms for shared memory parallel computers. SIAM J. on Comp. 21 (1992) 1070-1099
23. Martel, C., Subramonian, R.: On the complexity of Certified Write-All algorithms. J. Algorithms 16 (3) (1994) 361-387
24. Martel, C., Subramonian, R., Park, A.: Asynchronous PRAMs are (almost) as good as synchronous PRAMs. Proc. of the 32d IEEE Symp. on Foundations of Computer Science, FOCS'1990, 590-599
25. Naor, J., Roth, R.M.: Constructions of permutation arrays for certain scheduling cost measures. Random Structures and Algorithms 6 (1) (1995) 39-50
26. Nishimura, N.: A model for asynchronous shared memory parallel computation, SIAM Journal on Computing 23 (6) (1994) 1231-1252
27. Shvartsman, A.A.: Achieving optimal CRCW PRAM fault-tolerance. Information Processing Letters, 39 (2) (1991) 59-66