Early-stopping k-set agreement in synchronous systems prone to any number of process crashes

Lecture Notes in Computer Science

Volumn 3606, Issue , 2005, Pages 49-58

  Parvedy, Philippe Raipin ^a   Raynal, Michel ^a   Travers, Corentin ^a  

^a CAMPUS DE BEAULIEU   (France)

Author keywords

Crash failure; Efficiency; K set agreement; Message passing system; Round based computation; Synchronous system; Uniform consensus

Indexed keywords

CONSTRAINT THEORY; PROBLEM SOLVING;

K-SET AGREEMENT PROBLEMS; NON-FAULTY PROCESSES; SYNCHRONOUS SYSTEMS;

SYNCHRONOUS MACHINERY;

EID: 26844541210     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11535294_5     Document Type: Conference Paper

References (19)

1. Aguilera M.K. and Toueg S., A Simple Bivalency Proof that t-Resilient Consensus Requires t + 1 Rounds. Information Processing Letters, 71:155-178, 1999.
2. Attiya H. and Welch J., Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill, 451 pages, 1998.
3. Borowsky E. and Gafni E., Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. Proc. 25th ACM Symposium on Theory of Computation, California (USA), pp. 91-100, 1993.
4. Charron-Bost B. and Schiper A., Uniform Consensus is Harder than Consensus. Journal of Algorithms, 51(1): 15-37, 2004.
5. Chaudhuri S., More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation, 105:132-158, 1993.
6. Chaudhuri S., Herlihy M., Lynch N. and Tuttle M., Tight Bounds for k-Set Agreement. Journal of the ACM, 47(5):912-943, 2000.
7. Dolev D., Reischuk R. and Strong R., Early Stopping in Byzantine Agreement. Journal of the ACM, 37(4):720-741, April 1990.
8. Fischer M.J., Lynch N.A., A Lower Bound on the Time to Assure Interactive Consistency. Information Processing Letters, 14(4): 183-186, 1982.
9. 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.
10. 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 2005), Baltimore (MD), May 2005.
11. 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 (NL), 2004.
12. Herlihy M.P. and Penso L. D., Tight Bounds for k-Set Agreement with Limited Scope Accuracy Failure Detectors. Proc. 17th Int. Symposium on Distributed Computing (DISC'03), Springer Verlag LNCS #2848, pp. 279-291, Sorrento (Italy), 2003.
13. Herlihy M.P. and Shavit N., The Topological Structure of Asynchronous Computability. Journal of the ACM, 46(6):858-923, 1999.
14. Lamport L. and Fischer M., Byzantine Generals and Transaction Commit Protocols. Unpublished manuscript, 16 pages, April 1982.
15. Lynch N.A., Distributed Algorithms. Morgan Kaufmann Pub., San Fransisco (CA), 872 pages, 1996.
16. Mostefaoui A. and Raynal M., k-Set Agreement with Limited Accuracy Failure Detectors. Proc. 19th ACM Symposium on Principles of Distributed Computing, ACM Press, pp. 143-152, Portland (OR), 2000.
17. Mostefaoui 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.
18. 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.
19. 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.