Please use this identifier to cite or link to this item:
|Title:||Lower bounds for achieving synchronous consensus with orderly crash failures|
|Source:||Zhang, R.,Teo, Y.M.,Chen, Q.,Wang, X. (2007). Lower bounds for achieving synchronous consensus with orderly crash failures. Proceedings - International Conference on Distributed Computing Systems. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDCSW.2007.42|
|Abstract:||The time lower bounds for both uniform consensus and early stopping consensus have already been proved in synchronous distributed systems with crash failures, but both have not been proved with orderly crash failures and remain as open problems. This paper uses a bivalency argument proof to solve the two open problems. The first open problem is how to prove the lower bound, min (t + 1, f + 2) rounds, for early-stopping synchronous consensus with orderly crash failures, where t < n - 1 and 0 ≤ f ≤ t - 1. The second problem is to prove that the lower bound for early deciding uniform consensus with orderly crash failures is (f + 2)-rounds where 0 ≤ f ≤ t - 2, and (f + 1)-rounds when f = t and t - 1. © 2007 IEEE.|
|Source Title:||Proceedings - International Conference on Distributed Computing Systems|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.