A Lower Bound on Wait-Free Counting

DOI10.1006/JAGM.1996.0837MaRDI QIDQ4349696zbMATH OpenOpenAlexFDO

Authors Shlomo Moran, Gadi Taubenfeld

Publication date 25 May 1998

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1996.0837

zbMATH Keywords

counting protocol

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Concurrent counting
• Linearizable counting networks
• Concurrent counting (extended abstract)
• Counting networks
• An inherent bottleneck in distributed counting

Cited in

(9)

• Public data structures: counters as a special case.
• Computing in totally anonymous asynchronous shared memory systems
• Solo-valency and the cost of coordination
• Long-lived counters with polylogarithmic amortized step complexity
• Linearizable counting networks
• Hundreds of impossibility results for distributed computing
• Read-modify-write networks
• Concurrent counting (extended abstract)
• Sequentially consistent versus linearizable counting networks

This page was built for publication: A Lower Bound on Wait-Free Counting

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