On the speed requirement for optimal deadline scheduling in overloaded systems

Proceedings - 15th International Parallel and Distributed Processing Symposium, IPDPS 2001

Volumn , Issue , 2001, Pages 2173-2177

  Lam, Tak Wah ^a   Ngan, T ^a   To, Kar Keung ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PARALLEL PROCESSING SYSTEMS; SCHEDULING;

DEADLINE SCHEDULING; EARLIEST DEADLINE FIRST; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS; ON-LINE SCHEDULERS; OVERLOADED SYSTEMS; SINGLE PROCESSOR SYSTEMS; SPEED REQUIREMENT;

RESPONSE TIME (COMPUTER SYSTEMS);

EID: 84981276142     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2001.925218     Document Type: Conference Paper

References (14)

1. S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wang. On the competitiveness of on-line real-time task scheduling. Journal of Real-Time Systems, 4: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 32nd Annual Symposium on Foundations of Computer Science, pages 101-110, San Juan, Puerto Rico, 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, Stockholm, Sweden, 8-10 July 1998.
4. Peter Brucker. Scheduling Algorithms. Springer-Verlag, 1995.
5. Michael L. Dertouzos. Control robotics: the procedural control of physical processes. In Proceedings of IFIP Congress, pages 807-813, 1974.
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 R. Pruhs. Maximizing job completions online. In Proceedings of the Sixth European Symposium on Algorithms, pages 235-246, 1998.
8. Bala Kalyanasundaram and Kirk R. Pruhs. Speed is as powerful as clairvoyance. Journal of the ACM, 47(4):617-643, 2000.
9. over: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems. SIAM Journal on Computing, 24(2):318-339, April 1995.
10. T.W. Lam and K.K. To. Trade-offs between speed and processor in hard-deadline scheduling. In Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 623-632, 1999.
11. T.W. Lam and K.K. To. Performance guarantee for online deadline scheduling in the presence of overload. In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, 2001. To appear.
12. 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.
13. John Stankovic, Marco Spuri, Krithi Ramamritham, and Giorgio Buttazzo. Deadline scheduling for real-time systems: EDF and related algorithms. Kluwer Academic Publishers, Boston, Mass., 1998.
14. G. Woeginer. On-line scheduling of jobs with fixed start and end time. Theoretical Computer Science, 130:5-16, 1994.