A scalable implementation of barrier synchronization using an adaptive combining tree
International Journal of Parallel Programming
Journal of the ACM (JACM)
Practical parallel programming
Practical parallel programming
Impossibility results for weak threshold networks
Information Processing Letters
Efficient Barriers for Distributed Shared Memory Computers
Proceedings of the 8th International Symposium on Parallel Processing
Notes on Sorting and Counting Networks (Extended Abstract)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Linearizable counting networks
Distributed Computing
Counting networks with arbitrary fan-out
Distributed Computing
Supporting increment and decrement operations in balancing networks
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
| Hi-index | 5.23 |
A threshold counter is a shared data structure that assumes integer values. It provides two operations: Increment changes the current counter value from v to v+1, while Read returns the value [v/w], where v is the current counter value and w is a fixed constant. Thus, the Read operation returns the "approximate" value of the counter to within the constant w. Threshold counters have many potential uses, including software barrier synchronization. Threshold networks are a class of distributed data structures that can be used to construct highly-concurrent, low-contention implementations of shared threshold counters. In this paper, we give the first proof that any threshold network construction of a threshold counter can be extended to support a Decrement operation that changes the counter value from v to v ---1.