没有合理的抱怨：公平分享多种资源
No justified complaints: On fair sharing of multiple resources
摘要：
公平分配在经济学和计算机科学中都得到了深入研究，随着虚拟化和云计算的出现，资源的公平共享重新引起了人们的兴趣。以前的工作通常集中在公平分享单一资源的机制上。我们提供了一个新的定义，同时公平分配多个连续可分资源。粗略地说，我们将公平性定义为这样一种情况，即每个用户要么得到他想要的所有资源，要么至少得到他在某些瓶颈资源上的权利，因此不能抱怨没有得到更多。这个定义具有与最近提出的主导资源公平性相同的理想属性，并且还处理多个瓶颈的情况。然后，我们证明了一个公平的分配，根据这个定义是保证存在的任何组合的用户请求和权利（用户的相对使用不同的资源是固定的）。的证明，它使用的工具，从理论上的常微分方程，是建设性的，并提供了一种方法来计算分配数字。
英文摘要：
Fair allocation has been studied intensively in both economics and computer science, and fair sharing of resources has aroused renewed interest with the advent of virtualization and cloud computing. Prior work has typically focused on mechanisms for fair sharing of a single resource. We provide a new definition for the simultaneous fair allocation of multiple continuously-divisible resources. Roughly speaking, we define fairness as the situation where every user either gets all the resources he wishes for, or else gets at least his entitlement on some bottleneck resource, and therefore cannot complain about not getting more. This definition has the same desirable properties as the recently suggested dominant resource fairness, and also handles the case of multiple bottlenecks. We then prove that a fair allocation according to this definition is guaranteed to exist for any combination of user requests and entitlements (where a user's relative use of the different resources is fixed). The proof, which uses tools from the theory of ordinary differential equations, is constructive and provides a method to compute the allocations numerically.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
