Opportunistic resource sharing based elastic resource allocation in a data center

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

Abstract

Resource allocation is the primary issue for multi-tenant cloud data centers. Opportunistic resource sharing is an efficient way to optimize resource utilization for data centers. However, the resource collision makes it challenging. In this paper, we introduce a Markov-chain based model (MST) to characterize the dynamical resource requirements for application, instead of the traditional static virtual network. To deal with the resource collision problem, we introduce a waiting time indicator (WTE) to describe the resource usage, and achieve a tradeoff between utilization and performance. Based on the MST model and WTE indicator, we propose a TRRA algorithm. The basic idea is to select the PM with reasonable WTE value for any extra resource requirement from applications. The experimental results show that our algorithm can realize better resource utilization while guaranteeing acceptable application performance.

Cite

CITATION STYLE

APA

Yuan, G., Wang, S., Zhang, M., Li, Y., Li, X., Wang, T., & Qian, Z. (2016). Opportunistic resource sharing based elastic resource allocation in a data center. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10067 LNCS, pp. 124–133). Springer Verlag. https://doi.org/10.1007/978-3-319-49145-5_13

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