Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/3873Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Wang, Xianbing | - |
| dc.creator | Teo, Yong Meng | - |
| dc.creator | Cao, Jiannong | - |
| dc.date | 2003-12-13T20:18:35Z | - |
| dc.date | 2003-12-13T20:18:35Z | - |
| dc.date | 2004-01 | - |
| dc.date.accessioned | 2013-10-09T02:32:53Z | - |
| dc.date.available | 2013-10-09T02:32:53Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | http://hdl.handle.net/1721.1/3873 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | A fundamental problem of fault-tolerant distributed computing is for the reliable processes to reach a consensus. For a synchronous distributed system of n processes with up to t crash failures and f failures actually occur, we prove using a straightforward bivalency argument that the lower bound for reaching uniform consensus is (f + 2)-rounds in the case of 0 < f â ¤ t â 2, and a new lower bound for early-stopping consensus is min (t + 1, f + 2)-rounds where 0 â ¤ f â ¤ t. Both proofs are simpler and more intuitive than the traditional methods such as backward induction. Our main contribution is that we solve the open problem of proving that bivalency can be applied to show the (f + 2)-rounds lower bound for synchronous uniform consensus. | - |
| dc.description | Singapore-MIT Alliance (SMA) | - |
| dc.format | 158064 bytes | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | Computer Science (CS); | - |
| dc.subject | consensus | - |
| dc.subject | synchronous distributed system | - |
| dc.subject | bivalency | - |
| dc.subject | early-stopping. | - |
| dc.title | Simple Bivalency Proofs of the Lower Bounds in Synchronous Consensus Problems | - |
| dc.type | Article | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.