DOE OSTI · 3365859
Exploring Enhanced Dominant Resource Fairness Using Linear Programming Calculated Weights
Abstract
Maintaining resource fairness while achieving optimization for various performance metrics such as resource utilization, turnaround time and job latency is a well-known resource scheduling challenge in cloud computing. Despite the significant progress made with the introduction of dominant resource fairness by Ghodsi et al., which ensures major allocation properties such as sharing incentive, strategy-proofness, envy-freeness and Pareto efficiency to be achieved
Keep this discovery
Explore connections, maps & timelines
Yan, Bo [Binghamton University], Beltre, Angel Manuel [Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)] (ORCID:0000000285841604), Saha, Pankaj [Binghamton University], Govindaraju, Madhusudhan [Binghamton University]. 2024-12-01. Exploring Enhanced Dominant Resource Fairness Using Linear Programming Calculated Weights. https://doi.org/10.1109/ucc63386.2024.00031
Cite the original work for its findings. Save a collection to share your selection of sources.