Condition-based protocols for set agreement problems

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

Volumn 2508, Issue , 2002, Pages 48-62

  Mostefaoui A ^a   Rajsbaum, S ^b   Raynal, M ^a   Roy, M ^a  

^a CAMPUS DE BEAULIEU   (France)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE;

ASYNCHRONOUS SYSTEM; CONDITION-BASED APPROACH; INPUT VECTOR; K-SET AGREEMENT PROBLEMS; LINEAR COMPLEXITY; SET-AGREEMENT; WAIT FREE;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84947225880     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36108-1_4     Document Type: Conference Paper

References (27)

1. Attiya H. and Avidor Z., Wait-Free n-Consensus When Inputs are Restricted. Proc. 16th Symposium on Distributed Computing (DISC’02), These proceedings.
2. Attiya H. and Rachman O., Atomic Snapshots in O(n log n) Operations. SIAM Journal on Computing, 27(2):319-340, 1998.
3. Attiya H. and Rajsbaum S., The Combinatorial Structure of Wait-free Solvable Tasks. To appear in SIAM Journal on Computing, 2002.
4. Berman P. and Garay J., Adaptability and the Usefulness of Hints. 6th European Symposium on Algorithms, Springer-Verlag LNCS #1461, pp. 271-282, 1998.
5. Biran O., Moran S. and Zaks S., A Combinatorial Characterization of the Distributed 1-Solvable Tasks. Journal of Algorithms, 11:420-440, 1990.
6. Borowsky E. and Gafni E., Generalized FLP Impossibility Results for t-Resilient Asynchronous Computations. Proc. 25th ACM STOC, pp. 91-100, 1993.
7. Chandra T. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2):225-267, 1996.
8. Chaudhuri S., More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation, 105:132-158, 1993.
9. Dolev D., Dwork C. and Stockmeyer L., On the Minimal Synchronism Needed for Distributed Consensus. Journal of the ACM, 34(1):77–97, 1987.
10. Dwork C., Lynch N. and Stockmeyer L., Consensus in the Presence of Partial Synchrony. Journal of the ACM, 35(2):288–323, 1988.
11. Fischer M.J., Lynch N. and Paterson M.S., Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM, 32(2):374-382, 1985.
12. Gafni E. and Koutsoupias E., Three-Processor Tasks Are Undecidable. SIAM Journal of Computing, 28(3):970-983, 1999.
13. Herlihy M.P. and Rajsbaum S., On the Decidability of Distributed Decision Tasks. Proc. 29th ACM STOC, pp. 589-598, 1997.
14. Herlihy M. and Rajsbaum S., New Perspectives in Distributed Computing. Invited Talk, Proc. 24th Int. Symposium on Mathematical Foundations of Computer Science (MFCS’99), Springer-Verlag LNCS #1672, pp. 170-186, 1999.
15. Herlihy M. and Rajsbaum S., Algebraic Spans. Mathematical Structures in Computer Science, 10(4):549-573, 2000.
16. Herlihy M., Rajsbaum S. and Tuttle M., Synchronous Round Operators, 2000.
17. Herlihy M. and Shavit N., The Asynchronous Computability Theorem for t- Resilient Tasks. Proc. 25th ACM STOC, CA, pp. 111-120, 1993.
18. Herlihy M.P. and Wing J.M., Linearizability: a Correctness Condition for Concurrent Objects. ACM TOPLAS, 12(3):463-492, 1990.
19. Keidar I. and Rajsbaum S., On the Cost of Fault-Tolerant Consensus When There Are No Faults - A Tutorial, SIGACT News, DC Column, 32(2):45-63, 2001.
20. Mostéfaoui A., Rajsbaum S. and Raynal M., Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems. Proc. 33rd ACM STOC, pp. 153-162, 2001.
21. Mostéfaoui A., Rajsbaum S., Raynal M. and Roy M., A Hierarchy of Conditions for Consensus Solvability. Proc. PODC’01, pp. 151-160, 2001.
22. Mostéfaoui A., Rajsbaum S., Raynal M. and Roy M., Condition-Based Protocols for Set Agreement Problems. Research Report #1464, IRISA, University of Rennes, France, 2002. http://www.irisa.fr/bibli/publi/pi/2002/1464/1464.html.
23. Mostefaoui A. and Raynal M., k-Set Agreement with Limited Accuracy Failure Detectors. Proc. PODC’99, Portland (OR), pp. 143-152, 2000.
24. Mostefaoui A. and Raynal M., Randomized k-Set Agreement. Proc. 13th th ACM Symp. on Parallel Algorithms and Architectures (SPAA’01), pp. 291-297, 2001.
25. Taubenfeld G., Katz S. and Moran S., Impossibility Results in the Presence of Multiple Faulty Processes. Information and Computation, 113(2):173-198, 1994.
26. Taubenfeld G. and Moran S., Possibility and Impossibility Results in a Shared Memory Environment. Acta Informatica, 35:1-20, 1996.
27. Saks M. and Zaharoglou F.,Wait-Free k-Set Agreement is Impossible: the Topology of Public Knowledge. Proc. 25th ACM STOC, pp. 101-110, 1993.