On-line scheduling with tight deadlines

Theoretical Computer Science

Volumn 295, Issue 1-3, 2003, Pages 251-261

  Koo, Chiu Yuen ^a   Lam, Tak Wah ^b   Ngan, Tsuen Wan ^b   Sadakane, Kunihiko ^c   To, Kar Keung ^b  

^a University of Maryland   (United States)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c TOHOKU UNIVERSITY   (Japan)

Author keywords

Competitive analysis; Deadline scheduling; On line algorithms

Indexed keywords

ALGORITHMS; MULTIPROCESSING SYSTEMS; ONLINE SYSTEMS; PROBLEM SOLVING;

ON-LINE SCHEDULING;

REAL TIME SYSTEMS;

EID: 0037463530     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00407-3     Document Type: Conference Paper

References (16)

1. Baruah S., Koren G., Mao D., Mishra B., Raghunathan A., Rosier L., Shasha D., Wang F. On the competitiveness of on-line task real-time task scheduling. J. Real-Time Systems. 4(2):1992;124-144.
2. S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, On-line scheduling in the presence of overload, in: Proc. IEEE 32nd Ann. Symp. on the Foundations of Computer Science, 1991, pp. 101-110.
3. P. Berman, C. Coulston, Speed is more powerful than clairvoyance, in: Proc. Sixth Scandinavian Workshop on Algorithm Theory, 1998, pp. 255-263.
4. M. Brehob, E. Torng, P. Uthaisombut, Applying extra-resource analysis to load balancing. in: Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms, 2000, pp. 560-561.
5. B. DasGupta, M.A. Palis, Online real-time preemptive scheduling of jobs with deadlines. in: Proc. Third Internat. Workshop on Approximation Algorithms for Combinatorial Optimization, 2000, pp. 96-107.
6. Dertouzos M.L., Mok A.K.L. Multiprocessor on-line scheduling of hard-real-time tasks. IEEE Trans. Software Eng. 15(12):1989;1497-1506.
7. J. Edmonds, Scheduling in the dark. in: Proc. 31st Ann. ACM Symp. on Theory of Computing, 1999, pp. 179-188.
8. Bala Kalyanasundaram, Kirk Pruhs, Maximizing job completions online, in: Proc. Sixth European Symp. on Algorithms, 1998, pp. 235-246.
9. Kalyanasundaram B., Pruhs K. Speed is as powerful as clairvoyance. J. ACM. 47(4):2000;617-643.
10. over an optimal on-line scheduling algorithm for overloaded real-time systems SIAM J. Comput. 24(2):1995;318-339.
11. T.W. Lam, T.W. Ngan, K.K. To, On the speed requirement for optimal deadline scheduling in overloaded systems, in: Proc. 15th Internat. Parallel and Distributed Processing Symp., 2001, pp. 2165-2172.
12. T.W. Lam, K.K. To, Trade-offs between speed and processor in hard-deadline scheduling, in: Proc. 10th Ann. ACM-SIAM Symp. on Discrete Algorithms, 1999, pp. 623-632.
13. T.W. Lam, K.K. To, Performance guarantee for online deadline scheduling in the presence of overload, in: Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms, 2001, pp. 755-764.
14. C.A. Phillips, C. Stein, E. Torng, J. Wein, Optimal time-critical scheduling via resource augmentation, in: Proc. 29th Ann. ACM Symp. on Theory of Computing, 1997, pp. 140-149.
15. Sgall J. On-line scheduling - a survey. Fiat A., Woeginger G. On-line Algorithms: The State of the Art. Lecture Notes in Computer Science. 1998;196-231 Springer, Berlin.
16. Stankovic J., Spuri M., Ramamritham K., Buttazzo G. Deadline Scheduling for Real-Time Systems: EDF and Related Algorithms. 1998;Kluwer Academic Publishers, Boston, MA.