Adding networks

Authors:
Panagiota Fatourou;Maurice Herlihy
Affiliations:
Univ. of Toronto;Brown Univ.
Venue:
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Year:
2001

Citing 4
Cited 0

Efficient synchronization primitives for large-scale cache-coherent multiprocessors

ASPLOS III Proceedings of the third international conference on Architectural support for programming languages and operating systems
Counting networks

Journal of the ACM (JACM)
Linearizable counting networks

Distributed Computing
Supporting increment and decrement operations in balancing networks

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Quantified Score

Hi-index	0.00

Visualization

Abstract

An adding network is a distributed data structure that supports a concurrent, lock-free, low-contention implementation of a fetch&add counter. We give a lower bound showing that adding networks have inherently high latency. We prove that our lower bound is tight.