Supporting increment and decrement operations in balancing networks

William Aiello, Costas Busch, Maurice Herlihy, Marios Mavronicolas, Nir Shavit, Dan Touitou

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

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 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.

Original languageEnglish (US)
Title of host publicationSTACS 99 - 16th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
EditorsChristoph Meinel, Sophie Tison
PublisherSpringer Verlag
Pages393-403
Number of pages11
ISBN (Print)354065691X, 9783540656913
DOIs
StatePublished - 1999
Externally publishedYes
Event16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1999 - Trier, Germany
Duration: Mar 4 1999Mar 6 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1563
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th Annual Symposium on Theoretical Aspects of Computer Science, STACS 1999
CountryGermany
CityTrier
Period3/4/993/6/99

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Supporting increment and decrement operations in balancing networks'. Together they form a unique fingerprint.

Cite this