Abstract
Our work introduced a new scheduler—Rawlsian Fair—which employs Rawls’s theory of fairness in scheduling malleable tasks in High Performance Computing environments. This scheduler assigns precedence to the least-well-off user via a new parameter: seniority. Rawlsian Fair performed up to 17× better than did traditional fair-share in scheduling scenarios featuring users with disproportionate task-submission profiles.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Sedighi, A., Smith, M. (2019). Conclusion. In: Fair Scheduling in High Performance Computing Environments. Springer, Cham. https://doi.org/10.1007/978-3-030-14568-2_14
Download citation
DOI: https://doi.org/10.1007/978-3-030-14568-2_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-14567-5
Online ISBN: 978-3-030-14568-2
eBook Packages: Computer ScienceComputer Science (R0)