The complexity of synchronous iterative Do-All with crashes

Distributed Computing

Volumn 17, Issue 1, 2004, Pages 47-63

  Georgiou, Chryssis ^a   Russell, Alexander ^a   Shvartsman, Alex A ^a,b  

^a University of Connecticut   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Distributed algorithms; Fault tolerance; Lower bounds; Work complexity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; FAULT TOLERANT COMPUTER SYSTEMS; ITERATIVE METHODS; SYNCHRONIZATION;

DISTRIBUTED ALGORITHMS; LOWER BOUNDS; WORK COMPLEXITY;

COMPUTER SCIENCE;

EID: 1642377534     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-003-0099-3     Document Type: Article

References (32)

1. R.J. Anderson, H. Woll. Algorithms for the certified Write-All problem. SIAM Journal of Computing 26(5), 1277-1283 (1997)
2. rd IEEE Symposium on Foundations of Computer Science (FOCS 1992), pp. 147-156, 1992
3. J. Buss, P.C. Kanellakis, P. Ragde, A.A. Shvartsman. Parallel algorithms with processor failures and delays. Journal of Algorithms 20(1), 45-86 (1996)
4. B. Chlebus, R. De Prisco, A.A. Shvartsman. Performing tasks on restartable message-passing processors. Distributed Computing 14(1), 49-64 (2001)
5. th International Symposium on Algorithms and Computation (ISAAC 2002), pp. 320-331, 2002
6. th IEEE International Conference on Distributed Computer Systems (ICDCS 1995), pp. 467-474, 1995
7. th ACM Symposium on Principles of Distributed Computing (PODC 1994), pp. 161-172, 1994
8. th International Colloquium on Structural Information and Communication Complexity (SIROCCO 1999), pp. 111-125, 1999)
9. th International Colloquium on Structural Information and Communication Complexity (SIROCCO 1999), pp. 111-125, 1999)
10. th ACM Symposium on Principles of Distributed Computing (PODC 1992), pp. 91-102, 1992
11. th ACM Symposium on Principles of Distributed Computing (PODC 1992), pp. 91-102, 1992
12. th ACM Symposium on Theory of Computing (STOC 1978), pp. 114-118, 1978
13. th IEEE Symposium on Foundations of Computer Science (FOCS 1995), pp. 724-733, 1995
14. th International Conference on Principles of Distributed Systems (OPODIS 2000), pp. 245-264, 2000
15. Ch. Georgiou, A. Russell, A.A. Shvartsman. The complexity of synchronous iterative Do-All with crashes. In Distributed algorithms (DISC 2001), volume 2180 of Lecture Notes in Computer Science, pp. 151-165, 2001
16. th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2000), pp. 141-156, 2000)
17. th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2000), pp. 141-156, 2000)
18. J.F. Groote, W.H. Hesselink, S. Mauw, R. Vermeulen. An algorithm for the asynchronous Write-All problem based on process collision. Distributed Computing 14(2), 75-81 (2001)
19. V. Hadzilacos, S. Toueg. Fault-tolerant broadcasts and related problems. In Distributed Systems, chapter 5, pp. 97-145. ACM Press/Addison-Wesley, 1993
20. P.C. Kanellakis, A.A. Shvartsman. Fault-Tolerant Parallel Computation. Kluwer Academic Publishers, 1997
21. th ACM Symposium on Principles of Distributed Computing (PODC 1989), pp. 211-222, 1989
22. th ACM Symposium on Principles of Distributed Computing (PODC 1989), pp. 211-222, 1989
23. th ACM Symposium on Theory of Computing (STOC 1992), pp. 306-318, 1992
24. rd ACM Symposium on Theory of Computing (STOC 1991), pp. 381-390, 1991
25. nd ACM Symposium on Theory of Computing (STOC 1990), pp. 138-148, 1990
26. E. Korpela, D. Werthimer, D. Anderson, J. Cobb, M. Lebofsky.SETI@home: Massively distributed computing for SETI. Computing in Science and Engineering 3(1), 78-83 (2001)
27. G. Malewicz, A. Russell, A.A. Shvartsman. Distributed cooperation during the absence of communication. In Distributed algorithms (DISC 2000), volume 1914 of Lecture Notes in Computer Science, pp. 119-133, 2000
28. C. Martel, A. Park, R. Subramonian. Work-optimal asynchronous algorithms for shared memory parallel computers. SIAM Journal on Computing 21(6), 1070-1099 (1992)
29. C. Martel, R. Subramonian. On the complexity of certified Write-All algorithms. Journal of Algorithms 16(3), 361-387 (1994)
30. st IEEE Symposium on Foundations of Computer Science (FOCS 1990), pp. 590-599, 1990
31. R.D. Schlichting, F.B. Schneider. Fail-stop processors: An approach to designing fault-tolerant computing systems. ACM Transactions on Computing Systems 1(3), 222-238 (1983)
32. A.A. Shvartsman. Achieving optimal CRCW PRAM fault-tolerance. Information Processing Letters 39(2), 59-66 (1991)