Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Consensus algorithms with one-bit messages

Consensus algorithms with one-bit messages 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 andt, respectively), the number of rounds, and the upper bound on the size of any message. In this paper we present a trade-off between the number of faulty processors and the number of rounds by exhibiting a family of algorithms in which processors communicate by one-bit messages. Letk be a positive integer and lets=t 1/k . The family includes algorithms where the number of processors is less than $$5{\mathbf{ }}t^{\frac{{(k + 1)}}{k}} = 5 \cdot s \cdot t$$ , and the number of rounds is less than $${\mathbf{ }}t + 3{\mathbf{ }}t^{\frac{{(k - 1)}}{k}} = 1 + \frac{3}{s}$$ . This family is based on a very simple algorithm with the following complexity: (2t+1)(t+1) processors,t+1 rounds, and one-bit message size. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Distributed Computing Springer Journals

Consensus algorithms with one-bit messages

Distributed Computing , Volume 4 (3) – May 11, 2005

Loading next page...
 
/lp/springer-journals/consensus-algorithms-with-one-bit-messages-V0QFjIPjuR

References (8)

Publisher
Springer Journals
Copyright
Copyright © 1991 by Springer-Verlag
Subject
Computer Science; Computer Communication Networks; Computer Hardware; Computer Systems Organization and Communication Networks; Software Engineering/Programming and Operating Systems; Theory of Computation
ISSN
0178-2770
eISSN
1432-0452
DOI
10.1007/BF01798957
Publisher site
See Article on Publisher Site

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 andt, respectively), the number of rounds, and the upper bound on the size of any message. In this paper we present a trade-off between the number of faulty processors and the number of rounds by exhibiting a family of algorithms in which processors communicate by one-bit messages. Letk be a positive integer and lets=t 1/k . The family includes algorithms where the number of processors is less than $$5{\mathbf{ }}t^{\frac{{(k + 1)}}{k}} = 5 \cdot s \cdot t$$ , and the number of rounds is less than $${\mathbf{ }}t + 3{\mathbf{ }}t^{\frac{{(k - 1)}}{k}} = 1 + \frac{3}{s}$$ . This family is based on a very simple algorithm with the following complexity: (2t+1)(t+1) processors,t+1 rounds, and one-bit message size.

Journal

Distributed ComputingSpringer Journals

Published: May 11, 2005

There are no references for this article.