Skip to main content
SpringerLink
Log in

The maximum gain of increasing the number of preemptions in multiprocessor scheduling

  • Original Article
  • Published:
Acta Informatica Aims and scope Submit manuscript

Abstract

We consider the optimal makespan C(P, m, i) of an arbitrary set P of independent jobs scheduled with i preemptions on a multiprocessor with m identical processors. We compare the ratio for such makespans for i and j preemptions, respectively, where i < j. This ratio depends on P, but we are interested in the P that maximizes this ratio, i.e. we calculate a formula for the worst case ratio G(m, i, j) defined as \({G(m,i,j)=\max \frac{C(P,m,i)}{C(P,m,j)},}\) where the maximum is taken over all sets P of independent jobs.

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

  1. Braun O., Schmidt G.: Parallel processor scheduling with limited number of preemptions. SIAM J. Comput. 32(3), 671–680 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  2. Coffman E.G., Garey M.R.: Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling. J. ACM 40(5), 991–1018 (1993) ISSN:0004-5411

    Article  MATH  MathSciNet  Google Scholar 

  3. Graham R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416–429 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  4. Graham, R.L., Knuth, D., Patashnik, O.: Concrete Mathematics. Addison-Wesley, Reading (1994). ISBN 0-201-14236-8

  5. Lennerstad, H., Lundberg, L.: Optimal Scheduling Combinatorics. Electronic Notes in Discrete Mathematics, vol. 14. Elsevier, Amsterdam (2003)

  6. Lennerstad, H., Lundberg, L.: Generalizations of the floor an ceiling functions by the Stern–Brocot tree, Technical report, Blekinge Institute of Technology (2006)

  7. Liu, C.L.: Optimal scheduling on multiprocessor computing systems. In: Proceedings of the 13th Annual Symposium on Switching and Automata Theory, pp. 155–160. IEEE Computer Society, Los Alamitos (1972)

  8. McNaughton R.: Scheduling with deadlines and loss functions. Manag. Sci. 6, 1–12 (1959)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Engineering, Blekinge Institute of Technology, Karlskrona, Sweden

    Kamilla Klonowska, Lars Lundberg & Håkan Lennerstad

Authors
  1. Kamilla Klonowska
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lars Lundberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Håkan Lennerstad
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lars Lundberg.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Klonowska, K., Lundberg, L. & Lennerstad, H. The maximum gain of increasing the number of preemptions in multiprocessor scheduling. Acta Informatica 46, 285–295 (2009). https://doi.org/10.1007/s00236-009-0096-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00236-009-0096-5

Keywords

Search

Navigation