Simultaneous consensus tasks: A tighter characterization of set-consensus

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

Volumn 4308 LNCS, Issue , 2006, Pages 331-341

  Afek, Yehuda ^a   Gafni, Eli ^b   Rajsbaum, Sergio ^c   Raynal, Michel ^d   Travers, Corentin ^d  

^a TEL AVIV UNIVERSITY   (Israel)

^b Department of Civil and Environmental Engineering   (United States)

^c UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

^d CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

INPUT VECTOR; SET CONSENSUS; SUBTASK; SUBTASKS; WAIT-FREE ALGORITHMS;

ALGORITHMS;

VECTORS;

EID: 84885192779     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11947950_36     Document Type: Conference Paper

References (16)

1. Afek Y., H. Attiya, Dolev D., Gafni E., Merrit M. and Shavit N., Atomic Snapshots of Shared Memory. Proc. 9th ACM Symposium on Principles of Distributed Computing (PODC'90), ACM Press, pp. 1-13, 1990.
2. Borowsky E. and Gafni E., Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations Proc. 25th ACM Symposium on the Theory of Computing (STOC'93), ACM Press, pp. 91-100, 1993.
3. Borowsky E. and Gafni E., Immediate Atomic Snapshots and Fast Renaming (Extended Abstract). Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC'93), ACM Press, pp. 41-51, 1993.
4. Borowsky E., Gafni E., Lynch N. and Rajsbaum S., The BG Distributed Simulation Algorithm. Distributed Computing, 14(3):127-146, 2001.
5. Chaudhuri S., More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation, 105:132-158, 1993.
6. 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.
7. Gafni E., Group-Solvability. Proc. 18th Int. Symposium on Distributed Computing (DISC'04), Springer Verlag LNCS #3274, pp. 30-40, 2004.
8. Gafni E. and Kouznetsov P., Two Front Agreement with Application to Emulation and Robustness. to appear.
9. Gafni E., Merritt M. and Taubenfeld G., The Concurrency Hierarchy, and Algorithms for Unbounded Concurrency. Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC'01), ACM Press, pp. 161-169, 2001.
10. Gafni E. and Rajsbaum S., Musical Benches. Proc. 19th Int. Symposium on Distributed Computing (DISC'05), Springer Verlag LNCS # 3724, pp. 63-77, September 2005.
11. Gafni E. and Rajsbaum S., Raynal M., Travers C., The Committee Decision Problem. Proc. Theoretical Informatics, 7th Latin American Symposium (LATIN'06), Springer Verlag LNCS #3887, pp. 502-514, 2006.
12. Herlihy M.P., Wait-Free Synchronization. ACM Transactions on programming Languages and Systems, 11(1):124-149, 1991.
13. Herlihy M.P. and Shavit N., The Topological Structure of Asynchronous Computability. Journal of the ACM, 46(6):858-923, 1999.
14. Mostefaoui A., Raynal M. and Tronel F., From Binary Consensus to Multivalued Consensus in Asynchronous Message-Passing Systems. Information Processing Letters, 73:207-213, 2000.
15. Merrit M., Taubenfeld G., Computing with infinitely many processes. Proc. 14th Int. Symposium on Distributed Computing (DISC'00), Springer Verlag LNCS #1914, pp. 164-178, October 2000.
16. 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.