Doing-it-all with bounded work and communication
From MaRDI portal
Publication:529041
DOI10.1016/j.ic.2017.02.003zbMath1370.68314arXiv1409.4711OpenAlexW40658589MaRDI QIDQ529041
Dariusz R. Kowalski, Alexander A. Schwarzmann, Leszek Gąsieniec, Bogdan S. Chlebus
Publication date: 18 May 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.4711
Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed algorithms (68W15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving the at-most-once problem with nearly optimal effectiveness
- Dealing with undependable workers in decentralized network supercomputing
- Robust gossiping with an application to consensus
- A robust randomized algorithm to perform independent tasks
- Explicit construction of linear sized tolerant networks
- Ramanujan graphs
- Efficient parallel algorithms can be made robust
- Tolerating a linear number of faults in networks of bounded degree
- Optimal adaptive broadcasting with a bounded fraction of faulty nodes
- The Do-All problem with Byzantine processor failures
- Performing work in broadcast networks
- Efficient gossip and robust distributed computation
- Performing work with asynchronous processors: Message-delay-sensitive bounds
- The communication complexity of distributed task allocation
- Introduction to Reliable and Secure Distributed Programming
- Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts
- Explicit Concentrators from Generalized N-Gons
- Time and Communication Efficient Consensus for Crash Failures
- Collective asynchronous reading with polylogarithmic worst-case overhead
- Cooperative asynchronous update of shared memory
- At-Most-Once Semantics in Asynchronous Shared Memory
- Sorting and Selecting in Rounds
- Fault Tolerance in Networks of Bounded Degree
- The Byzantine Generals Problem
- Performing Work Efficiently in the Presence of Faults
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Randomization helps to perform independent tasks reliably
- The Strong At-Most-Once Problem
- Performing tasks on synchronous restartable message-passing processors
- The complexity of synchronous iterative Do-All with crashes
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
- Time-optimal message-efficient work performance in the presence of faults
- Dynamic Task Allocation in Asynchronous Shared Memory
- Asynchronous gossip
- Probability and Computing
- Robust parallel computations through randomization
