Counting networks

DOI10.1145/185675.185815MaRDI QIDQ4323733zbMATH OpenOpenAlexFDO

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

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)

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

Cited in

(33)

• scientific article; zbMATH DE number 742955 (Why is no real title available?)
• Linearizable counting networks
• Read-modify-write networks
• Sequentially consistent versus linearizable counting networks
• An efficient counting network
• Impossibility results for weak threshold networks
• Concurrent correctness in vector space
• Counting networks with arbitrary fan-out
• Quantifiability: a concurrent correctness condition modeled in vector space
• Design and implementation of counting networks
• Counting membrane systems
• Public data structures: counters as a special case.
• Bounded-wait combining: constructing robust and high-throughput shared objects
• scientific article; zbMATH DE number 2006662 (Why is no real title available?)
• Concurrent counting is harder than queuing
• A simple approach for adapting continuous load balancing processes to discrete settings
• The impact of randomization in smoothing networks
• 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
• Quantized consensus
• Towards a practical snapshot algorithm
• 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)