Multiresource Allocation: Fairness–Efficiency Tradeoffs in a Unifying Framework

@article{JoeWong2013MultiresourceAF,
  title={Multiresource Allocation: Fairness–Efficiency Tradeoffs in a Unifying Framework},
  author={Carlee Joe-Wong and Soumya Sen and Tian Lan and Mung Chiang},
  journal={IEEE/ACM Transactions on Networking},
  year={2013},
  volume={21},
  pages={1785-1798}
}
Quantifying the notion of fairness is underexplored when there are multiple types of resources and users request different ratios of the different resources. A typical example is data centers processing jobs with heterogeneous resource requirements on CPU, memory, network bandwidth, etc. In such cases, a tradeoff arises between equitability, or “fairness,” and efficiency. This paper develops a unifying framework addressing the fairness-efficiency tradeoff in light of multiple types of resources… 
Multiresource allocation: fairness-efficiency tradeoffs in a unifying framework
TLDR
Two families of fairness functions are developed that provide different tradeoffs, characterize the effect of user requests' heterogeneity, and prove conditions under which these fairness measures satisfy the Pareto efficiency, sharing incentive, and envy-free properties.
Capturing resource tradeoffs in fair multi-resource allocation
TLDR
It is proved that NB has many desirable properties, including Pareto optimality and envy freeness, in a broad variety of environments whereas the seemingly less appealing LMMF fares better, and is even immune to manipulations, in restricted settings of interest.
REF: resource elasticity fairness with sharing incentives for multiprocessors
TLDR
It is shown that Cobb-Douglas utility functions are well suited to modeling user preferences for cache capacity and memory bandwidth, and an allocation mechanism is presented that provably guarantees SI, EF, and PE, as well as strategy-proofness in the large.
Stateful Dominant Resource Fairness: Considering the Past in a Multi-Resource Allocation
TLDR
It is proved that SDRF is strategyproof, since users cannot manipulate the system by misreporting their demands; incentivizes sharing, because no user is better off if resources are equally partitioned; and is efficient, as no allocation can be improved without decreasing another.
Beyond Beyond Dominant Resource Fairness : Indivisible Resource Allocation In Clusters
TLDR
This paper analyzes various resource allocation algorithms over datacenter clusters and proposes the proposed MergeDRF algorithm, a mechanism that ensures max-min fairness and a heuristic for a complex multidimensional bin packing problem that has not been well explored.
HUG: Multi-Resource Fairness for Correlated and Elastic Demands
TLDR
This paper proves that in non-cooperative environments like public cloud networks, there is a strong tradeoff between optimal isolation guarantee and work conservation when demands are elastic, and presents a provably optimal allocation algorithm, High Utilization with Guarantees (HUG), to achieve maximum attainable network utilization.
Optimal Performance Versus Fairness Tradeoff for Resource Allocation in Wireless Systems
TLDR
This paper proposes a unified and general mathematical formulation of the optimal performance versus fairness tradeoff in multiuser wireless communication systems based on the generalized Lagrange method and adopts general definitions for both performance and fairness.
Altruistic Scheduling in Multi-Resource Clusters
TLDR
This work proposes an altruistic, long-term approach, CARBYNE, where jobs yield fractions of their allocated resources without impacting their own completion times, and shows that leftover resources collected via altruisms of many jobs can be rescheduled to further secondary goals such as application-level performance and cluster efficiency without impacting performance isolation.
On Fairness-Efficiency Tradeoffs for Multi-resource Packet Processing
  • Wei Wang, B. Liang, Baochun Li
  • Computer Science
    2013 IEEE 33rd International Conference on Distributed Computing Systems Workshops
  • 2013
TLDR
It is shown in this paper that there exists a fairnessefficiency tradeoff when multiple resources are scheduled, and how to design a packet scheduling algorithm to reinforce such a tradeoff is presented.
Relational approaches to resource-aware multi-maxmin fairness in multi-valued resource sharing tasks
TLDR
This work studies formal approaches to maxmin fairness in multi-valued evaluations in resource sharing or distribution tasks among agents, each share has multiple evaluations according to different observables and promotes a strict relational framework.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 119 REFERENCES
Multiresource allocation: fairness-efficiency tradeoffs in a unifying framework
TLDR
Two families of fairness functions are developed that provide different tradeoffs, characterize the effect of user requests' heterogeneity, and prove conditions under which these fairness measures satisfy the Pareto efficiency, sharing incentive, and envy-free properties.
Pricing the cloud: Resource allocations, fairness, and revenue
TLDR
An analytical framework is developed to investigate the fairness and revenue tradeoffs that arise in a datacenter’s multi-resource setting and the impact of different pricing plans on the operator's objective.
A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems
TLDR
A quantitative measure called Indiex of FRairness, applicable to any resource sharing or allocation problem, which is independent of the amount of the resource, and boundedness aids intuitive understanding of the fairness index.
Dominant Resource Fairness: Fair Allocation of Multiple Resource Types
TLDR
Dominant Resource Fairness (DRF), a generalization of max-min fairness to multiple resource types, is proposed, and it is shown that it leads to better throughput and fairness than the slot-based fair sharing schemes in current cluster schedulers.
Efficiency-fairness tradeoff in telecommunications networks
TLDR
A linear program is formulated that finds the optimal bandwidth allocation by maximizing efficiency subject to /spl alpha/-fairness constraints, which leads to an efficiency-fairness curve, which shows the benefit in efficiency as a function of the extent to which fairness is compromised.
An Axiomatic Theory of Fairness in Resource Allocation
TLDR
It is proved that there is a unique family of fairness measures satisfying the axioms, which is constructed and shown to include α-fairness, Jain’s index, and entropy as special cases, and properties of fairness Measures satisfying theAxioms are proved, including symmetry and Schur-concavity.
An Information-Theoretic Characterization of Weighted alpha-Proportional Fairness
TLDR
The results discussed in this paper indicate that the well-known fairness concept called weighted alpha-proportional fairness can be characterized using the alpha-divergence measure, which is a general class of information divergence measures, as an equilibrium of the trade-off described above.
An Axiomatic Theory of Fairness in Network Resource Allocation
TLDR
Among the engineering implications is a generalized Jain's index that tunes the resolution of fairness measure, a new understanding of α-fair utility functions, and an interpretation of ``larger &# 945; is more fair''.
Mathematical Frameworks for Pricing in the Cloud: Revenue, Fairness, and Resource Allocations
TLDR
An analytical framework is developed that accounts for the fairness and revenue tradeoffs that arise in a datacenter's multi-resource setting and the impact that different pricing plans can have on this tradeoff.
Bandwidth sharing: objectives and algorithms
TLDR
It is proved that fixed-size window control can achieve fair bandwidth sharing according to any of these criteria, provided scheduling at each link is performed in an appropriate manner.
...
1
2
3
4
5
...