Fault-tolerant Distributed Algorithms for Agreement and Election
Author | : Hosame Hassan Abu-Amara |
Publisher | : |
Total Pages | : 176 |
Release | : 1988 |
ISBN-10 | : OCLC:20961022 |
ISBN-13 | : |
Rating | : 4/5 ( Downloads) |
Download or read book Fault-tolerant Distributed Algorithms for Agreement and Election written by Hosame Hassan Abu-Amara and published by . This book was released on 1988 with total page 176 pages. Available in PDF, EPUB and Kindle. Book excerpt: This thesis consists of three parts. The first part characterizes completely the shared-memory requirements for achieving agreement in an asynchronous system of fail-stop processes that die undetectably. There is no agreement protocol that uses only read and write operations, even if at most one process dies. This result implies the impossibility of Byzantine agreement in asynchronous message-passing systems. Furthermore, there is no agreement protocol that uses test-and-set operations if memory cells have only two values and two or more processes may die. In contrast, there is an agreement protocol with test-and-set operations if either memory cells have at least three values or at most one process dies. Part 2 considers the election problem on asynchronous complete networks when the processors are reliable but some of the channels may be intermittently faulty. To be consistent with the standard model of distributed algorithms in which channel delays can be arbitrary but finite, it is assumed that channel failures are undetectable. Given is an algorithm that correctly solves the problem when the channels fail before or during the execution of the algorithm. The third part presents the most efficient algorithm known of for election in synchronous square meshes. The algorithm uses 229/18n messages, runs in time units, and requires O(log(t)) bits per message. Also, we prove that any comparison algorithm on meshes requires at least 57/32n messages.