Discrete interior search algorithm for multi-resource fair allocation in heterogeneous cloud computing systems

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

Abstract

The mechanism of resource allocation for cloud computing not only affects the users’ fairness, but also has a significant impact on resource utilization. Most current resource allocation models did not take into account the indivisible demands, the heterogeneity servers, and the situations multi-server. Dominant resource fairness allocation in heterogeneous systems (DRFH) is a fair and efficient resource allocation mechanism. But solving the DRFH problem is NP-hard. There are significant gaps between solutions obtained by existing heuristic algorithms and optimal solutions. They cannot effectively use server resources, resulting in a waste of resources of servers. In this paper, we propose a novel discrete interior search algorithm (DISA) to solve indivisible demands in heterogeneous servers, with a specific repair operator and task-fit value. Experimental results demonstrate that DISA can well adapt to dynamic changes in user resource request type, obtain the near-optimal solutions, maximize the value of minimum global dominant share and resource utilization.

Cite

CITATION STYLE

APA

Liu, X., Zhang, X., Li, W., & Zhang, X. (2016). Discrete interior search algorithm for multi-resource fair allocation in heterogeneous cloud computing systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9771, pp. 615–626). Springer Verlag. https://doi.org/10.1007/978-3-319-42291-6_61

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