Supporting Increment and Decrement Operations in Balancing Networks

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

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.
BibTeX
@article{aiello2000supporting,
  author = {William Aiello and Costas Busch and Maurice Herlihy and Marios Mavronicolas and Nir Shavit and Dan Touitou},
  title = {{Supporting Increment and Decrement Operations in Balancing Networks}},
  journal = {Chic. J. Theor. Comput. Sci.},
  year = {2000},
  url = {https://openreview.net/forum?id=To2k0RmCHh},
}

Loading related content...

Figure