The Community for Technology Leaders
Green Image
Issue No. 01 - Jan.-March (2018 vol. 6)
ISSN: 2168-7161
pp: 156-167
Mathias Bjorkqvist , IBM Research, Zurich, Switzerland
Natarajan Gautam , Department of Industrial and Systems Engineering, Texas A&M University, College Station, TX
Robert Birke , IBM Research, Zurich, Switzerland
Lydia Y. Chen , IBM Research, Zurich, Switzerland
Walter Binder , Faculty of Informatics, University of Lugano, Lugano, Switzerland
ABSTRACT
A common pitfall when hosting applications in today's cloud environments is that virtual servers often experience varying execution speeds due to the interference from co-located virtual servers degrading the tail sojourn times specified in service level agreements. Motivated by the significance of tail sojourn times for cloud clusters, we develop a model of $_$N$_$ parallel virtual server queues, each of which processes jobs in a processor sharing fashion under varying execution speeds governed by Markov-modulated processes. We derive the tail distribution of the workloads for each server and the approximation for the tail sojourn times based on large deviation analysis. Furthermore, we optimize the cluster sizes that fulfill the requirements of target tail sojourn times. Extensive simulation experiments show very good matches to the derived analysis in a variety of scenarios, i.e., large numbers of servers experiencing a high number of different execution speeds, under various traffic intensities, workload variations and cluster sizes. Finally, we apply our proposed analysis to estimating the tail sojourn times of a Wikipedia system hosted in a private cloud, and the testbed results strongly confirm the applicability and accuracy of our analysis.
INDEX TERMS
Servers, Approximation methods, Cloud computing, Encyclopedias, Electronic publishing
CITATION

M. Bjorkqvist, N. Gautam, R. Birke, L. Y. Chen and W. Binder, "Optimizing for Tail Sojourn Times of Cloud Clusters," in IEEE Transactions on Cloud Computing, vol. 6, no. 1, pp. 156-167, 2018.
doi:10.1109/TCC.2015.2474367
207 ms
(Ver 3.3 (11022016))