Performing Work Efficiently in the Presence of Faults
From MaRDI portal
Publication:4210118
DOI10.1137/S0097539793255527zbMath0907.68099OpenAlexW2065160440MaRDI QIDQ4210118
Orli Waarts, Joseph Y. Halpern, Cynthia Dwork
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539793255527
Network design and communication in computer systems (68M10) Reliability, availability, maintenance, inspection in operations research (90B25) Distributed algorithms (68W15)
Related Items (20)
Distributed scheduling for disconnected cooperation ⋮ Performing work in broadcast networks ⋮ Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond ⋮ Robust gossiping with an application to consensus ⋮ Dynamic load balancing with group communication ⋮ Brief Announcement: Improved Consensus in Quantum Networks ⋮ Performing tasks on synchronous restartable message-passing processors ⋮ Dealing with undependable workers in decentralized network supercomputing ⋮ Emulating shared-memory do-all algorithms in asynchronous message-passing systems ⋮ The assignment problem ⋮ Doing-it-all with bounded work and communication ⋮ Locating and repairing faults in a network with mobile agents ⋮ 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 ⋮ Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts ⋮ Cooperative computing with fragmentable and mergeable groups ⋮ Efficient gossip and robust distributed computation ⋮ Performing work with asynchronous processors: Message-delay-sensitive bounds ⋮ RELIABLE INTERNET-BASED MASTER-WORKER COMPUTING IN THE PRESENCE OF MALICIOUS WORKERS
This page was built for publication: Performing Work Efficiently in the Presence of Faults
