An Inherent Bottleneck in Distributed Counting
- 1 February 1998
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 49 (1), 135-145
- https://doi.org/10.1006/jpdc.1998.1431
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Optimizing the costs of hierarchical quorum consensusActa Informatica, 1996
- Linearizable counting networksDistributed Computing, 1996
- How to assign votes in a distributed systemJournal of the ACM, 1985
- A √N algorithm for mutual exclusion in decentralized systemsACM Transactions on Computer Systems, 1985