Fault-tolerant scheduling

SIAM Journal on Computing

Volumn 34, Issue 3, 2005, Pages 697-719

  Kalyanasundaram, Bala ^a   Pruhs, Kirk R ^b  

^a GEORGETOWN UNIVERSITY   (United States)

^b Learning Research and Development Ctr   (United States)

Author keywords

Competitive analysis; Fault tolerant; Makespan; Multiprocessor scheduling; Permanent faults; Transient faults

Indexed keywords

COMPETITIVE ANALYSIS; FAULT-TOLERANT; MAKESPAN; MULTIPROCESSOR SCHEDULING; PERMANENT FAULTS; TRANSIENT FAULTS;

ALGORITHMS; APPROXIMATION THEORY; FUNCTIONS; MULTIPROCESSING PROGRAMS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; REDUNDANCY;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 20544473140     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794261799     Document Type: Article

References (12)

1. N. ALON AND J. H. SPENCER, The Probabilistic Method, Wiley-Intersci. Ser. Discrete Math. Optim., John Wiley & Sons, New York, 1992.
2. S. BEN-DAVID, A. BORODIN, R. KARP, G. TARDOS, AND A. WIGDERSON, On the power of randomization in on-line algorithms, Algorithmica, 11 (1994), pp. 2-14.
3. A. BORODIN AND R. EL-YANIV, On randomization in on-line computation, in Proceedings of the IEEE Conference on Computational Complexity, 1996, pp. 226-238.
4. T. CORMEN, C. LEISERSON, AND R. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
5. A. FELDMANN, J. SGALL, AND S. TENG, Dynamic scheduling on parallel machines, Theoret. Comput. Sci., 130 (1994), pp. 49-72.
6. R. GRAHAM, E. LAWLER, J. LENSTRA, AND A RINNOOY KAN, Optimization and approximation in deterministic sequencing and scheduling: A survey, Ann. Discrete Math., 5 (1979), pp. 287-326.
7. T. MATSUMOTO, Competitive analysis of the round robin algorithm, in Algorithms and Computation (Nagoya, 1992), Lecture Notes in Comput. Sci. 650, Springer-Verlag, Berlin, 1992, pp. 71-77.
8. R. MOTWANI, S. PHILLIPS, AND E. TORNG, Non-clairvoyant scheduling, Theoret. Comput. Sci., 130 (1994), pp. 17-47.
9. D. SLEATOR AND R. TARJAN, Amortized efficiency of list update and paging rules, Comm. ACM, 28 (1985), pp. 202-208.
10. D. SHMOYS, J. WEIN, AND D. WILLIAMSON, Scheduling parallel machines on-line, in Proceedings of the IEEE Symposium on Foundations of Computing, 1991, pp. 131-140.
11. J. VYTOPIL, ED., Formal Techniques in Real-Time and Fault-Tolerant Systems, Kluwer Academic Publishers, Norwell, MA, 1993.
12. A. YAO, Probabilistic computations: Towards a unified measure of complexity, in Proceedings of the IEEE Symposium on Foundations of Computing, 1977, pp. 222-227.