Collective asynchronous reading with polylogarithmic worst-case overhead

DOI10.1145/1007352.1007406MaRDI QIDQ3580978zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(3)

• Performing dynamically injected tasks on processes prone to crashes and restarts
• Meeting the deadline: on the complexity of fault-tolerant continuous gossip
• Doing-it-all with bounded work and communication

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

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