Skip to main content
SpringerLink
Log in

Min-Energy Scheduling for Aligned Jobs in Accelerate Model

  • Conference paper
Book cover Algorithms and Computation (ISAAC 2009)

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

Included in the following conference series:

Abstract

Dynamic voltage scaling technique provides the capability for processors to adjust the speed and control the energy consumption. We study the pessimistic accelerate model where the acceleration rate of the processor speed is at most K and jobs cannot be executed during the speed transition period. The objective is to find a min-energy (optimal) schedule that finishes every job within its deadline. The job set we study in this paper is aligned jobs where earlier released jobs have earlier deadlines. We start by investigating a special case where all jobs have common arrival time and design an O(n 2) algorithm to compute the optimal schedule based on some nice properties of the optimal schedule. Then, we study the general aligned jobs and obtain an O(n 2) algorithm to compute the optimal schedule by using the algorithm for the common arrival time case as a building block. Because our algorithm relies on the computation of the optimal schedule in the ideal model (K = ∞), in order to achieve O(n 2) complexity, we improve the complexity of computing the optimal schedule in the ideal model for aligned jobs from the currently best known O(n 2logn) to O(n 2).

This work was supported in part by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China [Project No. CityU 117408], National Natural Science Foundation of China (grant no. 60775037) and the National High Technology Research and Development Program of China (863 Program) (grant no. 2009AA01Z123).

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albers, S., Fujiwara, H.: Energy-efficient algorithms for flow time minimization. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 621–633. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Bansal, N., Chan, H.L., Lam, T.W., Lee, L.K.: Scheduling for bounded speed processors. In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 409–420. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Bansal, N., Chan, H.-L., Pruhs, K.: Speed scaling with an arbitrary power function. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms (SODA), pp. 693–701 (2009)

    Google Scholar 

  4. Bansal, N., Pruhs, K., Stein, C.: Speed scaling for weighted flow time. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms (SODA), pp. 805–813 (2007)

    Google Scholar 

  5. Burd, T.D., Pering, T.A., Stratakos, A.J., Brodersen, R.W.: A dynamic voltage scaled microprocessor system. In: IEEE International Solid-State Circuits Conference, February 2000, pp. 294–295, 466 (2000)

    Google Scholar 

  6. Chan, H.-L., Edmonds, J., Lam, T.-W., Lee, L.-K., Marchetti-Spaccamela, A., Pruhs, K.: Nonclairvoyant speed scaling for fow and energy. In: STACS, Freiburg, Germany, pp. 409–420 (2009)

    Google Scholar 

  7. Hong, I., Qu, G., Potkonjak, M., Srivastava, M.B.: Synthesis Techniques for Low-Power Hard Real-Time Systems on Variable Voltage Processors. In: Proceedings of the IEEE Real-Time Systems Symposium (RTSS), pp. 178–187 (1998)

    Google Scholar 

  8. Irani, S., Pruhs, K.R.: Algorithmic problems in power management. SIGACT News 36(2), 63–76 (2005)

    Article  Google Scholar 

  9. Lam, T.W., Lee, L.-K., To, I.K.-K., Wong, P.W.H.: Speed scaling functions for fow time scheduling based on active job count. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 647–659. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Li, M., Liu, B.J., Yao, F.F.: Min-energy voltage allocation for tree-structured tasks. Journal of Combinatorial Optimization 11(3), 305–319 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Li, M., Yao, F.F.: An efficient algorithm for computing optimal discrete voltage schedules. SIAM J. on Computing 35, 658–671 (2005)

    Article  MathSciNet  Google Scholar 

  12. Li, M., Yao, A.C., Yao, F.F.: Discrete and continuous min-energy schedules for variable voltage processors. Proc. of the National Academy of Sciences USA (PNAS) 103, 3983–3987 (2006)

    Article  Google Scholar 

  13. Pruhs, K., Uthaisombut, P., Woeginger, G.: Getting the best response for your erg. In: Scandanavian Workshop on Algorithms and Theory, pp. 14–25 (2004)

    Google Scholar 

  14. Yao, F., Demers, A., Shenker, S.: A scheduling model for reduced CPU energy. In: Proc. IEEE Symp. Foundations of Computer Science (FOCS), pp. 374–382 (1995)

    Google Scholar 

  15. Yuan, L., Qu, G.: Analysis of energy reduction on dynamic voltage scaling-enabled systems. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 24(12), 1827–1837 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Science and Technology of China, Department of Computer Science, City University of Hong Kong, USTC-CityU Joint Research Institute,  

    Weiwei Wu

  2. Department of Computer Science, City University of Hong Kong,  

    Minming Li

  3. Department of Computer Science, University of Science and Technology of China,  

    Enhong Chen

Authors
  1. Weiwei Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Minming Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Enhong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Electrical and Computer Engineering, University of Hawaii, Holmes Hall 483, 2540 Dole Street, 96822, Honolulu, HI, USA

    Yingfei Dong

  2. Department of Computer Science, University of Texas at Dallas, 75083, Dallas, TX, USA

    Ding-Zhu Du

  3. Department of Computer Science, University of California, 93106, Santa Barbara, CA, USA

    Oscar Ibarra

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, W., Li, M., Chen, E. (2009). Min-Energy Scheduling for Aligned Jobs in Accelerate Model. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10631-6_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10630-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation