Performing tasks on synchronous restartable message-passing processors

DOI10.1007/PL00008926zbMath1448.68083OpenAlexW1985312855MaRDI QIDQ5138349

Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Schwarzmann

Publication date: 3 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00008926

zbMATH Keywords

distributed systemsfault-toleranceload balancingworkprocessor restarts

Mathematics Subject Classification ID

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

Related Items (11)

Dynamic load balancing with group communication ⋮ The complexity of synchronous iterative Do-All with crashes ⋮ Doing-it-all with bounded work and communication ⋮ Ordered and delayed adversaries and how to work against them on a shared channel ⋮ The Do-All problem with Byzantine processor failures ⋮ A robust randomized algorithm to perform independent tasks ⋮ Cooperative computing with fragmentable and mergeable groups ⋮ Parallel computing, failure recovery, and extreme values ⋮ Efficient gossip and robust distributed computation ⋮ Performing work with asynchronous processors: Message-delay-sensitive bounds ⋮ Online parallel scheduling of non-uniform tasks: trading failures for energy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient parallel algorithms can be made robust
• Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
• Performing Work Efficiently in the Presence of Faults
• Randomization helps to perform independent tasks reliably
• Time-optimal message-efficient work performance in the presence of faults

This page was built for publication: Performing tasks on synchronous restartable message-passing processors