Concurrent counting (extended abstract)

DOI10.1145/135419.135434MaRDI QIDQ5348835zbMATH OpenOpenAlexFDO

Authors Shlomo Moran, Gadi Taubenfeld, Irit Yadin

Publication date 21 August 2017

Published in Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/135419.135434

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Concurrent counting
• Linearizable counting networks
• Long-lived counters with polylogarithmic amortized step complexity
• Approximate shared-memory counting despite a strong adversary
• A Lower Bound on Wait-Free Counting

Cited in

(15)

• Concurrent counting
• Public data structures: counters as a special case.
• 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
• MAX registers, counters, and monotone circuits
• Brief announcement: Fast shared counting using \(O(n)\) compare-and-swap registers
• Polylogarithmic concurrent data structures from monotone circuits
• SNZI, scalable nonzero indicators
• 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 (extended abstract)

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