Skip to main content
SpringerLink
Log in

Online Scheduling of Bounded Length Jobs to Maximize Throughput

  • Conference paper
Approximation and Online Algorithms (WAOA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5893))

Included in the following conference series:

Abstract

We consider an online scheduling problem, motivated by the issues present at the joints of networks using ATM and TCP/IP. Namely, IP packets have to broken down to small ATM cells and sent out before their deadlines, but cells corresponding to different packets can be interwoven. More formally, we consider the online scheduling problem with preemptions, where each job j is revealed at release time r j , has processing time p j , deadline d j and weight w j . A preempted job can be resumed at any time. The goal is to maximize the total weight of all jobs completed on time. Our main results are as follows: we prove that if all jobs have processing time exactly k, the deterministic competitive ratio is between 2.598 and 5, and when the processing times are at most k, the deterministic competitive ratio is Θ(k/logk).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baptiste, P.: An O(n 4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Oper. Res. Lett. 24(4), 175–180 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baptiste, P., Chrobak, M., Dürr, C., Jawor, W., Vakhania, N.: Preemptive scheduling of equal-length jobs to maximize weighted throughput. Operations Research Letters 32(3), 258–264 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  3. Baruah, S.K., Haritsa, J., Sharma, N.: On-line scheduling to maximize task completions. In: Real-Time Systems Symposium, December 1994, pp. 228–236 (1994)

    Google Scholar 

  4. Canetti, R., Irani, S.: Bounding the power of preemption in randomized scheduling. SIAM J. Comput. 27(4), 993–1015 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chan, W.-T., Lam, T.W., Ting, H.-F., Wong, P.W.H.: New results on on-demand broadcasting with deadline via job scheduling with cancellation. In: Proc. 10th International on Computing and Combinatorics Conference, pp. 210–218 (2004)

    Google Scholar 

  6. Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: Complexity, algorithms and approximability. In: Handbook of Combinatorial Optimization, vol. 3, pp. 21–169. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  7. Chrobak, M., Jawor, W., Sgall, J., Tichý, T.: Online scheduling of equal-length jobs: Randomization and restarts help. SIAM J. Comput. 36(6), 1709–1728 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  8. Englert, M., Westermann, M.: Considering suppressed packets improves buer management in QoS switches. In: Proc. 18th Symp. on Discrete Algorithms (SODA), pp. 209–218. ACM/SIAM (2007)

    Google Scholar 

  9. Hajek, B.: On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In: Proceedings of Conference on Information Sciences and Systems (CISS), pp. 434–438 (2001)

    Google Scholar 

  10. Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. Journal of the ACM 47(4), 617–643 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  11. Kalyanasundaram, B., Pruhs, K.: Maximizing job completions online. Journal of Algorithms 49(1), 63–85 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  12. Lawler, E.L.: Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the “tower of sets” property. Mathl. Comput. Modelling 20(2), 91–106 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  13. Ting, H.-F.: A near optimal scheduler for on-demand data broadcasts. Theoretical Computer Science 401(1-3), 77–84 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  14. Vakhania, N.: A fast on-line algorithm for the preemptive scheduling of equal-length jobs on a single processor. In: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications, pp. 158–161 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS, LIX UMR 7161, Ecole Polytechnique, 91128, Palaiseau, France

    Christoph Dürr & Kim Thang Nguyen

  2. Institute of Computer Science, University of Wrocław, 50-383, Wrocław, Poland

    Łukasz Jeż

Authors
  1. Christoph Dürr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Łukasz Jeż
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kim Thang Nguyen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IBISC, CNRS FRE 3190, Université d’Evry Val d’Essonne, Place des Terasses, Tour Evry 2, 91000, Evry Cedex, France

    Evripidis Bampis

  2. Institute for Computer Science and Applied Mathematics, University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dürr, C., Jeż, Ł., Nguyen, K.T. (2010). Online Scheduling of Bounded Length Jobs to Maximize Throughput. In: Bampis, E., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2009. Lecture Notes in Computer Science, vol 5893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12450-1_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12450-1_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12449-5

  • Online ISBN: 978-3-642-12450-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation