The complexity of synchronous iterative do-all with crashes

DOI10.1007/S00446-003-0099-3MaRDI QIDQ5138503zbMATH OpenOpenAlexFDO

Authors Chryssis Georgiou, Alexander Russell, Alexander A. Schwarzmann

Publication date 4 December 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-003-0099-3

zbMATH Keywords

distributed algorithmsfault-tolerancelower boundswork complexity

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 2006650
• Doing-it-all with bounded work and communication
• scientific article; zbMATH DE number 2013838
• The Do-All problem with Byzantine processor failures
• A robust randomized algorithm to perform independent tasks

Cites work

• Achieving optimal CRCW PRAM fault-tolerance
• Algorithms for the Certified Write-All Problem
• An algorithm for the asynchronous \textit{Write-All} problem based on process collision
• Dynamic load balancing with group communication
• Efficient parallel algorithms can be made robust
• scientific article; zbMATH DE number 1696670 (Why is no real title available?)
• scientific article; zbMATH DE number 1256650 (Why is no real title available?)
• scientific article; zbMATH DE number 1306905 (Why is no real title available?)
• scientific article; zbMATH DE number 1033646 (Why is no real title available?)
• scientific article; zbMATH DE number 1979510 (Why is no real title available?)
• scientific article; zbMATH DE number 2006650 (Why is no real title available?)
• On the Complexity of Certified Write-All Algorithms
• Parallel Algorithms with Processor Failures and Delays
• Parallelism in random access machines
• Performing tasks on synchronous restartable message-passing processors
• Performing work efficiently in the presence of faults
• Time-optimal message-efficient work performance in the presence of faults
• Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers

Cited in

(9)

• A robust randomized algorithm to perform independent tasks
• The Do-All problem with Byzantine processor failures
• Online parallel scheduling of non-uniform tasks: trading failures for energy
• Efficient gossip and robust distributed computation
• scientific article; zbMATH DE number 2006650 (Why is no real title available?)
• scientific article; zbMATH DE number 2013838 (Why is no real title available?)
• Performing tasks on synchronous restartable message-passing processors
• Doing-it-all with bounded work and communication
• Algebraic topology and distributed computing

This page was built for publication: The complexity of synchronous iterative do-all with crashes

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