Introduction to algorithms
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Coins, weights and contention in balancing networks
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Contention in counting networks
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Computer Systems (TOCS)
Counting networks are practically linearizable
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
The strength of counting networks
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Impossibility results for weak threshold networks
Information Processing Letters
The Impact of Timing on Linearizability in Counting Networks
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Notes on Sorting and Counting Networks (Extended Abstract)
WDAG '93 Proceedings of the 7th International Workshop on Distributed Algorithms
Distributed, Low Contention Task Allocation
SPDP '96 Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing (SPDP '96)
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Small-depth counting networks and related topics
Small-depth counting networks and related topics
Counting networks with arbitrary fan-out
Distributed Computing
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Threshold counters with increments and decrements
Theoretical Computer Science
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A Combinatorial Characterization of Properties Preserved by Antitokens
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Distributed Computing
Using elimination to implement scalable and lock-free FIFO queues
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Scalable lock-free FIFO queues using efficient elimination techniques
Proceedings of the 5th ACM COMPUTE Conference: Intelligent & scalable system technologies
Hi-index | 0.00 |
Counting networks are a class of distributed data structures that support highly concurrent implementations of shared Fetch&Increment counters. Applications of these counters include shared pools and stacks, load balancing, and software barriers [4, 12, 13, 18]. A limitation of counting networks is that the resulting shared counters can be incremented, but not decremented. A recent result by Shavit and Touitou [18] showed that the subclass of tree-shaped counting networks can support, in addition, decrement operations. This paper generalizes their result, showing that any counting network can be extended to support atomic decrements in a simple and natural way. Moreover, it is shown that decrement operations can be supported in networks that provide weaker properties, such as K-smoothing. In general, we identify a broad class of properties, which we call boundedness properties, that are preserved by the introduction of decrements: if a balancing network satisfies a particular boundedness property for increments alone, then it continues to satisfy that property for both increments and decrements. Our proofs are purely combinatorial and rely on the novel concept of a fooling pair of input vectors.