Transactional contention management as a non-clairvoyant scheduling problem
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Path-independent load balancing with unreliable machines
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
SIAM Journal on Computing
| Hi-index | 0.00 |
We study fault-tolerant multiprocessor scheduling under the realistic assumption that the occurrence of faults cannot be predicted. The goal in these problems is to minimize the delay incurred by the jobs. Since this is an online problem we use competitive analysis to evaluate possible algorithms. For the problems of minimizing the makespan and minimizing the average completion time (for static release times), we give nonclairvoyant algorithms (both deterministic and randomized) that have provably asymptotically optimal competitive ratios. The main tool used by these algorithms to combat faults is redundancy. We also show that randomization has the same effect as redundancy.