Synchronous set agreement: A concise guided tour (including a new algorithm and a list of open problems)

Proceedings - 12th Pacific Rim International Symposium on Dependable Computing, PRDC 2006

Volumn , Issue , 2006, Pages 267-274

  Raynal, Michel ^a   Travers, Corentin ^a  

^a UNIVERSITÉ DE RENNES 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PARAMETER ESTIMATION;

SYNCHRONOUS SET AGREEMENT; SYNCHRONOUS SYSTEMS;

PROBLEM SOLVING;

EID: 40349089999     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PRDC.2006.59     Document Type: Conference Paper

References (25)

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, Simulation and Advanced Topics (Second edition). Wiley Series on Par. and Dist. Computing, 414 pages, 2004.
3. Attiya H. and Avidor Z., Wait-Free n-Set Consensus when Inputs are Restricted. Proc. 16th Int. Symposium on Distributed Computing (DISC'02), Springer Verlag LNCS #2508, pp. 326-338, 2002.
4. Chaudhuri S., More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation, 105:132-158, 1993.
5. Chaudhuri S., Herlihy M., Lynch N. and Tuttle M., Tight Bounds for k-Set Agreement. JACM, 47(5):912-943, 2000.
6. Dolev D., Reischuk R. and Strong R., Early Stopping in Byzantine Agreement. JACM, 37(4):720-741, April 1990.
7. Fischer M.J., Lynch N.A., A Lower Bound on the Time to Assure Interactive Consistency. Information Processing Letters, 14(4):183-186, 1982.
8. 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.
9. Gafni E., Guerraoui R. and Pochon B., From a Static Impossibility to an Adaptive Lower Bound: The Complexity of Early Deciding Set Agreement. 37th ACM Symposium on Theory of Computing (STOC'05), pp.714-722, May 2005.
10. Guerraoui R., Kouznetsov P. and Pochon B., A note on Set Agreement with Omission Failures. Electronic Notes in Theoretical Computer Science, Vol. 81, 2003.
11. 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.
12. Herlihy M.P. and Shavit N., The Topological Structure of Asynchronous Computability. Journal of the ACM, 46(6):858-923, 1999.
13. Keidar I. and Rajsbaum S., A Simple Proof of the Uniform Consensus Synchronous Lower Bound. Information Processing Letters, 85:47-52, 2003.
14. Lynch N.A., Distributed Algorithms. Morgan Kaufmann Pub., SanFransisco (CA), 872 pages, 1996.
15. Mostéfaoui A., Rajsbaum S. and and Raynal M., The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement. Proc. 24th ACM Symposium on Principles of Distributed Computing (PODC'05), ACM Press, pp. 179-188, 2005.
16. 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, 2000.
17. 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, 2001.
18. Neiger G. and Toueg S., Automatically Increasing the Fault-Tolerance of Distributed Algorithms. Journal of Algorithms, 11:374-419, 1990.
19. Perry K.J. and Toueg S., Distributed Agreement in the Presence of Processor and Communication Faults. IEEE Transactions on Software Engineering, SE-12(3):477-482, 1986.
20. 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, pp. 302-310, 2004.
21. 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), Springer Verlag LNCS #3606, pp. 49-58, 2005.
22. 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'l Symposium on Dependable Computing (PRDC'05), IEEE Computer Press, pp. 23-30, 2005.
23. Raïpin Parvédy Ph., Raynal M. and Travers C., Strongly Terminating Early-Stopping k-set Agreement in Synchronous Systems with General Omission Failures. Proc. 13th Colloquium on Structural Information and Communication Complexity (SIROCCO'06), Springer-Verlag LNCS #4056, pp. 182-196, 2006.
24. Raynal M., Consensus in Synchronous Systems: a Concise Guided Tour. Proc. 9th IEEE Pacific Rim Int'l Symposium on Dependable Computing (PRDC'02), Tsukuba (Japan), IEEE Computer Press, pp. 221-228, 2002.
25. Raynal M. and Travers C., Synchronous Set Agreement: a Concise Guided Tour (with open problems). Tech Report #1791, IRISA, Université de Rennes (France), 22 pages, 2006. (www.irisa.fr/bibli/publi/pi/2006/1791/1791. html)