Skip to main content
SpringerLink
Log in

On Speed Scaling Scheduling of Parallel Jobs with Preemption

  • Conference paper
  • First Online:
Discrete Optimization and Operations Research (DOOR 2016)

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

Abstract

Parallel jobs require more than one processor at the same time. We study speed scaling scheduling of parallel jobs with preemption. We propose “almost-exact” algorithms for problems with rigid jobs and single mode two-processor jobs. Based on configuration linear programs, our algorithms obtain an \(OPT + \varepsilon \) solution for any fixed \(\varepsilon > 0\).

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 EPUB and 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

References

  1. Albers, S., Antoniadis, A., Greiner, G.: On multi-processor speed scaling with migration: extended abstract. In: 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2011), pp. 279–288. ACM (2011)

    Google Scholar 

  2. Albers, S., Müller, F., Schmelzer, S.: Speed scaling on parallel processors. In: 19th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2007), pp. 289–298. ACM (2007)

    Google Scholar 

  3. Angel, E., Bampis, E., Kacem, F., Letsios, D.: Speed scaling on parallel processors with migration. In: Kaklamanis, C., Papatheodorou, T., Spirakis, P.G. (eds.) Euro-Par 2012. LNCS, vol. 7484, pp. 128–140. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  4. Bampis, E., Kononov, A., Letsios, D., Lucarelli, G., Sviridenko, M.: Energy efficient scheduling and routing via randomized rounding. In: FSTTCS, pp. 449–460 (2013)

    Google Scholar 

  5. Bingham, B.D., Greenstreet, M.R.: Energy optimal scheduling on multiprocessors with migration. In: International Symposium on Parallel and Distributed Processing with Applications (ISPA 2008), pp. 153–161. IEEE (2008)

    Google Scholar 

  6. Cohen-Addad, V., Li, Z., Mathieu, C., Milis, I.: Energy-efficient algorithms for non-preemptive speed-scaling. In: Bampis, E., Svensson, O. (eds.) WAOA 2014. LNCS, vol. 8952, pp. 107–118. Springer, Heidelberg (2015)

    Google Scholar 

  7. Drozdowski, M.: On complexity of multiprocessor tasks scheduling. Bull. Pol. Acad. Sci. Tech. Sci. 43(3), 381–392 (1995)

    MATH  Google Scholar 

  8. Drozdowski, M.: Scheduling for Parallel Processing, p. 386. Springer, London (2009)

    Google Scholar 

  9. Gerards, M.E.T., Hurink, J.L., Hölzenspies, P.K.F.: A survey of offline algorithms for energy minimization under deadline constraints. J. Sched. 19, 3–19 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  10. Greiner, G., Nonner, T., Souza, A.: The bell is ringing in speed-scaled multiprocessor scheduling. In: 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2009), pp. 11–18. ACM (2009)

    Google Scholar 

  11. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimizations, 2nd, p. 362. Springer, Heidelberg (1993)

    Google Scholar 

  12. Jansen, K., Porkolab, L.: Preemptive parallel task scheduling in O(n)+poly(m) time. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 398–409. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  13. Jansen, K., Porkolab, L.: Preemptive scheduling with dedicated processors: applications of fractional graph coloring. J. Sched. 7, 35–48 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  14. Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: 36th Annual Symposium on Foundation of Computer Science (FOCS 1995), pp. 374–382 (1995)

    Google Scholar 

Download references

Acknowledgements

This research is supported by the Russian Science Foundation grant 15-11-10009.

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, 4, Akad. Koptyug Avenue, 630090, Novosibirsk, Russia

    Alexander Kononov & Yulia Kovalenko

Authors
  1. Alexander Kononov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yulia Kovalenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yulia Kovalenko .

Editor information

Editors and Affiliations

  1. Sobolev Institute of Mathematics , Novosibirsk, Russia

    Yury Kochetov

  2. Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia

    Michael Khachay

  3. Sobolev Institute of Mathematics , Novosibirsk, Russia

    Vladimir Beresnev

  4. Far Eastern Federal University , Vladivostik, Russia

    Evgeni Nurminski

  5. University of Florida , Gainesville, Florida, USA

    Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Kononov, A., Kovalenko, Y. (2016). On Speed Scaling Scheduling of Parallel Jobs with Preemption. In: Kochetov, Y., Khachay, M., Beresnev, V., Nurminski, E., Pardalos, P. (eds) Discrete Optimization and Operations Research. DOOR 2016. Lecture Notes in Computer Science(), vol 9869. Springer, Cham. https://doi.org/10.1007/978-3-319-44914-2_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-44914-2_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-44913-5

  • Online ISBN: 978-3-319-44914-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation