Dealing with undependable workers in decentralized network supercomputing
From MaRDI portal
Publication:477093
DOI10.1016/j.tcs.2014.10.015zbMath1303.68032arXiv1407.0442MaRDI QIDQ477093
Seda Davtyan, Alexander Russell, Kishori M. Konwar, Alexander A. Schwarzmann
Publication date: 2 December 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.0442
68M14: Distributed systems
68M15: Reliability, testing and fault tolerance of networks and computer systems
68W15: Distributed algorithms
68M11: Internet topics
Related Items
Cites Work
- Dynamic load balancing with group communication
- Cooperative computing with fragmentable and mergeable groups
- Optimal decision strategies in Byzantine environments
- Robust Network Supercomputing with Malicious Processes
- Performing Work Efficiently in the Presence of Faults
- On the Complexity of Certified Write-All Algorithms
- Randomization helps to perform independent tasks reliably
- Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups
- Time-optimal message-efficient work performance in the presence of faults
- Brief announcement
- Unnamed Item
- Unnamed Item
- Unnamed Item