Dynamic Fair Division of Multiple Resources with Satiable Agents in Cloud Computing Systems

Dynamic multi-resource fair allocation became an important topic for cloud resource management. We consider a generalized version of the dynamic multi-resource fair allocation problem, where an agent is satisfied when all tasks it submitted can be processed. We design a generalized dynamic dominant resource fairness mechanism, and develop a combinatorial algorithm to find a fair allocation. Experimental results show that the solution produced by the proposed mechanism is close to the optimal solution.