Format:
1 Online-Ressource(XII, 79 p. 12 illus., 11 illus. in color.)
Edition:
1st ed. 2022.
ISBN:
9783031115493
Series Statement:
Synthesis Lectures on Learning, Networks, and Algorithms
Content:
Introduction -- Preliminaries of Online Algorithms and Competitive Analysis -- Modeling and Problem Formulation -- The Case of A Single Server -- The General Case of Multiple Servers -- Experimental Studies -- Conclusion and Extensions.
Content:
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.
Additional Edition:
ISBN 9783031115486
Additional Edition:
ISBN 9783031115509
Additional Edition:
ISBN 9783031115516
Additional Edition:
Erscheint auch als Druck-Ausgabe ISBN 9783031115486
Additional Edition:
Erscheint auch als Druck-Ausgabe ISBN 9783031115509
Additional Edition:
Erscheint auch als Druck-Ausgabe ISBN 9783031115516
Language:
English
DOI:
10.1007/978-3-031-11549-3
Bookmarklink
