Near-optimal dispatching policy for energy-aware server clusters
No Thumbnail Available
Access rights
openAccess
URL
Journal Title
Journal ISSN
Volume Title
A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Authors
Date
2019-11
Major/Subject
Mcode
Degree programme
Language
en
Pages
37
Series
Performance Evaluation
Abstract
A server cluster can be modeled as a set of parallel queues, and the dispatcher decides to which queue the arriving jobs are routed. We consider an energy-aware dispatching system in a Markovian setting, where each server, upon becoming empty, enters a sleep mode to save energy, and to activate the server after sleep incurs an additional setup delay cost. We seek to optimize the performance-energy trade-off by applying the so-called Whittle index approach. As our main result, we derive sufficient conditions for the system parameters under which the problem is provably indexable, and also determine the corresponding Whittle index values explicitly. Our numerical experiments demonstrate that the resulting energy-aware Whittle index policy is able to perform very close to the numerically solved optimal policy and outperforms all considered reference policies.Description
Keywords
Optimal dispatching, Task assignment, Server cluster, Energy-aware server, InstantOff, Whittle index, Indexability
Other note
Citation
Aalto, S & Lassila, P 2019, ' Near-optimal dispatching policy for energy-aware server clusters ', Performance Evaluation, vol. 135, 102034 . https://doi.org/10.1016/j.peva.2019.102034