Randomization helps to perform independent tasks reliably
From MaRDI portal
Publication:4446875
DOI10.1002/rsa.10104zbMath1036.68126MaRDI 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 algorithm; lower bound; load balancing; message passing; distributed algorithm; independent tasks; crash failures; adaptive adversary
68W20: Randomized algorithms
Related Items
Dealing with undependable workers in decentralized network supercomputing, Locating and repairing faults in a network with mobile agents, A robust randomized algorithm to perform independent tasks, Performing work in broadcast networks
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item