On one problem of construction of energy-saving schedules

Authors:
M. A. Trushnikov
Affiliations:
Department of Computational Mathematics and Cybernetics, Moscow State University, Moscow, Russia 119992
Venue:
Programming and Computing Software
Year:
2010

Citing 6
Cited 0

Introduction to algorithms

Introduction to algorithms
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
Performance-constrained Distributed DVS Scheduling for Scientific Applications on Power-aware Clusters

SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Speed scaling on parallel processors

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Minimizing Energy Consumption for Precedence-Constrained Applications Using Dynamic Voltage Scaling

CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Energy-efficient algorithms

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

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.