Brief announcement: Fast shared counting using O(n) compare-and-swap registers

DOI10.1145/3087801.3087841zbMATH Open1380.68431OpenAlexW2736931660MaRDI QIDQ5368947FDOQ5368947

Authors: Pankaj Khanchandani, Roger Wattenhofer 

Publication date: 11 October 2017

Published in: Proceedings of the ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

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

Recommendations

• Concurrent counting (extended abstract)
• Concurrent counting
• Long-lived counters with polylogarithmic amortized step complexity
• Approximate shared-memory counting despite a strong adversary
• Approximate shared-memory counting despite a strong adversary

zbMATH Keywords

wait-freecompare-and-swaplinearizableshared counter

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cited In (3)

• EFFICIENT HARDWARE ALGORITHMS FOR N CHOOSE K COUNTERS USING THE BITONIC MERGER
• Efficient fetch-and-increment
• Long-lived counters with polylogarithmic amortized step complexity

This page was built for publication: Brief announcement: Fast shared counting using \(O(n)\) compare-and-swap registers

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