Time-optimal message-efficient work performance in the presence of faults

DOI10.1145/197917.198082MaRDI QIDQ5361406zbMATH OpenOpenAlexFDO

Authors Roberto De Prisco, Alain Mayer, Moti Yung

Publication date 29 September 2017

Published in Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distributed systems (68M14) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Cited in

(16)

• A robust randomized algorithm to perform independent tasks
• The Do-All problem with Byzantine processor failures
• Cooperative computing with fragmentable and mergeable groups
• Ordered and delayed adversaries and how to work against them on a shared channel
• Parallel computing, failure recovery, and extreme values
• Performing work in broadcast networks
• Efficient gossip and robust distributed computation
• Performing work with asynchronous processors: Message-delay-sensitive bounds
• Randomization helps to perform independent tasks reliably
• Dealing with undependable workers in decentralized network supercomputing
• Performing tasks on synchronous restartable message-passing processors
• The complexity of synchronous iterative do-all with crashes
• Doing-it-all with bounded work and communication
• Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication
• Emulating shared-memory do-all algorithms in asynchronous message-passing systems
• Dynamic load balancing with group communication

This page was built for publication: Time-optimal message-efficient work performance in the presence of faults

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