Collective asynchronous reading with polylogarithmic worst-case overhead

DOI10.1145/1007352.1007406zbMath1192.68079OpenAlexW2063466409MaRDI QIDQ3580978

Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander A. Schwarzmann

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Related Items (3)

Meeting the deadline: on the complexity of fault-tolerant continuous gossip ⋮ Doing-it-all with bounded work and communication ⋮ Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts

This page was built for publication: Collective asynchronous reading with polylogarithmic worst-case overhead