Abstract
We study non-preemptive, online admission control in the hard deadline model: each job must be either serviced prior to its deadline, or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be started. The goal is to maximize total resource utilization. We obtain a series of results, under varying assumptions of job lengths and delays.
Supported in part by NSF Grant CCR-9110108 and NSF National Young Investigator grant CCR-9357707 with matching funds provided by Xerox PARC and WUTA.
Research supported in part by Defense Advanced Research Projects Agency under contract DABT-63-95-C-0083.
Research supported in part by National Science Foundation Grant CCR-9501494
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch, Y. Azar, and S. Plotkin. Throughput-competitive on-line routing. In Proc. of the 34th Ann. Symp. on Foundations of Comp. Sci., pp. 32–41. IEEE, Computer Society Press, Los Alamitos, CA, 1993.
B. Awerbuch, Y. Azar, S. Plotkin, and O. Waarts. Competitive routing of virtual circuits with unknown durations. In Proc. of the 5th Ann. ACM-SIAM Symp. on Discrete Algs., pp. 321–327. SIAM, San Fransico, CA, 1994.
B. Awerbuch, Y. Bartal, A. Fiat, and A. Rósen. Competitive non-preemptive call control. In Proc. of the 5th Ann. ACM-SIAM Symp. on Discrete Algs., pp. 312–320. SIAM, San Fransico, CA, 1994.
B. Awerbuch, R. Gawlick, T. Leighton, and Y. Rabani. On-line admission control and circuit routing for high performance computing and communication. In Proc. of the 35th Ann. Symp. on Foundations of Comp. Sci., pp. 412–423. IEEE, Computer Society Press, Los Alamitos, CA, 1994.
S. Ben-David, A. Borodin, R. Karp, G. Tardos, and A. Wigderson. On the power of randomization in on-line algorithms. Algorithmica, 11(1):2–14, 1994.
A. Borodin, N. Linial, and M. Saks. An optimal online algorithm for metrical task systems. Communications of the ACM, 39(4):745–763, 1992.
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 15213, 1995.
J. Garay and I. Gopal. Call preemption in communication networks. In Proc. of INFOCOM '92, pp. 1043–1050. IEEE, Computer Society Press, Los Alamitos, CA, 1992.
J. Garay, I. Gopal, S. Kutten, Y. Mansour, and M. Yung. Efficient on-line call control algorithms. In Proc. of the 2nd Israel Symp. on Theory and Computing Systems, pp. 285–293. IEEE, Computer Society Press, Los Alamitos, CA, 1993.
A. Karlin, M. Manasse, L. Rudolpoh, and D. Sleator. Competitive snoopy caching. Algorithmica, 3(1):79–119, 1988.
R. Lipton and A. Tomkins. Online interval scheduling. In Proc. of the 5th Ann. ACM-SIAM Symp. on Discrete Algs., pp. 302–311. SIAM, San Fransico, CA, 1994.
D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Communications of the ACM, 28(2):202–208, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldman, S.A., Parwatikar, J., Suri, S. (1997). On-line scheduling with hard deadlines. In: Dehne, F., Rau-Chaplin, A., Sack, JR., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1997. Lecture Notes in Computer Science, vol 1272. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63307-3_65
Download citation
DOI: https://doi.org/10.1007/3-540-63307-3_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63307-5
Online ISBN: 978-3-540-69422-9
eBook Packages: Springer Book Archive