Chau sid chi kin (21 risultati)
- Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 52,34
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: 6 disponibili
Condizione: New.
- Brossura
Da: WYEMART LIMITED, HEREFORD, Regno UnitoWYEMART LIMITED
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 41,68
EUR 13,99 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
paperback. Condizione: New.
- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 55,71
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Rilegato
Da: California Books, Miami, FL, U.S.A.California Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 60,43
Spedizione gratuitaSpedito in U.S.A.Quantità: 5 disponibili
Condizione: New.
- Brossura
Da: California Books, Miami, FL, U.S.A.California Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 60,43
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Rilegato
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 60,89
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: 6 disponibili
Condizione: As New. Unread book in perfect condition.
- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 63,60
EUR 2,28 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 59,25
EUR 13,97 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 59,24
EUR 17,49 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.
- Brossura
Da: GreatBookPricesUK, Woodford Green, Regno UnitoGreatBookPricesUK
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 67,13
EUR 17,49 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: As New. Unread book in perfect condition.
- Brossura
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 75,61
EUR 11,66 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Paperback. Condizione: Brand New. 91 pages. 9.45x6.61x0.19 inches. In Stock.
- Rilegato
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 77,18
EUR 11,66 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Hardcover. Condizione: Brand New. 91 pages. 9.45x6.61x0.43 inches. In Stock.
- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 60,86 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 provisioni…ng 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.
- Rilegato
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 61,73 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 algo…rithms 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.
- Rilegato
Da: Buchpark, Trebbin, GermaniaBuchpark
Contatta il venditoreVenditore con 5 stelleCondizione: Usato
EUR 27,32
EUR 105,00 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: Hervorragend. Zustand: Hervorragend | Sprache: Englisch | Produktart: Bücher | 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 pr…ovisioning 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.
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. Dy…namic 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. 92 pp. Englisch.
- Rilegato
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 53,49
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Buch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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 p…rovisioning 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. 92 pp. Englisch.
- Rilegato
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 73,92
EUR 7,58 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand.
- Rilegato
- Print on Demand
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 75,85
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND.
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 47,23
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Examines ways to improve the design of online algorithms with predictions in dynamic provisioningDescribes best practices for implementing online dynamic provisioning algorithms for data centersExplores the effective… use of future workload .
Lingua: Inglese
Editore: Springer, Berlin|Springer International Publishing|Springer, 2022
- Rilegato
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 47,23
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 algorit.
