On-Line scheduling with tight deadlines

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

Volumn 2136, Issue , 2001, Pages 464-473

  Koo, Chiu Yuen ^a   Lam, Tak Wah ^a   Ngan, Tsuen Wan ^a   To, Kar Keung ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

COMPETITIVE RATIO; IMPORTANCE RATIOS; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS; ON-LINE SCHEDULERS; ONLINE PROBLEMS; ONLINE SCHEDULING; SINGLE PROCESSOR SYSTEMS;

SCHEDULING ALGORITHMS;

EID: 84974661420     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_41     Document Type: Conference Paper

References (13)

1. S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang. On the competitiveness of on-line task real-time task scheduling. Journal of Real-Time Systems, 4(2):124-144, 1992.
2. S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, and D. Shasha. On-line scheduling in the presence of overload. In Proceedings of the IEEE Thirtysecond Annual Symposium on the Foundations of Computer Science, pages 101-110, San Juan, Porto Rico, October 1991.
3. P. Berman and C. Coulston. Speed is more powerful than clairvoyance. In Proceedings of the Sixth Scandinavian Workshop on Algorithm Theory, pages 255-263, July 1998.
4. Bhaskar DasGupta and Michael A. Palis. Online real-time preemptive scheduling of jobs with deadlines. In Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization, volume 1913 of Lecture Notes in Computer Science, pages 96-107. Springer, September 2000.
5. Michael L. Dertouzos and Aloysius Ka-Lau Mok. Multiprocessor on-line scheduling of hard-real-time tasks. IEEE Transactions on Software Engineering, 15(12):1497-1506, December 1989.
6. Jeff Edmonds. Scheduling in the dark. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 179-188, 1999.
7. Bala Kalyanasundaram and Kirk Pruhs. Maximizing job completions online. In Proceedings of the Sixth European Symposium on Algorithms, pages 235-246, 1998.
8. Bala Kalyanasundaram and Kirk Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47(4):617-643, July 2000.
9. Gilad Koren and Dennis Shasha. Dover: An optimal on-line scheduling algorithm for overloaded real-time systems. SIAM Journal of Computing, 24(2):318-339, April 1995.
10. Tak-Wah Lam, Tsuen-Wan Ngan, and Kar-Keung To. On the speed requirement for optimal deadline scheduling in overloaded systems. In Proceedings of the Fifteenth International Parallel and Distributed Processing Symposium, page 202, 2001.
11. Tak-Wah Lam and Kar-Keung To. Trade-offs between speed and processor in harddeadline scheduling. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 623-632, 1999.
12. Tak-Wah Lam and Kar-Keung To. Performance guarantee for online deadline scheduling in the presence of overload. In Proceedings of the Twelfth Annual ACMSIAM Symposium on Discrete Algorithms, pages 755-764, 2001.
13. Cynthia A. Phillips, Cliff Stein, Eric Torng, and Joel Wein. Optimal time-critical scheduling via resource augmentation. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pages 140-149, 1997.