Abstract
The condition-based approach to solve consensus has initially been developed in the context of asynchronous systems. It identifies a class of acceptable conditions on the set of input vectors that, when satisfied by the actual input vector, are exactly the conditions that allow to solve consensus despite up to t faulty processes. This paper investigates the use of conditions to solve consensus in synchronous systems prone to process crash failures. It first shows that for any acceptable condition there is a condition-based protocol solving uniform consensus that enjoys the following property: when the input vector belongs to the condition, it terminates in a single round if no process crashes, and in two rounds otherwise. When the input vector does not belong to the condition, the actual number of rounds is upper bounded by t+1 (it actually depends on both the crash pattern and the input vector). The paper then extends the previous protocol to combine early decision with the condition-based approach. It presents a general protocol that enjoys the previous properties (decision in one or two rounds) when the input vector belongs to the condition and terminates in at most (t + 1, f + 2) rounds when the input vector does not belong to the condition (where f is the actual number of faulty processes). Finally, the paper presents corresponding matching lower bounds. It shows that acceptable conditions are the only ones for which a consensus protocol can enjoy the previous properties.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Attiya, H., Avidor, Z.: Wait-Free n-Set Consensus When Inputs Are Restricted. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 326–338. Springer, Heidelberg (2002)
Aguilera, M.K., Le Lann, G., Toueg, S.: On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 354–370. Springer, Heidelberg (2002)
Chandra, T.K., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM 43(2), 225–267 (1996)
Charron-Bost, B., Schiper, A.: Uniform Consensus is Harder than Consensus. Technical Report DSC/2000/028, EPFL, Lausanne (May 2000)
Dolev, D., Reischuk, R., Strong, R.: Early Stopping in Byzantine Agreement. Journal of the ACM 37(4), 720–741 (1990)
Fischer, M.J., Lynch, N.: A Lower Bound for the Time to Assure Interactive Consistency. Information Processing Letters 71, 183–186 (1982)
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of Distributed Consensus with One Faulty Process. Journal ofthe ACM 32(2), 374–382 (1985)
Friedman, R., Mostefaoui, A., Rajsbaum, S., Raynal, M.: Asynchronous Distributed Agreement and its Relation with Error Correcting Codes. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 63–87. Springer, Heidelberg (2002)
Gafni, E.: Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony. In: Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC 1998), pp. 133–143. ACM Press, New York (1998)
Guerraoui, R.: Indulgent Algorithms. In: Proc. 19th ACM Symposium on Principles of Distributed Computing (PODC 2000), pp. 289–297. ACM Press, New York (2000)
Guerraoui, R., Raynal, M.: A Generic Framework for Indulgent Consensus. In: Proc. 23rd Int. IEEE Conference on Distributed Computing Systems (ICDCS 2003), Providence (RI), May 2003, pp. 88–97 (2003)
Hurfin, M., Mostefaoui, A., Raynal, M.: A Versatile Family of Consensus Protocols Based on Chandra-Toueg’s Unreliable Failure Detectors. IEEE Transactions on Computers 51(4), 395–408 (2002)
Herlihy, M.P., Rajsbaum, S., Tuttle, M.R.: Unifying Synchronous and Asynchronous Message-Passing Models. In: Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC 1998), pp. 133–142. ACM Press, New York (1998)
Keidar, I., Rajsbaum, S.: A Simple Proof of the Uniform Consensus Synchronous Lower Bound. Information Processing Letters 85, 47–52 (2003)
Keidar, I., Rajsbaum, S.: On the Cost of Fault-tolerant Consensus When There Are No Faults. Technical Report MIT-LCS-TR-821, MIT Lab. for CS (May 2001)
Lamport, L.: The Part-Time Parliament. ACM TOCS 16(2), 133–169 (1998)
Lamport, L., Fischer, M.: Byzantine Generals and Transaction Commit Protocols. 16 pages (April 1982) (unpublished manuscript)
Lynch, N.A.: Distributed Algorithms, 872 pages. Morgan Kaufmann Pub., San Francisco (1996)
Moses, Y., Rajsbaum, S.: A Layered Analysis of Consensus. SIAM Journal of Computing 31(4), 989–1021 (2002)
Mostefaoui, A., Rajsbaum, S., Raynal, M.: Conditions on Input Vectors for Consensus Solvability in Asynchronous Distributed Systems. In: Proc. 33rd ACM Symposium on Theory of Computing (STOC 2001), pp. 153–162. ACM Press, New York (2001)
Mostefaoui, A., Rajsbaum, S., Raynal, M.: Using Conditions to Expedite Consensus in Synchronous Distributed Systems. IRISA Research Report #1510 Rennes (F) (2003), http://www.irisa.fr/bibli/publi/pi/2003/1510/1510.html
Mostefaoui, A., Rajsbaum, S., Raynal, M., Roy, M.: Efficient Condition-Based Consensus. In: 8th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO 2001), pp. 275–293. Carleton Univ. Press, Ottawa (2001)
Mostefaoui, A., Rajsbaum, S., Raynal, M., Roy, M.: Condition-Based Protocols for Set Agreement Problems. In: Malkhi, D. (ed.) DISC 2002. LNCS, vol. 2508, pp. 48–62. Springer, Heidelberg (2002)
Mostefaoui, A., Raynal, M.: Leader-Based Consensus. Parallel Processing Letters 11(1), 95–107 (2001)
Raynal, M.: Consensus in Synchronous Systems: a Concise Guided Tour. In: Proc. 9th IEEE Pacific Rim Int. Symposium on Dependable Computing (PRDC 2002), Tsukuba (Japan), December 2002, pp. 221–228. IEEE Computer Press, Los Alamitos (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mostefaoui, A., Rajsbaum, S., Raynal, M. (2003). Using Conditions to Expedite Consensus in Synchronous Distributed Systems. In: Fich, F.E. (eds) Distributed Computing. DISC 2003. Lecture Notes in Computer Science, vol 2848. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39989-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-39989-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20184-7
Online ISBN: 978-3-540-39989-6
eBook Packages: Springer Book Archive