國立虎尾科技大學 |

Online Capacity Provisioning for Energy-Efficient Datacenters

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Online Capacity Provisioning for Energy-Efficient Datacenters/ by Minghua Chen, Sid Chi-Kin Chau.
作者:	Chen, Minghua.
其他作者:	Chau, Sid Chi-Kin.
面頁冊數:	XII, 79 p. 12 illus., 11 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Database management. -
電子資源:	https://doi.org/10.1007/978-3-031-11549-3
ISBN:	9783031115493

Online Capacity Provisioning for Energy-Efficient Datacenters
Chen, Minghua.

Online Capacity Provisioning for Energy-Efficient Datacenters[electronic resource] /by Minghua Chen, Sid Chi-Kin Chau. - 1st ed. 2022. - XII, 79 p. 12 illus., 11 illus. in color.online resource. - Synthesis Lectures on Learning, Networks, and Algorithms,2690-4314. - Synthesis Lectures on Learning, Networks, and Algorithms,.

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.

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.

ISBN: 9783031115493

Standard No.: 10.1007/978-3-031-11549-3doiSubjects--Topical Terms:

557799
Database management.

LC Class. No.: QA76.9.D3

Dewey Class. No.: 005.7

Online Capacity Provisioning for Energy-Efficient Datacenters
LDR:03130nam a22003855i 4500 001 1084463
003 DE-He213
005 20221019103327.0
007 cr nn 008mamaa
008 221228s2022 sz | s |||| 0|eng d
020 $a 9783031115493 $9 978-3-031-11549-3
024 7 $a 10.1007/978-3-031-11549-3 $2 doi
035 $a 978-3-031-11549-3
050 4 $a QA76.9.D3
072 7 $a UN $2 bicssc
072 7 $a COM069000 $2 bisacsh
072 7 $a UN $2 thema
082 0 4 $a 005.7 $2 23
100 1 $a Chen, Minghua. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1390748
245 1 0 $a Online Capacity Provisioning for Energy-Efficient Datacenters $h [electronic resource] / $c by Minghua Chen, Sid Chi-Kin Chau.
250 $a 1st ed. 2022.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2022.
300 $a XII, 79 p. 12 illus., 11 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Synthesis Lectures on Learning, Networks, and Algorithms, $x 2690-4314
505 0 $a 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.
520 $a 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.
650 0 $a Database management. $3 557799
650 0 $a Computer science. $3 573171
650 0 $a Algorithms. $3 527865
650 0 $a Dynamical systems. $3 1249739
650 0 $a Power electronics. $3 561011
650 1 4 $a Database Management System. $3 1365724
650 2 4 $a Theory and Algorithms for Application Domains. $3 1388553
650 2 4 $a Design and Analysis of Algorithms. $3 1365721
650 2 4 $a Dynamical Systems. $3 1366074
650 2 4 $a Power Electronics. $3 1388857
700 1 $a Chau, Sid Chi-Kin. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1390749
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783031115486
776 0 8 $i Printed edition: $z 9783031115509
776 0 8 $i Printed edition: $z 9783031115516
830 0 $a Synthesis Lectures on Learning, Networks, and Algorithms, $x 2690-4314 $3 1390328
856 4 0 $u https://doi.org/10.1007/978-3-031-11549-3
912 $a ZDB-2-SXSC
950 $a Synthesis Collection of Technology (R0) (SpringerNature-85007)