Affiliation: | a Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY 12180–3590, USA b Department of Computer Science, University of Cyprus, P.O. Box 20537, Nicosia, CY-1678, Cyprus c Department of Computer Science, Brown University, Providence, RI 02912, USA |
Abstract: | A threshold counter is a shared data structure that assumes integer values. It provides two operations:
changes the current counter value from v to v+1, while
returns the value v/w, where v is the current counter value and w is a fixed constant. Thus, the
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
operation that changes the counter value from v to v?1. |