4.4 Article

Multi-resource allocation in cloud data centers: A trade-off on fairness and efficiency

出版社

WILEY
DOI: 10.1002/cpe.6061

关键词

allocation; efficiency; fairness; multi‐ resource

资金

  1. NSF [CNS 1824440, CNS 1828363, CNS 1757533, CNS 1629746]

向作者/读者索取更多资源

Fair allocation has been a topic of intensive study in economics and computer science, particularly in the context of multi-resource allocation in shared computer systems. Traditional methods often focus on abstracting multiple resources as a single resource bundle, but this may not meet the needs of diverse users. A promising approach, dominant resource fairness (DRF), has been proposed to equalize each user's dominant share while considering efficiency. This article introduces a new mechanism, 2-dominant resource fairness (2-DF), which takes into account a user's secondarily desired resource in addition to the dominant resource, and extends the concept to k-dominant resource fairness (k-DF).
Fair allocation has been studied intensively in both economics and computer science. Many existing mechanisms that consider fairness of resource allocation focus on a single resource. With the advance of cloud computing that centralizes multiple types of resources under one shared platform, multi-resource allocation has come into the spotlight. In fact, fair/efficient multi-resource allocation has become a fundamental problem in any shared computer system. The widely used solution is to partition resources into bundles that contain fixed amounts of different resources, so that multiple resources are abstracted as a single resource. However, this abstraction cannot satisfy different demands from heterogeneous users, especially on ensuring fairness among users competing for resources with different capacity limits. A promising approach to this problem is dominant resource fairness (DRF), which tries to equalize each user's dominant share (share of a user's most highly demanded resource, that is, the largest fraction of any resource that the user has required for a task), but this method may still suffer from significant loss of efficiency (i.e., some resources are underused). This article develops a new allocation mechanism based on DRF aiming to balance fairness and efficiency. We consider fairness not only in terms of a user's dominant resource, but also in another resource dimension which is secondarily desired by this user. We call this allocation mechanism 2-dominant resource fairness (2-DF). Then, we design a non-trivial on-line algorithm to find a 2-DF allocation and extend this concept to k-dominant resource fairness (k-DF).

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据