Skip to main content
SpringerLink
Log in

On one problem of construction of energy-saving schedules

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

Abstract

Construction of energy-saving schedules for the execution of n jobs on a processor with the use of the dynamic voltage scaling (DVS) mechanism is considered. A formal problem statement is presented. The problem is shown to be NP-hard. An algorithm with complexity O(n 2/ε) guaranteeing finding of a (1 + ε)-approximate solution is suggested.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Albers, S., Muller, F., and Schmelzer, S., Speed Scaling on Parallel Processors, Proc. of the 19th ACM Symp. on Parallel Algorithms and Architectures (SPAA), 2007, pp. 289–298.

  2. Albers, S., Energy-Efficient Algorithms, Commun. ACM, 2010, vol. 53, no. 5, pp. 86–96.

    Article  MathSciNet  Google Scholar 

  3. Ge, R., Feng, X., and Cameron, K.W., Performance-Constrained Distributed DVS Scheduling for Scientific Applications on Power-Aware Clusters, Scalable Performance Lab., Dept. of Computer Sci., and Engineering, Univ. of South Carolina, SC 29208.

  4. Lee, Y.C. and Zomaya, A.Y., Minimizing Energy Consumption for Precedence-Constrained Applications Using Dynamic Voltage Scaling, Proc. of the 9th IEEE/ACM Int. Symp. on Cluster Computing and the Grid, 2009, no. 6, pp. 92–99.

  5. Computer and Job-shop Scheduling Theory, Coffman, E.G., Ed., Wiley, 1976. Translated under the title Teoriya raspisanii i vychislitel’nye mashiny, Moscow: Nauka, 1984.

  6. Graham, R., Bounds for Certain Multiprocessor Anomalies, Bell Systems Technology J., 1966, vol. 45, pp. 1563–1581.

    Google Scholar 

  7. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-completeness, New York: Freeman. Translated under the title Vychislitel’nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.

  8. Kellerer, H., Pferschy, U., and Pisinger, D., Knapsack Problems, Springer, 2004.

  9. Cormen, T., Leiserson, C., and Rivest, R., Introduction to Algorithms, Cambridge, MA, MIT Press, 1990. Translated under the title Algoritmy: postroenie i analiz, Moscow: MTsNMO, 1999.

  10. Computer Science Handbook, Tucker, A.B., Ed., Chapman & Hall, 2004.

Download references

Author information

Authors and Affiliations

  1. Department of Computational Mathematics and Cybernetics, Moscow State University, Moscow, 119992, Russia

    M. A. Trushnikov

Authors
  1. M. A. Trushnikov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. A. Trushnikov.

Additional information

Original Russian Text © M.A. Trushnikov, 2010, published in Programmirovanie, 2010, Vol. 36, No. 6.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Trushnikov, M.A. On one problem of construction of energy-saving schedules. Program Comput Soft 36, 337–342 (2010). https://doi.org/10.1134/S0361768810060034

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0361768810060034

Keywords

Search

Navigation