Copyright © 2002 Elsevier Science B.V. All rights reserved.
Threshold counters with increments and decrements*1
Received 15 July 1999;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
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.
Author Keywords: Distributed computing; Threshold counters; Threshold and weak threshold networks; Increments; Decrements







E-mail Article
Add to my Quick Links

Cited By in Scopus (0)






