Bedankt voor het vertrouwen het afgelopen jaar! Om jou te bedanken bieden we GRATIS verzending (in België) aan op alles gedurende de hele maand januari.
- Afhalen na 1 uur in een winkel met voorraad
- Gratis thuislevering in België
- Ruim aanbod met 7 miljoen producten
Bedankt voor het vertrouwen het afgelopen jaar! Om jou te bedanken bieden we GRATIS verzending (in België) aan op alles gedurende de hele maand januari.
- Afhalen na 1 uur in een winkel met voorraad
- Gratis thuislevering in België
- Ruim aanbod met 7 miljoen producten
€ 52,95
+ 105 punten
Uitvoering
Omschrijving
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.
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.
Specificaties
Betrokkenen
- Auteur(s):
- Uitgeverij:
Inhoud
- Aantal bladzijden:
- 79
- Taal:
- Engels
- Reeks:
Eigenschappen
- Productcode (EAN):
- 9783031115516
- Verschijningsdatum:
- 21/10/2023
- Uitvoering:
- Paperback
- Formaat:
- Trade paperback (VS)
- Afmetingen:
- 170 mm x 244 mm
- Gewicht:
- 158 g
Alleen bij Standaard Boekhandel
+ 105 punten op je klantenkaart van Standaard Boekhandel
SOLDEN
E-BOOK ACTIE
Beoordelingen
We publiceren alleen reviews die voldoen aan de voorwaarden voor reviews. Bekijk onze voorwaarden voor reviews.