Abstract
Three main parameters characterize the efficiency of algorithms that solve the Consensus Problem. The ratio between the total number of processors and the maximum number of faulty processors (n and t, respectively), the number of rounds, and the size of any single message. Lower bounds exist for each one of the three. In this paper we present two families of algorithms, each achieving the lower bound for one parameter and a trade-off between the other two. The first family includes algorithms where, given an integer k, the algorithm always requires the minimal possible number of rounds (t+1), with n=k(3t+1) processors and messages of size at most t O(t/k). To the second family belong algorithms in which all messages are of one bit size, the number of processors is t O((k+1)/k) and the number of rounds is t+t O((k−1)/k). These two families are based on a very simple algorithm with (2t+1)(t+1) processors using the minimal number of rounds and the minimal message size (one bit).
Original language | English |
---|---|
Title of host publication | VLSI Algorithms and Architectures - 3rd Aegean Workshop on Computing, AWOC 1988, Proceedings |
Editors | John H. Reif |
Publisher | Springer Verlag |
Pages | 380-390 |
Number of pages | 11 |
ISBN (Print) | 9780387968186 |
DOIs | |
State | Published - 1988 |
Event | 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988 - Corfu, Greece Duration: 28 Jun 1988 → 1 Jul 1988 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 319 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 3rd Aegean Workshop on Computing: VLSI Algorithms and Architectures, AWOC 1988 |
---|---|
Country/Territory | Greece |
City | Corfu |
Period | 28/06/88 → 1/07/88 |
Bibliographical note
Publisher Copyright:© 1988, Springer-Verlag.