Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2011-06-14
Computer Science
Distributed, Parallel, and Cluster Computing
Scientific paper
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.
Dolev Danny
Feitelson Dror G.
Halpern Joseph Y.
Kupferman Raz
Linial Nati
No associations
LandOfFree
No justified complaints: On fair sharing of multiple resources does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with No justified complaints: On fair sharing of multiple resources, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and No justified complaints: On fair sharing of multiple resources will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-113555