Téléchargez le livre : Online Capacity Provisioning for Energy-Efficient Datacenters

Online Capacity Provisioning for Energy-Efficient Datacenters

de

,

Paru le : 2022-10-19

This book addresses the urgent issue of massive and inefficient energy consumption by data centers, which have become the largest co-located computing systems in the world and process trillions of megabytes of data every second. Dynamic provisioning algorithms have the potential to be the most viabl...
Voir tout
Ce livre est accessible aux handicaps Voir les informations d'accessibilité
Ebook téléchargement , DRM LCP 🛈 DRM Adobe 🛈
Compatible lecture en ligne (streaming)
52,99 €
Ajouter à ma liste d'envies
Téléchargement immédiat
Dès validation de votre commande
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

badge apple Application Louise Reader
badge Android Application Louise Reader

Description du livre


This book addresses the urgent issue of massive and inefficient energy consumption by data centers, which have become the largest co-located computing systems in the world and process trillions of megabytes of data every second. Dynamic provisioning algorithms have the potential to be the most viable and convenient of approaches to reducing data center energy consumption by turning off unnecessary servers, but they incur additional costs from being unable to properly predict future workload demands that have only recently been mitigated by advances in machine-learned predictions.


This book explores whether it is possible to design effective online dynamic provisioning algorithms that require zero future workload information while still achieving close-to-optimal performance. It also examines whether characterizing the benefits of utilizing the future workload information can then improve the design of online algorithms with predictions in dynamic provisioning. The book specifically develops online dynamic provisioning algorithms with and without the available future workload information. Readers will discover the elegant structure of the online dynamic provisioning problem in a way that reveals the optimal solution through divide-and-conquer tactics. The book teaches readers to exploit this insight by showing the design of two online competitive algorithms with competitive ratios characterized by the normalized size of a look-ahead window in which exact workload prediction is available.

À propos

Auteur
Sid Chi-Kin Chau , Minghua Chen
Éditeur
Springer
Collection
Synthesis Lectures on Learning, Networks, and Algorithms
Parution
2022-10-19
Pages
79 pages
EAN papier
9783031115486

Auteur(s) du livre


Defaut-Illustration Sid Chi-Kin Chau
Defaut-Illustration Minghua Chen

Caractéristiques détaillées - droits

EAN PDF
9783031115493
Prix
52,99 €
Nombre pages copiables
0
Nombre pages imprimables
7
Taille du fichier
1372 Ko
Ce livre est accessible aux handicaps informations d'accessibilité
EAN EPUB
9783031115493
Prix
52,99 €
Nombre pages copiables
0
Nombre pages imprimables
7
Taille du fichier
5939 Ko
Ce livre est accessible aux handicaps informations d'accessibilité

Suggestions personnalisées