Concurrent counting is harder than queuing

DOI10.1016/j.tcs.2010.07.002zbMath1205.68503OpenAlexW1978890639WikidataQ60148586 ScholiaQ60148586MaRDI QIDQ604464

Srikanta Tirthapura, Costas Busch

Publication date: 11 November 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.07.002

zbMATH Keywords

distributed algorithmsdistributed countingdistributed data structuresdistributed queuing

Mathematics Subject Classification ID

Data structures (68P05) Distributed algorithms (68W15)

Related Items

Graph spanners: a tutorial review

Cites Work

• An inherent bottleneck in distributed counting
• The cost of concurrent, low-contention Read \& Modify \& Write
• Competitive concurrent distributed queuing
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Counting networks
• Unnamed Item