Partial Servicing of On-Line Jobs

  • Rob van Stee
  • Han La Poutré
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1913)


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.


Schedule Algorithm Competitive Ratio Critical Interval Partial Service Imprecise Computation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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
  2. 2.
    S.K. Baruah and M.E. Hickey. Competitive on-line scheduling of imprecise computations. IEEE Trans. On Computers, 47:1027–1032, 1998.CrossRefGoogle Scholar
  3. 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
  4. 4.
    E.K.P. Chong and W. Zhao. Performance evaluation of scheduling algorithms for imprecise computer systems. J. Systems and Software, 15:261–277, 1991.CrossRefGoogle Scholar
  5. 5.
    T. Dean and M. Boddy. An analysis of time-dependent planning. In Proceedings of AAAI, pages 49–54, 1988.Google Scholar
  6. 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. 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. 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
  9. 9.
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 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. 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. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Rob van Stee
    • 1
  • Han La Poutré
    • 1
  1. 1.Centre for Mathematics and Computer Science (CWI)AmsterdamThe Netherlands

Personalised recommendations