Browse by author
Lookup NU author(s): Dr Stephen McGough, Emeritus Professor Isi Mitrani
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
A host uses servers hired from a Cloud in order to offer certain services to paying customers. It must decide dynamically when and how many servers to hire, and when to release them, so as to minimize both the job holding costs and the server costs. Under certain assumptions, the problem can be formulated in terms of a semi-Markov decision process and the optimal hiring policy can be computed. Three situations are considered (a) jobs are submitted in random batches and servers can be hired for arbitrary periods of time; (b) jobs arrive singly and servers must be hired for fixed periods of time; (c) jobs arrive in bursts of random duration and hiring decisions are made at moments when bursts are initiated or terminated. In all three cases, the optimal policies are compared with some simple and easily implementable heuristics.
Author(s): McGough AS, Mitrani I
Editor(s): Horváth, A; Wolter, K
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: European Performance Engineering Workshop
Year of Conference: 2014
Pages: 1-15
Print publication date: 02/08/2014
Acceptance date: 01/01/1900
Date deposited: 15/12/2015
ISSN: 0302-9743
Publisher: Springer
URL: http://dx.doi.org/10.1007/978-3-319-10885-8_1
DOI: 10.1007/978-3-319-10885-8_1
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science
ISBN: 9783319108841
