DeepAI AI Chat
Log In Sign Up

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

10/25/2021
by   Antonios Antoniadis, et al.
0

We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between power-saving states of different energy consumption and wake-up costs. We develop a learning-augmented online algorithm that makes decisions based on (potentially inaccurate) predicted lengths of the idle periods. The algorithm's performance is near-optimal when predictions are accurate and degrades gracefully with increasing prediction error, with a worst-case guarantee almost identical to the optimal classical online algorithm for the problem. A key ingredient in our approach is a new algorithm for the online ski rental problem in the learning augmented setting with tight dependence on the prediction error. We support our theoretical findings with experiments.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/22/2020

Learning Augmented Energy Minimization via Speed Scaling

As power management has become a primary concern in modern data centers,...
09/19/2014

Rank-Aware Dynamic Migrations and Adaptive Demotions for DRAM Power Management

Modern DRAM architectures allow a number of low-power states on individu...
03/30/2022

Prognosis of Rotor Parts Fly-off Based on Cascade Classification and Online Prediction Ability Index

Large rotating machines, e.g., compressors, steam turbines, gas turbines...
12/06/2021

A Novel Prediction Setup for Online Speed-Scaling

Given the rapid rise in energy demand by data centers and computing syst...
04/03/2022

Learning-Augmented Mechanism Design: Leveraging Predictions for Facility Location

In this work we introduce an alternative model for the design and analys...
12/10/2021

Robustification of Online Graph Exploration Methods

Exploring unknown environments is a fundamental task in many domains, e....
07/26/2022

Learning-Augmented Maximum Flow

We propose a framework for speeding up maximum flow computation by using...