On a certain class of power- and energy-related scheduling problems

Abstract We consider problems of power and energy allocation to computational jobs performed on identical processors, where jobs may be performed with different speeds. Each job requires for its execution a processor as well as an amount (unknown in advance) of electrical power. Power is a continuous, doubly-constrained resource whose consumption over time is represented by energy. The amount of power allocated to a job is nonlinearly related to a particular speed of the job. Jobs are preemptable and independent, and all are available at the start of the process. Two general types of scheduling problems are considered: laptop problems, where the objective is to minimize the schedule length subject to power and/or energy constraints, and server problems, where power usage or energy consumption is to be minimized subject to a given schedule deadline. We present formulations of the analyzed problems, as well as methodologies for solving them for the cases of parallel processors and a single processor.

[1]  Sandy Irani,et al.  Algorithmic problems in power management , 2005, SIGA.

[2]  Jan Weglarz,et al.  Project Scheduling with Discrete and Continuous Resources , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  Jan Weglarz,et al.  Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines , 2012, Eur. J. Oper. Res..

[4]  Jan Węglarz,et al.  Project Scheduling with Continuously-Divisible, Doubly Constrained Resources , 1981 .

[5]  Bud Smith.  Green Computing: Tools and Techniques for Saving Energy, Money, and Resources , 2013 .

[6]  Grzegorz Waligóra.  Simulated Annealing and Tabu Search for Discrete-Continuous Project Scheduling with Discounted Cash Flows , 2014, RAIRO Oper. Res..

[7]  Jan Weglarz,et al.  Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan , 2014, Ann. Oper. Res..

[8]  Grzegorz Waligóra,et al.  Discrete-continuous Scheduling to Minimize the Makespan for Power Processing Rates of Jobs , 1999, Discret. Appl. Math..

[9]  Xue Liu,et al.  A Survey on Green-Energy-Aware Power Management for Datacenters , 2014, ACM Comput. Surv..

[10]  Grzegorz Waligóra.  Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan , 2011, Comput. Optim. Appl..

[11]  Grzegorz Waligóra,et al.  Discrete-continuous project scheduling with discounted cash inflows and various payment models—a review of recent results , 2011, Annals of Operations Research.

[12]  Jan Weglarz,et al.  Multiprocessor Scheduling with Memory Allocation - A Deterministic Approach , 1980, IEEE Trans. Computers.

[13]  Jan Weglarz,et al.  Solving a power-aware scheduling problem by grouping jobs with the same processing characteristic , 2015, Discret. Appl. Math..

[14]  Mateusz Gorczyca,et al.  Resource level minimization in the discrete-continuous scheduling , 2010, Eur. J. Oper. Res..