Dynamic counting

This paper deals with concurrent counters which are built from RMW bits, and count modulo 2^k (for any k∈𝒩). A counter supports two operations: increment and look. A counter is dynamic if every look operation L returns a value between the number of increments ended before L started and the number of increments started until L ended. A counter is public if it can be accessed by an unbounded number of processes. It was conjectured that there exists no public dynamic counter modulo 2^k for k>1. In this paper we refute this conjecture by showing an efficient dynamic counter modulo 2^k for any k. Our construction is also more efficient than previous constructions that assume an apriori known bound on the number of processes or increment operations. We show how our construction can be used to build an entrance protocol for any counting network to yield a dynamic counting network (a counting network that supports dynamic look). Our transformation preserves the time complexity and the contention of the original counting network. Since it was shown that there exists no linearizable counting network, dynamic counting seems to be the strongest condition one can impose on a counting network