Counting networks

DOI10.1145/185675.185815zbMATH Open0813.68050OpenAlexW2295944892MaRDI QIDQ4323733FDOQ4323733

Authors: James Aspnes, Nir Shavit, Maurice 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

Recommendations

• Linearizable counting networks
• An efficient counting network
• Concurrent counting is harder than queuing
• Timing conditions for linearizability in uniform counting networks
• scientific article; zbMATH DE number 2006662

zbMATH Keywords

counting networksmulti-processor coordination problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Network design and communication in computer systems (68M10)

Cited In (33)

• Linearizable counting networks
• Read-modify-write networks
• Title not available (Why is that?)
• Sequentially consistent versus linearizable counting networks
• An efficient counting network
• Quantifiability: a concurrent correctness condition modeled in vector space
• Counting networks with arbitrary fan-out
• Concurrent correctness in vector space
• Design and implementation of counting networks
• Impossibility results for weak threshold networks
• Counting membrane systems
• Bounded-wait combining: constructing robust and high-throughput shared objects
• Public data structures: counters as a special case.
• Title not available (Why is that?)
• A simple approach for adapting continuous load balancing processes to discrete settings
• The impact of randomization in smoothing networks
• Concurrent counting is harder than queuing
• Distributed counting along lossy paths without feedback
• Scalable eventually consistent counters over unreliable networks
• Software transactional memory
• Counting hidden neural networks
• A Lower Bound on Wait-Free Counting
• Solo-valency and the cost of coordination
• Towards a practical snapshot algorithm
• Quantized consensus
• Tight bounds for asynchronous renaming
• Supporting increment and decrement operations in balancing networks
• The cost of concurrent, low-contention Read \& Modify \& Write
• Decidability and complexity for quiescent consistency and its variations
• A framework for correctness criteria on weak memory models
• Long-lived counters with polylogarithmic amortized step complexity
• Self-stabilizing smoothing and balancing networks
• Threshold counters with increments and decrements

This page was built for publication: Counting networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4323733)