Competitive deadline scheduling via additional or faster processors

Journal of Scheduling

Volumn 6, Issue 2, 2003, Pages 213-223

  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

Competitiveness; Deadline scheduling; Extra resource analysis; On line algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; ONLINE SYSTEMS; PARAMETER ESTIMATION; PROGRAM PROCESSORS; SCHEDULING;

COMPETITIVENESS; DEADLINE SCHEDULING; EXTRA-RESOURCE ANALYSIS; ON-LINE ALGORITHMS;

COMPUTER SCIENCE;

EID: 0042639686     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022998111685     Document Type: Article

References (18)

1. Baruah, S., "Overload tolerance for single-processor workloads," in IEEE Symp. on Real Time Technology and Application, 1998, pp. 2-11.
2. Baruah, S., 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," J. Real-Time Syst., 4, 124-144 (1992).
3. Baruah, S., G. Koren, B. Mishra, A. Raghunathan, L. Rosier and D. Shasha, "On-line scheduling in the presence of overload," in Proc. IEEE 32nd Annu. Symp. on Foundations of Computer Science, San Juan, Puerto Rico, 1991, pp. 101-110.
4. Berman, P. and C. Coulston, "Speed is more powerful than clairvoyance," in Proc. 6th Scand. Workshop on Algorithm Theory, Stockholm, Sweden, 8-10 July, 1998, pp. 255-263.
5. Borodin, A. and R. El-Yaniv, Online Computation and Competitive Analysis. Cambridge University Press, Cambridge, United Kingdom, 1998.
6. Brehob, M., E. Torng, and P. Uthaisombut, "Applying extra-resource analysis to load balancing," in Proc. 11th Annu. ACM-SIAM Symp. on Discrete Algorithms, San Francisco, California 2000, pp. 560-561.
7. Dertouzos, M. L., "Control robotics: the procedural control of physical processes," in Proc. IFIP Congress, 1974, pp. 807-813.
8. Edmonds, J., in "Scheduling in the dark,", in Proc. 31st Annu. ACM Symp. on Theory of Computing, 1999, pp. 179-188.
9. Kalyanasundaram, B. and K. R. Pruhs, "Maximizing job completions online," in Proc. 6th Eur. Symp. on Algorithms, 1998, pp. 235-246.
10. Kalyanasundaram, B. and K. R. Pruhs, "Speed is as powerful as clairvoyance," J. ACM, 47(4), 617-643 (2000).
11. Koren, G., "Competitive on-line scheduling for overloaded real-time systems," Department of Computer Science, New York University, 1993.
12. Koren, G. and D. Shasha, "MOCA: A multiprocessor on-line competitive algorithm real-time system scheduling," Theoretical Comput. Sci., 128, 75-97 (1994).
13. over: An optimal on-line scheduling algorithm for overloaded uniprocessor real-time systems," SIAM J. Computing 24, 318-339 (1994).
14. Lam, T. W. and K. K. To, "Trade-offs between speed and processor in hard-deadline scheduling," in Proc. 10th Annu. ACM-SIAM Symp. on Discrete Algorithms, 1999, pp. 623-632.
15. Lam, T. W. and K. K. To, "Performance guarantee for online deadline scheduling in the presence of overload," in Proc. 10th Annu. ACM-SIAM Symp. on Discrete Algorithms, 2001, pp. 755-764.
16. Cynthia A. P., C. Stein, E. Torng, and J. Wein, "Optimal time-critical scheduling via resource augmentation," in Proc. 29th Annu. ACM Symp. on Theory of Computing, El Paso, Texas, 1997, pp. 140-149.
17. Sgall, J., "On-line scheduling - a survey," in A. Fiat and G. Woeginger (eds), On-line Algorithms: The State of the Art, Lecture Notes in Computer Science, Springer and Verlag, 1998, pp. 196-231.
18. Stankovic, J., M. Spuri, K. Ramamritham, and G. Buttazzo, Deadline Scheduling for Real-time Systems EDF and Related Algorithms, Kluwer Academic Publishers Boston, MS, 1998.