Years and Authors of Summarized Original Work
1996; Chandra
Problem Definition
This problem is concerned with using the multi-writer multi-reader register primitive in the shared memory model to design a fast, wait-free implementation of consensus. Below are detailed descriptions of each of these terms.
Consensus Problems
There are n processors and the goal is to design distributed algorithms to solve the following two consensus problems for these processors.
Problem 1 (Binary consensus)
Input: Processor i has input bit b i .
Output: Each processor i has output bit \( { b^{\prime}_i } \) such that: (1) all the output bits \( { b^{\prime}_i } \) equal the same value v; and (2) \( { v = b_i } \) for some processor i.
Problem 2 (Id consensus)
Input: Processor i has a unique id u i .
Output: Each processor i has output value \( { u^{\prime}_i } \) such that: (1) all the output values \( { u^{\prime}_i } \) equal the same value u; and (2) \( { u = u_i } \) for some processor i.
...This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Aspnes J (2003) Randomized protocols for asynchronous consensus. Distrib Comput 16(2–3):165–175
Aspnes J, Waarts O (1992) Randomized consensus in expected o(n log2n) operations per processor. In: Proceedings of the 33rd symposium on foundations of computer science. IEEE Computer Society, Pittsburgh, 24–26 Oct 1992. pp 137–146
Attiya H, Censor K (2007) Tight bounds for asynchronous randomized consensus. In: Proceedings of the symposium on the theory of computation. ACM special interest group on algorithms and computation theory (SIGACT), San Diego, 11–13 June 2007
Aumann Y (1997) Efficient asynchronous consensus with the weak adversary scheduler. In: Symposium on principles of distributed computing (PODC). ACM special interest group on algorithms and computation theory (SIGACT), Santa Barbara, 21–24 Aug 1997, pp 209–218
Aumann Y, Kapach-Levy A (1999) Cooperative sharing and asynchronous consensus using single-reader/single-writer registers. In: Proceedings of 10th annual ACM-SIAM symposium of discrete algorithms (SODA). Society for Industrial and Applied Mathematics (SIAM), Baltimore, 17–19 Jan 1999, pp 61–70
Dolev D, Dwork C, Stockmeyer L (1987) On the minimal synchronism needed for distributed consensus. J ACM (JACM) 34(1):77–97
Fischer MJ, Lynch NA, Paterson M (1983) Impossibility of distributed consensus with one faulty process. In: Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on principles of database system (PODS). Association for Computational Machinery (ACM), Atlante, 21–23 Mar 1983, pp 1–7
Herlihy M (1991) Wait-free synchronization. ACM Trans Program Lang Syst 13(1):124–149
Lynch N (1996) Distributed algorithms. Morgan Kaufmann, San Mateo
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Chandra, T.D. (2016). Randomization in Distributed Computing. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_321
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_321
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering