Dynamic fair allocation of multiple resources with bounded number of tasks in cloud computing systems

Article type: Research Article

Authors: Li, Weidong^{a; b} | Liu, Xi^a | Zhang, Xiaolu^a | Zhang, Xuejie^{a; *}

Affiliations: [a] Yunnan University, Kunming, Yunnan, China | [b] Dianchi College of Yunnan University, Kunming, Yunnan, China

Correspondence: [*] Corresponding author: Xuejie Zhang, Yunnan University, Kunming, Yunnan 650091, China. E-mail:[email protected]

Abstract: Resource allocation is an important issue in any shared computer system. Recently, dynamic multi-resource fair allocation became a hot topic in cloud resource management. The most recent studies assume that each agent submits infinite number of tasks. In this paper, we consider a more realistic dynamic environment, where every agent submits a bounded number of tasks. We design a generalized dynamic dominant resource fairness mechanism, and develop a combinatorial optimal algorithm to find a fair allocation. Experimental results show that the solution produced by the proposed mechanism is close to the optimal solution.

Keywords: Cloud computing, dominant resource fairness, dynamic multi-resource fair allocation, combinatorial algorithm

DOI: 10.3233/MGS-150238

Journal: Multiagent and Grid Systems, vol. 11, no. 4, pp. 245-257, 2015