Energy-Efficient Scheduling with Time and Processors Eligibility Restrictions

  • Xibo Jin
  • Fa Zhang
  • Ying Song
  • Liya Fan
  • Zhiyong Liu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8097)

Abstract

While previous work on energy-efficient algorithms focused on assumption that tasks can be assigned to any processor, we initially study the problem of task scheduling on restricted parallel processors. The objective is to minimize the overall energy consumption while speed scaling (SS) method is used to reduce energy consumption under the execution time constraint (Makespan Cmax). In this work, we discuss the speed setting in the continuous model that processors can run at arbitrary speed in [smin,smax]. The energy-efficient scheduling problem, involving task assignment and speed scaling, is inherently complicated as it is proved to be NP-Complete. We formulate the problem as an Integer Programming (IP) problem. Specifically, we devise a polynomial time optimal scheduling algorithm for the case tasks have an uniform size. Our algorithm runs in O(mn3logn) time, where m is the number of processors and n is the number of tasks. We then present a polynomial time algorithm that achieves an approximation factor of \(2^{\alpha-1}(2-\frac{1}{m^{\alpha}})\) (α is the power parameter) when the tasks have arbitrary size work.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Mudge, T.: Power: A first-class architecture design constraint. Journal of Computer 34(4), 52–58 (2001)CrossRefGoogle Scholar
  2. 2.
    Aupy, G., Benoit, A., Dufossé, F., Robert, Y.: Reclaiming the energy of a schedule: Models and algorithms. INRIA Research report RR-7598 (April 2011); Short version appeared in SPAA 2011Google Scholar
  3. 3.
    Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Proceedings of the IEEE Symposium on Foundation of Computer Science (FOCS 1995), pp. 374–382 (1995)Google Scholar
  4. 4.
    Ishihara, T., Yasuura, H.: Voltage scheduling problem for dynamically variable voltage processors. In: Proceeding of the International Symposium on Low Power Electronics and Design (ISLPED 1998), pp. 197–202 (1998)Google Scholar
  5. 5.
    Irani, S., Shukla, S., Gupta, R.: Algorithms for power savings. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2003), pp. 37–46 (2003)Google Scholar
  6. 6.
    Chen, J., Kuo, W.: Multiprocessor energy-efficient scheduling for real-time jobs with different power characteristics. In: International Conference on Parallel Processing (ICPP 2005), pp. 13–20 (2005)Google Scholar
  7. 7.
    Albers, S., Müller, F., Schmelzer, S.: Speed scaling on parallel processors. In: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2007), pp. 289–298 (2007)Google Scholar
  8. 8.
    Pruhs, K., van Stee, R., Uthaisombut, P.: Speed scaling of tasks with precedence constraints. Theory of Computing System 43(1), 67–80 (2008)MATHCrossRefGoogle Scholar
  9. 9.
    Greiner, G., Nonner, T., Souza, A.: The bell is ringing in speed-scaled multiprocessor scheduling. In: Proceedings of the 21st Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 2009), pp. 11–18 (2009)Google Scholar
  10. 10.
    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)CrossRefGoogle Scholar
  11. 11.
    Srikantaiah, S., Kansal, A., Zhao, F.: Energy aware consolidation for cloud computing. In: Proceedings of the Conference on Power Aware Computing and Systems (Hotpower 2008) (2008)Google Scholar
  12. 12.
    Gupta, A., Im, S., Krishnaswamy, R., Moseley, B., Pruhs, K.: Scheduling heterogeneous processors isn’t as easy as you think. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2012), pp. 1242–1253 (2012)Google Scholar
  13. 13.
    Leung, J., Li, L.: Scheduling with processing set restrictions: A survey. International Journal of Production Economics 116(2), 251–262 (2008)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press (2004)Google Scholar
  15. 15.
    Jin, X., Zhang, F., Song, Y., Fan, L., Liu, Z.: Energy-efficient Scheduling with Time and Processors Eligibility Restrictions. CoRR-abs/1301.4131 (2013), http://arxiv.org/abs/1301.4131
  16. 16.
    Lin, Y., Li, W.: Parallel machine scheduling of machine-dependent jobs with unit-length. European Journal of Operational Research 156(1), 261–266 (2004)MathSciNetMATHCrossRefGoogle Scholar
  17. 17.
    Alon, N., Azar, Y., Woeginger, G., Yadid, T.: Approximation schemes for scheduling. In: ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), pp. 493–500 (1997)Google Scholar
  18. 18.
    Azar, Y., Epstein, L., Richter, Y., Woeginger, G.: All-norm approximation algorithms. Journal of Algorithms 52(2), 120–133 (2004)MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    Nesterov, Y., Nemirovskii, A.: Interior-point polynomial algorithms in convex programming. SIAM Studies in Applied Mathematics. SIAM (1994)Google Scholar
  20. 20.
    Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding in bipartite graphs. In: Proceedings of the IEEE Symposium on Foundation of Computer Science (FOCS 2002), pp. 323–332 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Xibo Jin
    • 1
    • 2
  • Fa Zhang
    • 1
  • Ying Song
    • 1
  • Liya Fan
    • 3
  • Zhiyong Liu
    • 1
  1. 1.Institute of Computing TechnologyChinese Academy of SciencesBeijingChina
  2. 2.University of Chinese Academy of SciencesBeijingChina
  3. 3.IBM China Research LaboratoryBeijingChina

Personalised recommendations