Performance guarantee for online deadline scheduling in the presence of overload

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 755-764

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

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Algorithms; Measurement; Performance; Theory; Verification

Indexed keywords

EID: 64049107305     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. S. Baruah, Overload Tolerance for Single-Processor Workloads, Proceedings of the Fourth IEEE Real-Time Technology and Applications Symposium, p.2, June 03-05, 1998
2. S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, On-line scheduling in the presence of overload, Proceedings of the 32nd annual symposium on Foundations of computer science, p.100-110, September 1991, San Juan, Puerto Rico [doi >10.1109/SFCS.1991.185354]
3. Piotr Berman , Chris Coulston, Speed is More Powerful than Claivoyance, Proceedings of the 6th Scandinavian Workshop on Algorithm Theory, p.255-263, July 08-10, 1998
4. Allan Borodin , Ran El-Yaniv, Online computation and competitive analysis, Cambridge University Press, New York, NY, 1998
5. Mark Brehob , Eric Torng , Patchrawat Uthaisombut, Applying extra-resource analysis to load balancing, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.560-561, January 09-11, 2000, San Francisco, California, United States
6. M. L. Dertouzos. Control robotics: the procedural control off physical processes. In Proc. IFIP Congress, pages 807-813, 1974.
7. M. L. Dertouzos, A. K. Mok, Multiprocessor Online Scheduling of Hard-Real-Time Tasks, IEEE Transactions on Software Engineering, v.15 n.12, p.1497-1506, December 1989 [doi>10.1109/32.58762]
8. Jeff Edmonds, Scheduling in the dark, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p. 179-188, May 01-04, 1999, Atlanta, Georgia, United States [doi>10.1145/301250.301299]
9. B. Kalyanasundaram , Kirk Pruhs, Speed is as powerful as clairvoyance [scheduling problems], Proceedings of the 36th Annual Symposium on Foundations of Computer Science (FOCS'95), p.214. October 23-25, 1995
10. Gilad Koren , Dennis Shasha, Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems, SIAM Journal on Computing, v.24 n.2, p.318-339, April 1995 [doi > 10.1137/S0097539792236882]
11. G. Koren, D. Shasha, and S. C. Huang. MOCA: A multiprocessor on-line competitive algorithm for real-time system scheduling. In Proc. 14th Real- Time Systems Symposium, pages 172-181, 1993.
12. Tak Wah Lam , Kar Keung To, Trade-offs between speed and processor in hard-deadline scheduling, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.623-632, January 17-19, 1999, Baltimore, Maryland, United States
13. T. W. Ngan. Private communication.
14. Cynthia A. Phillips , Cliff Stein , Eric Torng , Joel Wein, Optimal time-critical scheduling via resource augmentation (extended abstract), Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.140-149, May 04-06, 1997 El Paso, Texas, United States [doi > 1145/258533.258570]
15. John A. Stankovic , Krithi Ramamritham , Marco Spuri, Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms, Kluwer Academic Publishers, Norwell, MA, 1998