Skip to main content

Scheduling on Power-Heterogeneous Processors

  • Conference paper
  • First Online:
LATIN 2016: Theoretical Informatics (LATIN 2016)

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

Included in the following conference series:

Abstract

We consider the problem of scheduling a set of jobs, each one specified by its release date, its deadline and its processing volume, on a set of heterogeneous speed-scalable processors, where the energy-consumption rate is processor-dependent. Our objective is to minimize the total energy consumption when both the preemption and the migration of jobs are allowed. We propose a new algorithm based on a compact linear programming formulation. Our method approaches the value of the optimal solution within any desired accuracy for a large set of continuous power functions. Furthermore, we develop a faster combinatorial algorithm based on flows for standard power functions and jobs whose density is lower bounded by a small constant. Finally, we extend and analyze the AVerage Rate (AVR) online algorithm in the heterogeneous setting.

S. Albers—Work supported by the German Research Foundation, projects Al 464/ 7-1 and Al 464/9-1.

E. Bampis—Research partially supported by projet GDR-RO AGaPe of CNRS.

D. Letsios—Research partially supported by ANR project Stint and ANR program “Investments for the Future”.

G. Lucarelli—Research supported by projet ANR Moebus.

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

Access this chapter

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. J. Comput. Syst. Sci. 81(7), 1194–1209 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  2. 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 

  3. Bampis, E., Kononov, A.V., Letsios, D., Lucarelli, G., Sviridenko, M.: Energy efficient scheduling and routing via randomized rounding. In: FSTTCS, vol. 24 of LIPIcs, pp. 449–460. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)

    Google Scholar 

  4. Bampis, E., Letsios, D., Lucarelli, G.: Green scheduling, flows and matchings. Theor. Comput. Sci. 579, 126–136 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bansal, N., Bunde, D.P., Chan, H.-L., Pruhs, K.: Average rate speed scaling. Algorithmica 60(4), 877–889 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bansal, N., Chan, H.-L., Pruhs, K.: Speed scaling with an arbitrary power function. ACM Trans. Algorithms 9(2), 18 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  7. Bansal, N., Kimbrel, T., Pruhs, K.: Speed scaling to manage energy and temperature. J. ACM 54(1) (2007)

    Google Scholar 

  8. Bingham, B.D., Greenstreet, M.R.: Energy optimal scheduling on multiprocessors with migration. In: ISPA, pp. 153–161 (2008)

    Google Scholar 

  9. Chen, J.-J., Hsu, H.-R., Chuang, K.-H., Yang, C.-L., Pang, A.-C., Kuo, T.-W.: Multiprocessor energy-efficient scheduling with task migration considerations. In: ECRTS, pp. 101–108. IEEE Computer Society (2004)

    Google Scholar 

  10. Federgruen, A., Groenevelt, H.: Preemptive scheduling of uniform machines by ordinary network flow techniques. Manage. Sci. 32(3), 341–349 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  11. Gonzalez, T., Sahni, S.: Open shop scheduling to minimize finish time. J. ACM 23(4), 665–679 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  12. Gonzalez, T., Sahni, S.: Preemptive scheduling of uniform processor systems. J. ACM 25, 92–101 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gupta, A., Im, S., Krishnaswamy, R., Moseley, B., Pruhs, K.: Scheduling heterogeneous processors isn’t as easy as you think. In: SODA, pp. 1242–1253 (2012)

    Google Scholar 

  14. Gupta, A., Krishnaswamy, R., Pruhs, K.: Scalably scheduling power-heterogeneous processors. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 312–323. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  15. Li, M., Yao, A.C., Yao, F.F.: Discrete and continuous min-energy schedules for variable voltage processors. PNAS 103(11), 3983–3987 (2006)

    Article  Google Scholar 

  16. Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: FOCS, pp. 374–382 (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Giorgio Lucarelli .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Albers, S., Bampis, E., Letsios, D., Lucarelli, G., Stotz, R. (2016). Scheduling on Power-Heterogeneous Processors. In: Kranakis, E., Navarro, G., Chávez, E. (eds) LATIN 2016: Theoretical Informatics. LATIN 2016. Lecture Notes in Computer Science(), vol 9644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49529-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49529-2_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49528-5

  • Online ISBN: 978-3-662-49529-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics