Counting networks
From MaRDI portal
Publication:4323733
DOI10.1145/185675.185815zbMath0813.68050OpenAlexW2295944892MaRDI QIDQ4323733
Nir Shavit, James Aspnes, Maurice P. Herlihy
Publication date: 20 February 1995
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/185675.185815
Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (26)
Impossibility results for weak threshold networks ⋮ Self-stabilizing smoothing and balancing networks ⋮ Solo-valency and the cost of coordination ⋮ Bounded-wait combining: constructing robust and high-throughput shared objects ⋮ Quantized consensus ⋮ Tight Bounds for Asynchronous Renaming ⋮ Concurrent counting is harder than queuing ⋮ Decidability and complexity for quiescent consistency and its variations ⋮ Quantifiability: a concurrent correctness condition modeled in vector space ⋮ Long-lived counters with polylogarithmic amortized step complexity ⋮ A simple approach for adapting continuous load balancing processes to discrete settings ⋮ Counting networks with arbitrary fan-out ⋮ Linearizable counting networks ⋮ Software transactional memory ⋮ Read-modify-write networks ⋮ Scalable eventually consistent counters over unreliable networks ⋮ Concurrent correctness in vector space ⋮ The impact of randomization in smoothing networks ⋮ The cost of concurrent, low-contention Read \& Modify \& Write ⋮ An efficient counting network ⋮ Smoothed analysis of balancing networks ⋮ Threshold counters with increments and decrements ⋮ Towards a practical snapshot algorithm ⋮ A Framework for Correctness Criteria on Weak Memory Models ⋮ Sequentially consistent versus linearizable counting networks ⋮ Public data structures: counters as a special case.
This page was built for publication: Counting networks
