Brief Announcement: Early Decision Despite General Process Omission Failures

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 222-

  Le Fessant, Fabrice ^a   Parvédy, Philippe Raipin ^b   Raynal, Michel ^b  

^a MICROSOFT RESEARCH   (United States)

^b CAMPUS DE BEAULIEU   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEM RECOVERY; DECISION THEORY; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION;

PROCESS OMISSION FAILURES; SYNCHRONOUS SYSTEMS;

NETWORK PROTOCOLS;

EID: 1142268847     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. Le Fessant F., The Complexity of Early-Deciding in Unreliable Networks. Research Report #TR-2003-23, Microsoft Research, Cambridge, UK, April 2003.
2. Raipin Parvédy Ph. and Raynal M., Optimal Early Stopping Uniform Consensus in Synchronous Systems with Process Omission Failures. Research Report #1509, 20 pages, IRISA, France, January 2003. www.irisa.fr/bibli/publi/pi/2003/1509/1509.html.
3. Raynal M., Consensus in Synchronous Systems: a Concise Guided Tour. 9th IEEE Pacific Rim Int. Symp. on Dependable Comp., Tsukuba (Japan), pp. 221-228, 2002.