Abstract
We consider the problem of scheduling jobs online, where jobs may be served partially in order to optimize the overall use of the machines. Service requests arrive online to be executed immediately; the scheduler must decide how long and if it will run a job (that is, it must fix the Quality of Service level of the job) at the time of arrival of the job: preemption is not allowed. We give lower bounds on the competitive ratio and present algorithms for jobs with varying sizes and for jobs with uniform size, and for jobs that can be run for an arbitrary time or only for some fixed fraction of their full execution time.
Supported by SION/NWO, project number 612-30-002.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Aggarwal, J.A. Garay, and A. Herzberg. Adaptive video on demand. In Proc. 3rd Annual European Symp. on Algorithms, LNCS, pages 538–553. Springer, 1995.
S.K. Baruah and M.E. Hickey. Competitive on-line scheduling of imprecise computations. IEEE Trans. On Computers, 47:1027–1032, 1998.
H. G. P. Bosch, N. Nes, and M. L. Kersten. Navigating through a forest of quad trees to spot images in a database. Technical Report INS-R0007, CWI, Amsterdam, February 2000.
E.K.P. Chong and W. Zhao. Performance evaluation of scheduling algorithms for imprecise computer systems. J. Systems and Software, 15:261–277, 1991.
T. Dean and M. Boddy. An analysis of time-dependent planning. In Proceedings of AAAI, pages 49–54, 1988.
Wu-Chen Feng. Applications and extensions of the imprecise-computation model. Technical report, University of Illinois at Urbana-Champaign, December 1996.
K.J. Lin, S. Natarajan, and J.W.S. Liu. Imprecise results: Utilizing partial computations in real-time systems. In Proc. IEEE Real-Time Systems Symp., pages 255–263, 1998.
W.-K. Shih. Scheduling in real-time systems to ensure graceful degradation: the imprecise-computation and the deferred-deadline approaches. Technical report, University of Illinois at Urbana-Champaign, December 1992.
W.-K. Shih and J.W.S. Liu. On-line scheduling of imprecise computations to minimize error. SIAM J. on Computing, 25:1105–1121, 1996.
R. van Stee and J. A. La Poutré. On-line partial service of jobs. Technical Report SEN-R00xx, CWI, Amsterdam, in preparation.
A. C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. 12th ACM Symposium on Theory of Computing, 1980.
W. Zhao, S. Vrbsky, and J.W.S. Liu. Performance of scheduling algorithms for multi-server imprecise systems. In Proc. Fifth Int. Conf. Parallel and Distributed Computing and Systems, 1992.
S. Zilberstein. Constructing utility-driven real-time systems using anytime algorithms. In Proc. 1st IEEE Workshop on Imprecise and Approximate Computation, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
van Stee, R., La Poutré, H. (2000). Partial Servicing of On-Line Jobs. In: Jansen, K., Khuller, S. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2000. Lecture Notes in Computer Science, vol 1913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44436-X_25
Download citation
DOI: https://doi.org/10.1007/3-540-44436-X_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67996-7
Online ISBN: 978-3-540-44436-7
eBook Packages: Springer Book Archive