Fast randomized consensus using shared memory
Journal of Algorithms
Wait-free data structures in the asynchronous PRAM model
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Counting networks and multi-processor coordination
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Concurrent reading and writing of clocks
ACM Transactions on Computer Systems (TOCS)
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent reading and writing
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Pseudo Read-Modify-Write Operations: Bounded Wait-Free Implementations (Extended Abstract)
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
The Consensus Problem in Unreliable Distributed Systems (A Brief Survey)
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Tight lower and upper bounds for some distributed algorithms for a complete network of processors
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Computing with faulty shared memory
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
A lower bound on wait-free counting
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Wait-freedom vs. bounded wait-freedom in public data structures (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Computing with faulty shared objects
Journal of the ACM (JACM)
On the space complexity of randomized synchronization
Journal of the ACM (JACM)
Public data structures: counters as a special case
Theoretical Computer Science
Wait-free queues with multiple enqueuers and dequeuers
Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
Replicated data types: specification, verification, optimality
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
| Hi-index | 0.00 |
Our purpose is to implement clocks and, in general, counters in a shared memory environment. A concurrent counter is a counter that can be incremented and read, possibly at the same time by many processes. We study counters that achieve high level of concurrency and thus are likely to reduce memory contention; require only weak atomicity and thus are easy to implement; do not depend on the initial state of the memory and hence are more robust to memory changes; and are wait-free - one process cannot prevent another process from finishing its increment or read operations - and thus can tolerate any number of process failures. We concentrate on providing upper and lower bounds on the space complexity of the counters studied.