Advertisement

Energy Efficient Frequency Scaling and Scheduling for Malleable Tasks

  • Peter Sanders
  • Jochen Speck
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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. 4.
    Leung, J.Y.-T. (ed.): Handbook of Scheduling. CRC (2004)Google Scholar
  5. 5.
    McNaughton, R.: Scheduling with deadlines and loss functions. Management Science 6(1) (1959)Google Scholar
  6. 6.
    Sanders, P., Speck, J.: Efficient parallel scheduling of malleable tasks. In: 2011 IEEE International Parallel Distributed Processing Symposium, IPDPS (2011)Google Scholar
  7. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Peter Sanders
    • 1
  • Jochen Speck
    • 1
  1. 1.Department of InformaticsKarlsruhe Institute of TechnologyGermany

Personalised recommendations