A note on the dynamic dominant resource fairness mechanism

TL;DR

This paper analyzes the dynamic dominant resource fairness (DRF) mechanism, proving its competitive ratio is inversely proportional to resource types and providing an efficient algorithm for its implementation.

Contribution

It establishes the competitive ratio of the dynamic DRF mechanism and introduces a linear-time algorithm for its computation.

Findings

Competitive ratio is 1/number of resource types

Linear-time algorithm for dynamic DRF solution

Applicable for multi-resource fair allocation scenarios

Abstract

Multi-resource fair allocation has beena hot topic of resource allocation. Most recently, a dynamic dominant resource fairness (DRF) mechanism is proposed for dynamic multi-resource fair allocation. In this paper, we prove that the competitive ratio of the dynamic DRF mechanism is the reciprocal of the number of resource types, for two different objectives. Moreover, we develop a linear-time algorithm to find a dynamic DRF solution at each step.