Simple Bivalency Proofs of the Lower Bounds in Synchronous Consensus Problems
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 fo...
| প্রধান লেখক: | , , |
|---|---|
| বিন্যাস: | প্রবন্ধ |
| ভাষা: | en_US |
| প্রকাশিত: |
2003
|
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | http://hdl.handle.net/1721.1/3873 |