Dynamic Control of Running Servers

7Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Motivated by a data center setting, we study the problem of joint dispatching and server sleep state control in a system consisting of two queues in parallel. Using the theory of Markov decision processes and a novel lookahead approach, we explicitly determine near-optimal control policies that minimize a combination of QoE costs, energy costs, and wear and tear costs due to switching. Guidelines are provided as to when these combined policies are most effective.

Cite

CITATION STYLE

APA

Hyytiä, E., Down, D., Lassila, P., & Aalto, S. (2018). Dynamic Control of Running Servers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10740 LNCS, pp. 127–141). Springer Verlag. https://doi.org/10.1007/978-3-319-74947-1_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free