Abstract
While any fault-tolerant asynchronous consensus algorithm requires two communication steps even in failure-free executions, it is known that we can construct an algorithm terminating in one step for some good inputs (e.g. all processes propose a same value). In this paper, we present the necessary and sufficient constraint for the set of inputs for which we can construct an asynchronous consensus algorithm terminating in one step. Our investigation is based on the notion of the condition-based approach: it introduces conditions on input vectors to specify subsets of all possible input vectors and condition-based algorithms can circumvent some impossibility if the actual input vector satisfy a particular condition. More interestingly, conditions treated in this paper are adaptive. That is, we consider hierarchical sequences of conditions whose k-th condition is the set of input vectors for which the consensus can be solved in one step if at most k processes crash. The necessary and sufficient constraint we propose in this paper is one for such condition sequences. In addition, we present an instance of the sufficient condition sequences. Compared with existing constraints for inputs this instance is more relaxed.
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., Welch, J.L.: Sequential consistency versus linearizability. ACM Transactions on Computer Systems 12(2), 91–122 (1994)
Brasileiro, F., Greve, F.G.P., Mostéfaoui, A., Raynal, M.: Consensus in one communication step. In: Malyshkin, V.E. (ed.) PaCT 2001. LNCS, vol. 2127, pp. 42–50. Springer, Heidelberg (2001)
Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)
Dutta, P.S., Guerraoui, R.: Fast indulgent consensus with zero degradation. In: Bondavalli, A., Thévenod-Fosse, P. (eds.) EDCC 2002. LNCS, vol. 2485, pp. 191–208. Springer, Heidelberg (2002)
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2), 374–382 (1985)
Friedman, R., Mostéfaoui, A., Rajsbaum, S., Raynal, M.: 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 faults detectors (extended abstract): unifying synchrony and asynchrony. In: Proceedings of the 17th annual ACM symposium on Principles of distributed computing, pp. 143–152 (1998)
Guerraoui, R.: Revisiting the relationship between non-blocking atomic commitment and consensus. In: Helary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol. 972. Springer, Heidelberg (1995)
Guerraoui, R., Raynal, M.: The information structure of indulgent consensus. IEEE Trans. Computers 53(4), 453–466 (2004)
Hadzilacos, V., Toueg, S.: Fault-tolerant broadcasts and related problems. In: Mullender, S. (ed.) Distributed Systems, ch. 5, pp. 97–145. Addison-Wesley, Reading (1993)
Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13, 124–149 (1991)
Izumi, T., Masuzawa, T.: Synchronous condition-based consensus adapting to input-vector legality. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 16–29. Springer, Heidelberg (2004)
Keider, I., Rajsbaum, S.: On the cost of fault-tolerant consensus when there are no faults. SIGACT News 32(2), 45–63 (2001)
Mostéfaoui, A., Rajsbaum, S., Raynal, M.: Conditions on input vectors for consensus solvability in asynchronous distributed systems. Journal of the ACM 50(6), 922–954 (2003)
Mostéfaoui, A., Rajsbaum, S., Raynal, M.: Using conditions to expedite consensus in synchronous distributed systems. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 249–263. Springer, Heidelberg (2003)
Mostéfaoui, A., Rajsbaum, S., Raynal, M.: The synchronous condition-based consensus hierarchy. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 1–15. Springer, Heidelberg (2004)
Mostéfaoui, A., Rajsbaum, S., Raynal, M.: The combined power of conditions and failure detectors to solve asynchronous set agreement. In: Proceedings of the 24th annual ACM symposium on Principles of distributed computing (to appear, 2005)
Mostéfaoui, 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)
Mostéfaoui, A., Rajsbaum, S., Raynal, M., Roy, M.: Condition-based consensus solvability: a hierarchy of conditions and efficient protocols. Distributed Computing 17(1), 1–20 (2004)
Zibin, Y.: Condition-based consensus in synchronous systems. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 239–248. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Izumi, T., Masuzawa, T. (2006). One-Step Consensus Solvability. In: Dolev, S. (eds) Distributed Computing. DISC 2006. Lecture Notes in Computer Science, vol 4167. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11864219_16
Download citation
DOI: https://doi.org/10.1007/11864219_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44624-8
Online ISBN: 978-3-540-44627-9
eBook Packages: Computer ScienceComputer Science (R0)