Preemptive scheduling in overloaded systems

Journal of Computer and System Sciences

Volumn 67, Issue 1, 2003, Pages 183-197

  Chrobak, Marek ^a   Epstein, Leah ^b   Noga, John ^c   Sgall, Jiří ^d   Van Stee, Rob ^e   Tichý, Tomáš ^d   Vakhania, Nodari ^f  

^a University of California Riverside   (United States)

^b INTERDISCIPLINARY CENTER   (Israel)

^c CALIFORNIA STATE UNIVERSITY   (United States)

^d MATHEMATICAL INSTITUTE   (Czech Republic)

^e UNIVERSITY OF FREIBURG   (Germany)

^f UNIVERSIDAD AUTÓNOMA DEL ESTADO DE MORELOS   (Mexico)

Author keywords

Deadline; Online algorithms; Resource augmentation; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROGRAM PROCESSORS; SCHEDULING; SYSTEMS SCIENCE;

PREEMPTIVE SCHEDULING;

COMPUTER SCIENCE;

EID: 0043021898     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00070-9     Document Type: Article

References (13)

1. S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, F. Wang, On the competitiveness of on-line real-time task scheduling, Real-Time Systems 4 (1992) 125-144.
2. A. Borodin, R. El-Yaniv, Online computation and competitive analysis, Cambridge University Press, Cambridge, 1998.
3. Ee-Chien Chang, Chee Yap, Competitive online scheduling with level of service, in: J. Wang (Ed.), Proceedings of the Seventh Annual International Computing and Combinatorics Conference, Lecture Notes in Computer Science, Vol. 2108, Springer, Berlin, 2001, pp. 453-462. To appear in J. of Scheduling.
4. F.Y.L. Chin, S.P.Y. Fung, On-line scheduling with partial job values: does timesharing or randomization help? (2002) Algorithmica [Manuscript], to appear.
5. M. Chrobak, L. Epstein, J. Noga, J. Sgall, R. van Stee, T. Tichý, N. Vakhania, Preemptive scheduling in overloaded systems, in: P. Widmayer, F. Trignero, R. Morales, M. Hennessy, S. Eidenbenz, R. Conejo (Eds.), Proceedings of the 28th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 2380, Springer, Berlin, 2002, pp. 800-811.
6. B. Kalyanasundaram, K. Pruhs, Speed is as powerful as clairvoyance, J. Assoc. Comput. Mach. 47 (4) (2000) 214-221.
7. H. Karloff, Linear Programming, Birkhäuser, Boston, 1991.
8. Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Ngan, Kar-Keung To, On-line scheduling with tight deadlines, J. of Scheduling 6 (2003) 213-223.
9. over: an optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems, SIAM J. Comput. 24 (1995) 318-339.
10. Tak-Wah Lam, Tsuen-Wan Ngan, Ker-Keung To, On the speed requirement for optimal deadline scheduling in overloaded systems, in: Proceedings of the 15th International Parallel and Distributed Processing Symposium, IEEE, San Francisco, CA, 2001, p. 202.
11. Tak-Wah Lam, Ker-Keung To, Trade-offs between speed and processor in hard-deadline scheduling, in: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, ACM/SIAM, 1999, pp. 755-764.
12. C. Roos, T. Terlaky, J.-Ph. Vial, Theory and Algorithms for Linear Optimization: An Interior Point Approach, Wiley, Chichester, 1997.
13. J. Sgall, Online scheduling, in: A. Fiat, G.J. Woeginger (Eds.), Online Algorithms: The State of Art, Lecture Notes in Computer Science, Vol. 1442, Springer, Berlin, 1998, pp. 196-227.