Abstract
This paper proposes a novel condition-based algorithm for the uniform consensus in synchronous systems. The proposed algorithm is adaptive in the sense that its execution time depends on actual difficulty of input vectors, legality level, which is newly formalized in this paper. On the assumption that majority of processes are correct, the algorithm terminates within min {f + 2 − − l, t + 1} rounds if l < f, where f and t is the actual and the maximum numbers of faults respectively, and l is the legality level of input vectors. Moreover, the algorithm terminates in 1 round if l ≥ t and f=0, and terminates within 2 rounds if l ≥ f holds. Compared with previous algorithms, for the case of t < n/2, the algorithm achieves the best time complexity in almost all situations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
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)
Chandra, T.D., 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 (extended abstract). Technical Report DSC/2000/028, EPFL, Lausanne(Switzerland) (May 2000)
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)
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)
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)
Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)
Mostefaoui, 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)
Mostefaoui, A., Rajsbaum, S., Raynal, M.: Using conditions to exppedite consensus in synchronous distributed systems. In: Fich, F.E. (ed.) DISC 2003. LNCS, vol. 2848, pp. 249–263. Springer, Heidelberg (2003)
Mostefaoui, 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) (to appear)
Mostefaoui, 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)
Raynal, M.: Consensus in synchronous systems: A concise guided tour. In: Proc. of Pacific Rim International Symposium on Dependable Computing(PRDC), pp. 221–228 (2002)
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
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Izumi, T., Masuzawa, T. (2004). Synchronous Condition-Based Consensus Adapting to Input-Vector Legality. In: Guerraoui, R. (eds) Distributed Computing. DISC 2004. Lecture Notes in Computer Science, vol 3274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30186-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-30186-8_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23306-0
Online ISBN: 978-3-540-30186-8
eBook Packages: Springer Book Archive