Partial Servicing of On-Line Jobs
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.
KeywordsSchedule Algorithm Competitive Ratio Critical Interval Partial Service Imprecise Computation
Unable to display preview. Download preview PDF.
- 1.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.Google Scholar
- 3.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.Google Scholar
- 5.T. Dean and M. Boddy. An analysis of time-dependent planning. In Proceedings of AAAI, pages 49–54, 1988.Google Scholar
- 6.Wu-Chen Feng. Applications and extensions of the imprecise-computation model. Technical report, University of Illinois at Urbana-Champaign, December 1996.Google Scholar
- 7.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.Google Scholar
- 8.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.Google Scholar
- 10.R. van Stee and J. A. La Poutré. On-line partial service of jobs. Technical Report SEN-R00xx, CWI, Amsterdam, in preparation.Google Scholar
- 11.A. C. Yao. Probabilistic computations: Towards a unified measure of complexity. In Proc. 12th ACM Symposium on Theory of Computing, 1980.Google Scholar
- 12.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.Google Scholar
- 13.S. Zilberstein. Constructing utility-driven real-time systems using anytime algorithms. In Proc. 1st IEEE Workshop on Imprecise and Approximate Computation, 1992.Google Scholar