ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Theoretical Computer Science
Volume 270, Issues 1-2, 6 January 2002, Pages 811-826
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (145 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0304-3975(01)00113-X    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2002 Elsevier Science B.V. All rights reserved.

Threshold counters with increments and decrements*1

Costas Busch1, Corresponding Author Contact Information, , a, Neophytos Demetrioub, Maurice Herlihyc and Marios Mavronicolas2, E-mail The Corresponding Author, , b

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

Received 15 July 1999;
revised 14 December 2000;
accepted 6 February 2001.
Communicated by P. Spirakis.
Available online 14 December 2001.

Purchase the full-text article



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: Image changes the current counter value from v to v+1, while Image returns the value left floorv/wright floor, where v is the current counter value and w is a fixed constant. Thus, the Image 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 Image operation that changes the counter value from v to v−1.

Author Keywords: Distributed computing; Threshold counters; Threshold and weak threshold networks; Increments; Decrements


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.