DSpace Repository

Lower Bounds for Achieving Synchronous Early Stopping Consensus with Orderly Crash Failures

Show simple item record

dc.creator Wang, Xianbing
dc.creator Teo, Yong Meng
dc.creator Cao, Jiannong
dc.date 2004-12-13T06:59:15Z
dc.date 2004-12-13T06:59:15Z
dc.date 2005-01
dc.date.accessioned 2013-10-09T02:49:29Z
dc.date.available 2013-10-09T02:49:29Z
dc.date.issued 2013-10-09
dc.identifier http://hdl.handle.net/1721.1/7425
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/1721
dc.description In this paper, we discuss the consensus problem for synchronous distributed systems with orderly crash failures. For a synchronous distributed system of n processes with up to t crash failures and f failures actually occur, first, we present a bivalency argument proof to solve the open problem of proving the lower bound, min (t + 1, f + 2) rounds, for early-stopping synchronous consensus with orderly crash failures, where t < n - 1. Then, we extend the system model with orderly crash failures to a new model in which a process is allowed to send multiple messages to the same destination process in a round and the failing processes still respect the order specified by the protocol in sending messages. For this new model, we present a uniform consensus protocol, in which all non-faulty processes always decide and stop immediately by the end of f + 1 rounds. We prove that the lower bound of early stopping protocols for both consensus and uniform consensus are f + 1 rounds under the new model, and our proposed protocol is optimal.
dc.description Singapore-MIT Alliance (SMA)
dc.format 434519 bytes
dc.format application/pdf
dc.language en
dc.relation Computer Science (CS);
dc.subject Consensus
dc.subject Orderly crash failure
dc.subject Early stopping
dc.subject synchronous distributed system
dc.title Lower Bounds for Achieving Synchronous Early Stopping Consensus with Orderly Crash Failures
dc.type Article

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace

Advanced Search


My Account