Strongly terminating early-stopping k-set agreement in synchronous systems with general omission failures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4056 LNCS, Issue , 2006, Pages 182-196

  Parvédy, Philippe Raïpin ^a   Raynal, Michel ^a   Travers, Corentin ^a  

^a UNIVERSITÉ DE RENNES 1   (France)

Author keywords

Agreement problem; Crash failure; Early decision; Early stopping; Efficiency; k set agreement; Message passing system; Receive omission failure; Round based computation; Send omission failure; Strong Termination; Synchronous system

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; NETWORK PROTOCOLS; PROBLEM SOLVING;

AGREEMENT PROBLEM; CRASH FAILURE; EARLY STOPPING; K-SET AGREEMENT; MESSAGE-PASSING SYSTEM; RECEIVE OMISSION FAILURE; ROUND-BASED COMPUTATION; SEND OMISSION FAILURE; STRONG TERMINATION; SYNCHRONOUS SYSTEM;

COMPUTER SYSTEMS;

EID: 33746348975     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780823_15     Document Type: Conference Paper

References (32)

1. Aguilera M.K. and Toueg S., A Simple Bivalency Proof that t-Resilient Consensus Requires t + l Rounds. Information Processing Letters, 71:155-178, 1999.
2. Attiya H. and Welch J., Distributed Computing, Fundamentals, Simulation and Advanced Topics (Second edition). Wiley Series on Parallel and Distributed Computing, 414 pages, 2004.
3. Biran O., Moran S. and Zaks S., A Combinatorial Characterization of the Distributed 1-Solvable Tasks. Journal of Algorithms, 11(3): 420-440, 1990.
4. Biran O., Moran S. and Zaks S., Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks. Theoretical Computer Science, 145(1-2):271-290, 1995.
5. Borowsky E. and Gafni E., Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. Proc. 25th ACM Symposium on Theory of Computation (STOC'93), California (USA), pp. 91-100, 1993.
6. Charron-Bost B. and Schiper A., Uniform Consensus is Harder than Consensus. Journal of Algorithms, 51(1):15-37, 2004.
7. Chaudhuri S., More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation, 105:132-158, 1993.
8. Chaudhuri S., Herlihy M., Lynch N. and Tuttle M., Tight Bounds for k-Set Agreement. Journal of the ACM, 47(5):912-943, 2000.
9. Dolev D., Reischuk R. and Strong R., Early Stopping in Byzantine Agreement. Journal of the ACM, 37(4):720-741, April 1990.
10. Fischer M.J., Lynch N.A., A Lower Bound on the Time to Assure Interactive Consistency. Information Processing Letters, 14(4): 183-186, 1982.
11. Fischer M.J., Lynch N.A. and Paterson M.S., Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 32(2):374-382, 1985.
12. Gafni E., Guerraoui R. and Pochon B., >From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement. Proc. 37th ACM Symposium on Theory of Computing (STOC'05), Baltimore (MD), pp.714-722, May 2005.
13. Guerraoui R. and Pochon B., The Complexity of Early Deciding Set Agreement: how Topology Can Help? Proc. 4th Workshop in Geometry and Topology in Concurrency and Distributed Computing (GETCO'04), BRICS Notes Series, NS-04-2, pp. 26-31, Amsterdam (ML), 2004.
14. Hadzilacos V., Issues of Fault Tolerance in Concurrent Computations. PhD Thesis, Tech Report 11-84, Harvard University, Cambridge (MA), 1985.
15. Hadzilacos V. and Toueg S., Reliable Broadcast and Related Problems. In Distributed Systems, ACM Press (S. Mullender Ed.), New-York, pp. 97-145, 1993.
16. Herlihy M.P. and Penso L. D., Tight Bounds for k-Set Agreement with Limited Scope Accuracy Failure Detectors. Distributed Computing, 18(2): 157-166, 2005.
17. Herlihy M.P. and Shavit N., The Topological Structure of Asynchronous Computability. Journal of the ACM, 46(6):858-923, 1999.
18. Keidar I. and Rajsbaum S., A Simple Proof of the Uniform Consensus Synchronous Lower Bound. Information Processing Letters, 85:47-52, 2003.
19. Lamport L. and Fischer M., Byzantine Generals and Transaction Commit Protocols. Unpublished manuscript, 16 pages, April 1982.
20. Lynch N.A., Distributed Algorithms. Morgan Kaufmann Pub., San Fransisco (CA), 872 pages, 1996.
21. Mostéfaoui A. and Raynal M., k-Set Agreement with Limited Accuracy Failure Detectors. Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC'OO), ACM Press, pp. 143-152, Portland (OR), 2000.
22. Mostéfaoui A. and Raynal M., Randomized Set Agreement. Proc. 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA'01), ACM Press, pp. 291-297, Hersonissos (Crete), 2001.
23. Neiger G. and Toueg S., Automatically Increasing the Fault-Tolerance of Distributed Algorithms. Journal of Algorithms, 11:374-419, 1990.
24. Pease L., Shostak R. and Lamport L., Reaching Agreement in Presence of Faults. Journal of the ACM, 27(2):228-234, 1980.
25. Perry K.J. and Toueg S., Distributed Agreement in the Presence of Processor and Communication Faults. IEEE Transactions on Software Eng., SE-12(3):477-482, 1986.
26. Raïpin Parvédy Ph. and Raynal M., Optimal Early Stopping Uniform Consensus in Synchronous Systems with Process Omission Failures. Proc. 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA'04), Barcelona (Spain), ACM Press, pp. 302-310, 2004.
27. Raïpin Parvédy Ph., Raynal M. and Travers C., Early-Stopping k-set Agreement in Synchronous Systems Prone to any Number of Process Crashes. 8th Int. Conference on Parallel Computing Technologies (PaCT'05), Krasnoyarsk (Russia), Springer Verlag LNCS #3606, pp. 49-58, 2005.
28. Raïpin Parvédy Ph., Raynal M. and Travers C., Decision Optimal Early-Stopping k-set Agreement in Synchronous Systems Prone to Send Omission Failures. Proc. 11th IEEE Pacific Rim Int. Symposium on Dependable Computing (PRDC'05), Changsa (China), IEEE Computer Press, pp. 23-30, 2005.
29. Raïpin Parvédy Ph., Raynal M. and Travers C., Strongly Terminating Early-Stopping k-set Agreement in Synchronous Systems with General Omission Failures. Tech Report #1711, IRISA, Université de Rennes (France), 22 pages 2005. ftp://ftp.irisa.fr/techreports/2005/Pl-1711.ps.gz
30. Raynal M., Consensus in Synchronous Systems: a Concise Guided Tour. Proc. 9th IEEE Pacific Rim Int. Symposium on Dependable Computing (PRDC'02), Tsukuba (Japan), IEEE Computer Press, pp. 221-228, 2002.
31. Saks M. and Zaharoglou F., Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge. SIAM Journal on Computing, 29(5):1449-1483, 2000.
32. Yang J., Neiger G. and Gafni E., Structured Derivations of Consensus Algorithms for Failure Detectors. Proc. 17th Int. ACM Symposium on Principles of Distributed Computing (PODC'98), ACM Press, pp. 297-308, Puerto Vallarta (Mexico), July 1998.