Green data centers: A survey, perspectives, and future directions

X **, F Zhang, AV Vasilakos, Z Liu - arxiv preprint arxiv:1608.00687, 2016 - arxiv.org
At present, a major concern regarding data centers is their extremely high energy
consumption and carbon dioxide emissions. However, because of the over-provisioning of …

Race to idle: new algorithms for speed scaling with a sleep state

S Albers, A Antoniadis - ACM Transactions on Algorithms (TALG), 2014 - dl.acm.org
We study an energy conservation problem where a variable-speed processor is equipped
with a sleep state. Executing jobs at high speeds and then setting the processor asleep is an …

Energy-efficient scheduling with predictions

E Balkanski, N Perivier, C Stein… - Advances in Neural …, 2024 - proceedings.neurips.cc
An important goal of modern scheduling systems is to efficiently manage power usage. In
energy-efficient scheduling, the operating system controls the speed at which a machine is …

A tutorial on amortized local competitiveness in online scheduling

S Im, B Moseley, K Pruhs - ACM SIGACT News, 2011 - dl.acm.org
Recently the use of potential functions to analyze online scheduling algorithms has become
popular [19, 7, 29, 13, 31, 4, 30, 3, 21, 15, 14, 28, 12, 2, 5, 6, 9, 11, 23, 33, 24, 8, 17, 16, 25 …

[BUCH][B] Handbook of Energy-Aware and Green Computing, Volume 1

I Ahmad, S Ranka - 2012 - books.google.com
Implementing energy-efficient CPUs and peripherals as well as reducing resource
consumption have become emerging trends in computing. A landmark for researchers in …

Online resource scheduling under concave pricing for cloud computing

R Zhang, K Wu, M Li, J Wang - IEEE Transactions on Parallel …, 2015 - ieeexplore.ieee.org
With the booming cloud computing industry, computational resources are readily and
elastically available to the customers. In order to attract customers with various demands …

Primal dual gives almost optimal energy-efficient online algorithms

NR Devanur, Z Huang - ACM Transactions on Algorithms (TALG), 2017 - dl.acm.org
We consider the problem of online scheduling of jobs on unrelated machines with dynamic
speed scaling to minimize the sum of energy and weighted flow-time. We give an algorithm …

The bell is ringing in speed-scaled multiprocessor scheduling

G Greiner, T Nonner, A Souza - Proceedings of the twenty-first annual …, 2009 - dl.acm.org
This paper investigates the problem of scheduling jobs on multiple speed-scaled processors
without migration, ie, we have constant α> 1 such that running a processor at speed s results …

Scalably scheduling power-heterogeneous processors

A Gupta, R Krishnaswamy, K Pruhs - … 2010, Bordeaux, France, July 6-10 …, 2010 - Springer
Scalably Scheduling Power-Heterogeneous Processors Page 1 Scalably Scheduling Power-Heterogeneous
Processors Anupam Gupta1,⋆, Ravishankar Krishnaswamy1,⋆, and Kirk Pruhs2,⋆⋆ 1 …

Energy efficient scheduling of parallelizable jobs

K Fox, S Im, B Moseley - Theoretical Computer Science, 2018 - Elsevier
This paper considers scheduling parallelizable jobs in the non-clairvoyant speed scaling
setting to minimize the objective of weighted flow time plus energy. Previously, strong lower …