Preemptive scheduling in overloaded systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 800-811

  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

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; SCHEDULING;

LOWER AND UPPER BOUNDS; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS; OVERLOADED SYSTEMS; PRE-EMPTIVE SCHEDULING; RESOURCE AUGMENTATION; SCHEDULING PROBLEM; THE STANDARD MODEL;

PROFITABILITY;

EID: 84869181134     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_68     Document Type: Conference Paper

References (9)

1. Sanjoy Baruah, Gilad Koren, Decao Mao, Bud Mishra, Arvind Raghunathan, Louis Rosier, Dennis Shasha, and Fuxing Wang. On the competitiveness of on-line realtime task scheduling. Real-Time Systems, 4:125-144, 1992.
2. Allan Borodin and Ran El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
3. Ee-Chien Chang and Chee Yap. Competitive online scheduling with level of service. In Proc. 7th Annual International Computing and Combinatorics Conference, volume 2108 of Lecture Notes in Computer Science, pages 453-462. Springer, 2001.
4. Bala Kalyanasundaram and Kirk Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47(4):214-221, 2000.
5. Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Ngan, and Kar-Keung To. On-line scheduling with tight deadlines. In Proc. 26th Symp. on Mathematical Foundations of Computer Science, volume 2136 of Lecture Notes in Computer Science, pages 464-473, 2001.
6. over: an optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM Journal on Computing, 24:318-339, 1995.
7. Tak-WahLam, Tsuen-Wan Ngan, and Ker-Keung To. On the speed requirement for optimal deadline scheduling in overloaded systems. In Proc. 15th International Parallel and Distributed Processing Symposium, page 202, 2001.
8. Tak-WahLam and Ker-Keung To. Trade-offs between speed and processor in harddeadline scheduling. In Proc. 10th Symp. on Discrete Algorithms, pages 755-764, 1999.
9. Jiří Sgall. Online scheduling. In Online Algorithms: The State of Art, pages 196-227. Springer-Verlag, 1998.