Condition-based consensus solvability: A hierarchy of conditions and efficient protocols

Distributed Computing

Volumn 17, Issue 1, 2004, Pages 1-20

  Mostéfaoui, Achour ^a   Rajsbaum, Sergio ^b   Raynal, Michel ^a   Roy, Matthieu ^a  

^a CAMPUS DE BEAULIEU   (France)

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

Author keywords

Asynchronous system; Collect; Condition Consensus; Fault tolerance; Input vector; Snapshot Shared memory; Step complexity

Indexed keywords

ASYNCHRONOUS SYSTEM; COLLECT; CONSENSUS; INPUT VECTOR; SHARED MEMORY; SNAPSHOT; STEP COMPLEXITY;

COMPUTATIONAL COMPLEXITY; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; VECTORS;

COMPUTATION THEORY;

EID: 12144287021     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-003-0093-9     Document Type: Article

References (28)

1. Afek Y., Attiya H., Dolev D., Gafni E., Merritt M., Shavit N., Atomic Snapshots of Shared Memory. Journal of the ACM 40(4), 873-890 (1993)
2. Aguilera M.K., Toueg S., Failure Detection and Randomization: a Hybrid Approach to Solve Consensus. SIAM Journal of Computing 28(3), 890-903 (1998)
3. Attiya H., Herlihy M.P., Rachman O., Atomic Snapshots Using Lattice Agreement, Distributed Computing 8(3), 121-132 (1995)
4. Attiya H., Rachman O., Atomic Snapshots in O(n log n) Operations. SIAM Journal of Computing 27(2), 319-340 (1998)
5. Attiya H., Welch J., Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill, 451 pages (1998)
6. Ben-Or M., Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols. Proc. 2nd ACM Symposium on Principles of Distributed Computing (PODC'83), ACM Press, pp. 27-30, Montréal, Canada (1983)
7. Berman P., Garay J., Adaptability and the Usefulness of Hints. 6th European Symposium on Algorithms (ESA'98), Springer, LNCS #1461, pp. 271-282, Venice, Italy (1998)
8. Borowsky E., Gafni E., Lynch N.A., Rajsbaum S., The BG Distributed Simulation Algorithm. Distributed Computing 14(3), 127-146 (2001)
9. Biran O., Moran S., Zaks S., A Combinatorial Characterization of the Distributed 1-Solvable Tasks. Journal of Algorithms 11, 420-440 (1990)
10. Biran O., Moran S., Zaks S., Deciding 1-Solvability of Distributed Tasks is NP-Hard. Proc. 16th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'90), Springer, LNCS #484, pp. 206-220 (1990)
11. Chandra T., Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. Journal of ACM 43(2), 225-267 (1996)
12. Chaudhuri S., More Choices Allow More Faults: Set consensus Problems in Totally Asynchronous Systems. Information and Computation 105, 132-158 (1993)
13. Dwork C., Lynch N.A., Stockmeyer L., Consensus in the Presence of Partial Synchrony. Journal of ACM 35(2), 288-323 (1988)
14. Dolev D., Lynch N.A., Pinter S., Stark E.W., Weihl W.E., Reaching Approximate Agreement in the Presence of Faults. Journal of ACM 33(3), 499-516 (1986)
15. Fischer M.J., Lynch N.A., Paterson M.S., Impossibility of Distributed Consensus with One Faulty Process. Journal of ACM 32(2), 374-382 (1985)
16. Gafni E., Koutsoupias E., Three-Processor Tasks Are Undecidable. SIAM Journal of Computing 28(3), 970-983 (1999)
17. Herlihy M.P., Rajsbaum S., On the Decidability of Distributed Decision Tasks. Proc. 29th ACM Symposium on the Theory of Computing (STOC'97), ACM Press, pp. 589-598 (1997)
18. Herlihy M.P., Rajsbaum S., New Perspectives in Distributed Computing. Invited Talk, Proc. 24th Int. Symposium on Mathematical Foundations of Computer Science (MFCS'99), Springer, LNCS #1672, pp. 170-186 (1999)
19. Inoue M., Chen W., Masuzawa T., Tokura N., Linear-Time Snapshot Using Multi-Writer Multi-Reader Registers. Proc. 8th Int. Workshop on Distributed Algorithms (WDAG'94), Springer, LNCS #857, pp. 130-140 (1994)
20. Israeli A., Shaham A., Shirazi A., Linear-Time Snapshot Protocols for Unbalanced Systems. Proc. 7th Int. Workshop on Distributed Algorithms, Springer, LNCS #725, pp. 26-38 (1993)
21. Lynch N.A., Distributed Algorithms. Morgan Kaufmann Pub., San Francisco, CA, 872 pages (1996)
22. Mostéfaoui A., Rajsbaum S., Raynal M., Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems. Proc. 33rd ACM Symposium on Theory of Computing (STOC'01), ACM Press, pp. 153-162, Hersonissos, Crete, Greece (2001)
23. Mostéfaoui A., Rajsbaum S., Raynal M., Roy M., A Hierarchy of Conditions for Consensus Solvability. Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC'01), ACM Press, pp. 151-160, Newport, RI (2001)
24. Mostéfaoui A., Rajsbaum S., Raynal M., Roy M., Condition-Based Protocols for Set Agreement Problems, Proc. 16th Int. Symp. on Distributed Computing (DISC'02), Springer, LNCS #2508, pp. 48-62 (2002)
25. Mostéfaoui A., Rajsbaum S., Raynal M., Roy M., Efficient Condition-Based Consensus. Proc. 8th International Colloquium on Structural Information and Communication Complexity (SIROCCO'01), Carleton Scientific Press, pp. 275-293, Vail de Nùria, Catalonia, Spain (2001)
26. Mostéfaoui A., Raynal M., Tronel F., The Best of Both Worlds: a Hybrid Approach to Solve Consensus. Proc. IEEE Int. Conf. on Dependable Systems and Networks (DSN'00, previously FTCS), pp. 513-522 (2000)
27. Taubenfeld G., Katz S., Moran S., Impossibility Results in the Presence of Multiple Faulty Processes. Information and Computation 113(2), 173-198 (1994)
28. Taubenfeld G., Moran S., Possibility and Impossibility Results in a Shared Memory Environment. Acta Informatica 35, 1-20 (1996)