The Do-All problem with Byzantine processor failures

Theoretical Computer Science

Volumn 333, Issue 3, 2005, Pages 433-454

  Fernández, Antonio ^a   Georgiou, Chryssis ^b   Russell, Alexander ^c   Shvartsman, Alex A ^c,d  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSITY OF CYPRUS   (Cyprus)

^c University of Connecticut   (United States)

^d MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Byzantine failures; Distributed cooperation; Independent tasks; Work complexity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; THEOREM PROVING;

BYZANTINE FAILURES; DISTRIBUTED COOPERATION; INDEPENDENT TASKS; WORK COMPLEXITY;

COMPUTER SYSTEM RECOVERY;

EID: 13844297012     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.06.034     Document Type: Conference Paper

References (28)

1. C. Aguirre, J. Martinez-Munoz, F. Corbacho, and R. Huerta Small-world topology for multi-agent collaboration Proc. 11th Internat. Workshop on Database and Expert Systems Appl. 2000 231 235
2. R.J. Anderson, and H. Woll Algorithms for the certified Write-All problem SIAM J. Comput. 26 5 1997 1277 1283
3. J. Buss, P.C. Kanellakis, P. Ragde, and A.A. Shvartsman Parallel algorithms with processor failures and delays J. Algorithms 20 1 1996 45 86
4. B. Chlebus, R. De Prisco, and A.A. Shvartsman Performing tasks on restartable message-passing processors Distributed Computing 14 1 2001 49 64
5. B. Chlebus, S. Dobrev, D. Kowalski, G. Malewicz, A.A. Shvartsman, and I. Vrto Towards practical deterministic Write-All algorithms Proc. 13th ACM Symp. on Parallel Algorithms and Architectures (SPAA 2001) 2001 271 280
6. B.S. Chlebus, L. Gasieniec, D.R. Kowalski, and A.A. Shvartsman Bounding work and communication in robust cooperative computation Proc. 16th Internat. Symp. Distributed Computing (DISC 2002) 2002 295 310
7. P. Dasgupta, Z. Kedem, and M. Rabin Parallel processing on networks of workstation a fault-tolerant high performance approach Proc. 15th IEEE Internat. Conf. Distributed Computer Systems (ICDCS 1995) 1995 467 474
8. R. De Prisco, A. Mayer, and M. Yung Time-optimal message-efficient work performance in the presence of faults Proc. 13th ACM Symp. Principles of Distributed Computing (PODC 1994) 1994 161 172
9. S. Dolev, R. Segala, A.A. Shvartsman, Dynamic load balancing with group communication, Theoretical Computer Science, to appear. A preliminary version appears in the Proc. Sixth Internat. Colloquium on Structural Information and Communication Complexity (SIROCCO 1999), 1999, pp. 111-125.
10. C. Dwork, J. Halpern, O. Waarts, Performing work efficiently in the presence of faults, SIAM J. Computing 27(5) (1998) 1457-1491. A preliminary version appears in the Proc. 11th ACM Symp. Principles of Distributed Computing (PODC 1992), 1992, pp. 91-102.
11. C. Dwork, J. Halpern, O. Waarts, Performing work efficiently in the presence of faults, SIAM J. Computing 27(5) (1998) 1457-1491. A preliminary version appears in the Proc. 11th ACM Symp. Principles of Distributed Computing (PODC 1992), 1992, pp. 91-102.
12. A. Fernández, and Ch. Georgiou The Do-All problem with Byzantine processor failures Proc. 10th Internat. Colloquium on Structural Information and Communication Complexity (SIROCCO 2003) 2003 117 132
13. Z. Galil, A. Mayer, and M. Yung Resolving message complexity of byzantine agreement and beyond Proc. 36th IEEE Symp. Foundations of Computer Science (FOCS 1995) 1995 724 733
14. Ch. Georgiou, A. Russell, and A.A. Shvartsman Work-competitive scheduling for cooperative computing with dynamic groups Proc. 35th ACM Symp. Theory of Computing (STOC 2003) 2003 251 258
15. Ch. Georgiou, A. Russell, and A.A. Shvartsman The complexity of synchronous iterative Do-All with crashes Distributed Computing 17 1 2004 47 63
16. Ch. Georgiou, and A.A. Shvartsman Cooperative computing with fragmentable and mergeable groups J. Discrete Algorithms 1 2 2003 211 235
17. 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 2 2001 75 81
18. P.C. Kanellakis, A.A. Shvartsman, Efficient parallel algorithms can be made robust, Distributed Computing 5(4) (1992) 201-217. A preliminary version appears in the Proc. Eighth ACM Symp. on Principles of Distributed Computing (PODC 1989), 1989, pp. 211-222.
19. P.C. Kanellakis, A.A. Shvartsman, Efficient parallel algorithms can be made robust, Distributed Computing 5(4) (1992) 201-217. A preliminary version appears in the Proc. Eighth ACM Symp. on Principles of Distributed Computing (PODC 1989), 1989, pp. 211-222.
20. P.C. Kanellakis, and A.A. Shvartsman Fault-Tolerant Parallel Computation 1997 Kluwer Academic Publishers
21. Z.M. Kedem, K.V. Palem, A. Raghunathan, and P. Spirakis Combining tentative and definite executions for dependable parallel computing Proc. 23rd ACM Symp. on Theory of Computing (STOC 1991) 1991 381 390
22. E. Korpela, D. Werthimer, D. Anderson, J. Cobb, and M. Lebofsky SETI@home Massively distributed computing for SETI Comput. Sci. Engng. 3 1 2001 78 83
23. L. Lamport, R. Shostak, and M. Pease The Byzantine generals problem ACM Trans. Programming Languages and Systems 4 3 1982 382 401
24. G. Malewicz, A. Russell, and A.A. Shvartsman Distributed cooperation during the absence of communication Proc. 14th Internat. Symp. Distributed Computing (DISC 2000) 2000 119 133
25. C. Martel, A. Park, and R. Subramonian Work-optimal asynchronous algorithms for shared memory parallel computers SIAM J. Comput. 21 6 1992 1070 1099
26. C. Martel, and R. Subramonian On the complexity of certified Write-All algorithms J. Algorithms 16 3 1994 361 387
27. R.D. Schlichting, and F.B. Schneider Fail-stop processors an approach to designing fault-tolerant computing systems ACM Trans. Comput. Systems 1 3 1983 222 238
28. M. Tambe, J. Adibi, Y. Alonaizon, A. Erdem, G.A. Kaminka, S. Marsella, and I. Muslea Building agent teams using an explicit teamwork model and learning Artificial Intelligence 110 2 1999 215 239