Online Capacity Provisioning for Energy-Efficient Datacenters (Record no. 84732)

000 -LEADER
fixed length control field 03976nam a22005775i 4500
001 - CONTROL NUMBER
control field 978-3-031-11549-3
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730163543.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 221019s2022 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783031115493
-- 978-3-031-11549-3
082 04 - CLASSIFICATION NUMBER
Call Number 005.7
100 1# - AUTHOR NAME
Author Chen, Minghua.
245 10 - TITLE STATEMENT
Title Online Capacity Provisioning for Energy-Efficient Datacenters
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2022.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XII, 79 p. 12 illus., 11 illus. in color.
490 1# - SERIES STATEMENT
Series statement Synthesis Lectures on Learning, Networks, and Algorithms,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 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 ## - SUMMARY, ETC.
Summary, etc 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.
700 1# - AUTHOR 2
Author 2 Chau, Sid Chi-Kin.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-031-11549-3
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2022.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Database management.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Computer science.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Algorithms.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Dynamical systems.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Power electronics.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Database Management System.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Theory and Algorithms for Application Domains.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Design and Analysis of Algorithms.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Dynamical Systems.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Power Electronics.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 2690-4314
912 ## -
-- ZDB-2-SXSC

No items available.