Concurrent counting

DOI10.1006/JCSS.1996.0049MaRDI QIDQ1816742zbMATH OpenOpenAlexFDO

Authors Shlomo Moran, Gadi Taubenfeld, Irit Yadin

Publication date 31 March 1997

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcss.1996.0049

zbMATH Keywords

concurrent counters

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Concurrent counting (extended abstract)
• Counting
• scientific article; zbMATH DE number 1807401
• Concurrent counting is harder than queuing
• Towards optimal synchronous counting

Cited in

(18)

• Mechanical sequential counting with liquid marbles
• Public data structures: counters as a special case.
• The counting pyramid: an adaptive distributed counting scheme
• Bounded-wait combining: constructing robust and high-throughput shared objects
• Long-lived counters with polylogarithmic amortized step complexity
• Towards optimal synchronous counting
• Constructing Shared Objects That Are Both Robust and High-Throughput
• scientific article; zbMATH DE number 5526622 (Why is no real title available?)
• A Lower Bound on Wait-Free Counting
• Hundreds of impossibility results for distributed computing
• MAX registers, counters, and monotone circuits
• Concurrent counting (extended abstract)
• Brief announcement: Fast shared counting using \(O(n)\) compare-and-swap registers
• Polylogarithmic concurrent data structures from monotone circuits
• Sequentially consistent versus linearizable counting networks
• Threshold counters with increments and decrements
• Concurrent counting is harder than queuing
• Long-lived counters with polylogarithmic amortized step complexity

This page was built for publication: Concurrent counting

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