Randomization helps to perform independent tasks reliably
From MaRDI portal
Publication:4446875
DOI10.1002/rsa.10104zbMath1036.68126OpenAlexW2001490013MaRDI QIDQ4446875
Dariusz R. Kowalski, Bogdan S. Chlebus
Publication date: 3 February 2004
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10104
randomized algorithmlower boundload balancingmessage passingdistributed algorithmindependent taskscrash failuresadaptive adversary
Related Items (8)
Performing work in broadcast networks ⋮ Performing tasks on synchronous restartable message-passing processors ⋮ Dealing with undependable workers in decentralized network supercomputing ⋮ 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 ⋮ Contention Resolution with Constant Throughput and Log-Logstar Channel Accesses ⋮ A robust randomized algorithm to perform independent tasks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A robust randomized algorithm to perform independent tasks
- The do-all problem in broadcast networks
- Lower bounds for leader election and collective coin-flipping in the perfect information model
- Performing work with asynchronous processors
- Balanced allocations
- Time-optimal message-efficient work performance in the presence of faults
This page was built for publication: Randomization helps to perform independent tasks reliably