Uniform agreement despite process omission failures

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003

Volumn , Issue , 2003, Pages 7-14

  Raipin Parvedy, Philippe ^a   Raynal, Michel ^a  

^a UNIVERSITÉ DE RENNES 1   (France)

Author keywords

Consensus; Crash Failure; Interactive Consistency; Message Passing System; Omission Failure; Synchronous Distributed System; Uniform Agreement

Indexed keywords

CONNECTORS (STRUCTURAL); DISTRIBUTED DATABASE SYSTEMS; MESSAGE PASSING;

CONSENSUS; CRASH FAILURES; INTERACTIVE CONSISTENCY; MESSAGE PASSING SYSTEMS; OMISSION FAILURES; SYNCHRONOUS DISTRIBUTED SYSTEMS;

REAL TIME SYSTEMS;

EID: 84947218331     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2003.1213388     Document Type: Conference Paper

References (17)

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. andWelch J., Distributed Computing: Fundamentals, Simulations and Advanced Topics, McGraw-Hill, 451 pages, 1998.
3. Berman P. and Garay J. A., Cloture Voting: n=4-Resilient Distributed Consensus in t+1 Rounds. Mathematical System Theory, 26(1):3-19, 1993.
4. Chandra T. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM, 43(2):225-267, March 1996.
5. Fischer M. J. and Lynch N., A Lower Bound for the Time to Assure Interactive Consistency. Information Processing Letters, 71:183-186, 1982.
6. 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, April 1985.
7. Garay J. A. and Moses Y., Fully Polynomial Byzantine Agreement forn > 3t Processes in t+1 Rounds. SIAM Journal on Computing, 27(1):247-290, 1998.
8. Garg V. K., Elements of Distributed Computing. Wiley Interscience, 423 pages, 2002.
9. Guerraoui R., HurfinM., Mostefaoui A., Oliveira R., Raynal M. and Schiper A., Consensus in Asynchronous Distributed Systems: A Concise Guided Tour. Advances in Distributed Systems, Springer-Verlag LNCS #1752, pp. 33-47, 2000.
10. Hadzilacos V. and Toueg S., Reliable Broadcast and Related Problems. In Distributed Systems, ACM Press (S. Mullender Ed.), New-York, pp. 97-145, 1993.
11. Hélary J.-M., Hurfin M., Mostéfaoui A., Raynal M. and Tronel F., Computing Global Functions in Asynchronous Distributed Systems with Perfect Failure Detectors. IEEE Transactions on Parallel and Distributed Systems, 11(9):897-910, 2000.
12. Lamport L., Shostak R. and Pease L., The Byzantine General Problem. ACM Transactions on Programming Languages and Systems, 4(3):382-401, 1982.
13. Lynch N. A., Distributed Algorithms. Morgan Kaufmann Pub., San Francisco (CA), 872 pages, 1996.
14. Mostefaoui A., Rajsbaum S. and 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, July 2001.
15. Neiger G. and Toueg S., Automatically Increasing the Fault-Tolerance of Distributed Algorithms. Journal of Algorithms, 11:374-419, 1990.
16. Pease L., Shostak R. and Lamport L., Reaching Agreement in Presence of Faults. Journal of the ACM, 27(2):228-234, 1980.
17. 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, Dec. 2002. http://www. irisa. fr/bibli/publi/pi/2002/1467/1467. html.