Skip to main content
SpringerLink
Log in

Competitive On-Line Scheduling with Level of Service

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

Motivated by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus, our problem embodies a notion of “Level of Service” that is increasingly important in multimedia applications. We give two schedulers \(FirstFit\) and \(EndFit\) based on two simple heuristics, and generalize them into a class of greedy schedulers. We show that both \(FirstFit\) and \(EndFit\) are 2-competitive, and any greedy scheduler is 3-competitive. These bounds are shown to be tight.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  • Albers, S., “Competitive online algorithms,” BRICS Lecture Series LS-96-2, BRICS, Department of Computer Science, University of Aarhus, September 1996.

  • Albers, S. and J. Westbrook, “A survey of self-organizing data structures,” Research Report MPI-I-96-1-026, Max-Planck-Institut für InformatikIm Stadtwald, D-66123, Saarbrücken, Germany, October 1996.

  • Arkin, E., Private communication (1997).

  • Chang, E.-C., C. Yap, and T.-J. Yen, “Realtime visualization of large images over a thinwire,” in IEEE Visualization '97 (Late Breaking Hot Topics), 1997, pp. 45-48. See CD proceedings of conference. Paper from ftp://cs.nyu.edu/pub/local/yap/visual/thinwire.ps.gz.

  • Chang, E.-C., Foveation Techniques and Scheduling Issues in Thinwire Visualization, Ph.D thesis Department of Computer Science, New York University, May 1998.

  • Hoogeveen, J. A. and A. P. A. Vestjens, “Optimal on-line algorithms for single-machine scheduling,” Integer Programming and Combinatorial Optimization, 1996, pp. 404-414.

  • Lipton, R. J. and A. Tomkins, “Online interval scheduling,” in Proc. 5th Annu. ACM-SIAM Symp. on Discrete Algorithms., 1994, pp. 302-311.

  • Manasse, M., L. A. McGeoch, and D. Sleator, “Competitive algorithms for server problems,” in Proc. 20th Ann. ACM Symp. on Theory of Computing, 1988, pp. 322-333.

  • McGeoch, L.A. and D.D. Sleator (eds.), On-Line Algorithms, DIMACS series in Discrete Mathematics and Theoretical Computer Science, Vol. 7. American Mathematical Society, 1992.

  • Sleator, D. and R. Tarjan, “Amortized efficiency of list update and paging rules,” Comm. ACM, 28(2), 202-208 (1985).

    Google Scholar 

  • Woeginger, G.J., “On-line scheduling of jobs with fixed start and end times,” Theor. Comput. Sci., 130, 5-16 (1994).

    Google Scholar 

  • Yao, F., A. Demers, and S. Shenker, “A scheduling model for reduced CPU energy,” in Proc. 36th Ann. Symp. on Foundations Comput. Sci., 1995, pp. 374-382.

Download references

Author information

Authors and Affiliations

  1. Department of Computational Science, National University of Singapore, Singapore

    Ee-Chien Chang

  2. Department of Computer Science, Courant Institute, New York University, USA

    Chee Yap

Authors
  1. Ee-Chien Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chee Yap
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chang, EC., Yap, C. Competitive On-Line Scheduling with Level of Service. Journal of Scheduling 6, 251–267 (2003). https://doi.org/10.1023/A:1022904408360

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022904408360

Search

Navigation