Online Scheduling with Hard Deadlines

Journal of Algorithms

Volumn 34, Issue 2, 2000, Pages 370-389

  Goldman, Sally A ^a   Parwatikar, Jyoti ^a   Suri, Subhash ^a  

^a WASHINGTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000113798     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1060     Document Type: Article

References (13)

1. B. Awerbuch, Y. Azar, and S. Plotkin, Throughput-competitive on-line routing, in "Proceedings, 34th Ann. Symp. on Foundations of Comp. Sci.," pp. 32-41, IEEE Comput. Soc., Los Alamitos, CA, 1993.
2. B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts, Competitive routing of virtual circuits with unknown durations, in "Proceedings, 5th Ann. ACM-SIAM Symp. on Discrete Algs.," pp. 321-327, SIAM, San Francisco, CA, 1994.
3. B. Awerbuch, Y. Bartal, A. Fiat, and A. Rósen, Competitive non-preemptive call control, in "Proceedings, 5th Ann. ACM-SIAM Symp. on Discrete Algs.," pp. 312-320, SIAM, San Francisco, CA, 1994.
4. B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani, On-line admission control and circuit routing for high performance computing and communication, in "Proceedings, 35th Ann. Symp. on Foundations of Comp. Sci.," pp. 412-423, IEEE Comput. Soc., Los Alamitos, CA, 1994.
5. S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson, On the power of randomization in on-line algorithms, Algorithmica 11, No. 1 (1994), 2-14.
6. A. Borodin, N. Linial, and M. Saks, An optimal online algorithm for metrical task systems, Comm. ACM 39, No. 4 (1992), 745-763.
7. A. Feldmann, B. Maggs, J. Sgall, D. Sleator, and A. Tomkins, "Competitive Analysis of Call Admission Algorithms That Allow Delay," Technical Report CMU-CS-95-102, School of Computer Science, CMU, Pittsburgh, PA, 1995.
8. J. Garay and I. Gopal, Call preemption in communication networks, in "Proceedings, INFOCOM '92," pp. 1043-1050, IEEE Comput. Soc., Los Alamitos, CA, 1992.
9. J. Garay, I. Gopal, S. Kutten, Y. Mansour, and M. Yung, Efficient on-line call control algorithms, in "Proceedings, 2nd Israel Symp. on Theory and Computing Systems," pp. 285-293, IEE Comp. Soc., Los Alamitos, CA, 1993.
10. M. Goldwasser, Patience is a virtue: The effect of slack on competitiveness for admission control, in "Proceedings, 10th Ann. ACM-SIAM Symp. on Discrete Algs.," pp. 396-405, SIAM, Baltimore, MD, 1999.
11. A. Karlin, M. Manasse, L. Rudolpoh, and D. Sleator, Competitive snoopy caching, Algorithmica 3, No. 1 (1988), 79-119.
12. R. Lipton and A. Tomkins, Online interval scheduling, in "Proceedings, 5th Ann. ACM-SIAM Symp. on Discrete Algs.," pp. 302-311, SIAM, San Francisco, CA, 1994.
13. D. Sleator and R. Tarjan, Amortized efficiency of list update and paging rules, Comm. ACM 28, No. 2 (1985), 202-208.