An inherent bottleneck in distributed counting

DOI10.1006/jpdc.1998.1431zbMath0983.68043OpenAlexW2086282679MaRDI QIDQ1130325

Roger Wattenhofer, Peter Widmayer

Publication date: 20 August 1998

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/20.500.11850/68791

zbMATH Keywords

distributed algorithmdistributed countingdistributed data structureshot-spot

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (3)

Concurrent counting is harder than queuing ⋮ Hundreds of impossibility results for distributed computing ⋮ Read-modify-write networks

This page was built for publication: An inherent bottleneck in distributed counting