Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

European Conference on Parallel Processing

Euro-Par 2012: Euro-Par 2012 Parallel Processing pp 167–178Cite as

  1. Home
  2. Euro-Par 2012 Parallel Processing
  3. Conference paper
Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks

Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks

  • Peter Sanders19 &
  • Jochen Speck19 
  • Conference paper
  • 3014 Accesses

  • 13 Citations

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

Abstract

We give an efficient algorithm for solving the following scheduling problem to optimality: Assign n jobs to m processors such that they all meet a common deadline T and energy consumption is minimized by appropriately controlling the clock frequencies of the processors. Jobs are malleable, i.e., their amount of parallelism can be flexibly adapted. In contrast to previous work on energy efficient scheduling we allow more realistic energy consumption functions including a minimum and maximum clock frequency and a linear term in energy consumption. We need certain assumptions on the speedup function of the jobs that we show to apply for a large class of practically occurring functions.

Keywords

  • Schedule Problem
  • Energy Function
  • Energy Usage
  • Frequency Scaling
  • Bend Point

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

References

  1. Blazewicz, J., Kovalyov, M.Y., Machowiak, M., Trystram, D., Weglarz, J.: Preemptable malleable task scheduling problem. IEEE Transactions on Computers 55 (2006)

    Google Scholar 

  2. Blazewicz, J., Machowiak, M., Weglarz, J., Kovalyov, M.Y., Trystram, D.: Scheduling malleable tasks on parallel processors to minimize the makespan: Models and algorithms for planning and scheduling problems. Annals of Operations Research 129 (2004)

    Google Scholar 

  3. Chen, J.-J., Kuo, T.-W.: Multiprocessor energy-efficient scheduling for real-time tasks with different power characteristics. In: International Conference on Parallel Processing, ICPP 2005 (2005)

    Google Scholar 

  4. Leung, J.Y.-T. (ed.): Handbook of Scheduling. CRC (2004)

    Google Scholar 

  5. McNaughton, R.: Scheduling with deadlines and loss functions. Management Science 6(1) (1959)

    Google Scholar 

  6. Sanders, P., Speck, J.: Efficient parallel scheduling of malleable tasks. In: 2011 IEEE International Parallel Distributed Processing Symposium, IPDPS (2011)

    Google Scholar 

  7. Yang, C.-Y., Chen, J.-J., Kuo, T.-W.: An approximation algorithm for energy-efficient scheduling on a chip multiprocessor. In: Proceedings of the Conference on Design, Automation and Test in Europe, DATE 2005, vol. 1 (2005)

    Google Scholar 

  8. Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced cpu energy. In: Annual Symposium on Foundations of Computer Science, pp. 374–382. IEEE Computer Society (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Karlsruhe Institute of Technology, Germany

    Peter Sanders & Jochen Speck

Authors
  1. Peter Sanders
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jochen Speck
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Patras, Computer Technology Institute and Press “Diophantus”,, N. Kazantzaki, 26504, Rio, Greece

    Christos Kaklamanis

  2. University of Patras, University Building B, 26504, Rio, Greece

    Theodore Papatheodorou

  3. Computer Technology Institute and Press “Diophantus”, University of Patras, N. Kazantzaki, 26504, Rio, Greece

    Paul G. Spirakis

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sanders, P., Speck, J. (2012). Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks. In: Kaklamanis, C., Papatheodorou, T., Spirakis, P.G. (eds) Euro-Par 2012 Parallel Processing. Euro-Par 2012. Lecture Notes in Computer Science, vol 7484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32820-6_18

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-32820-6_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32819-0

  • Online ISBN: 978-3-642-32820-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature