Choosy: Max-Min Fair Sharing for Datacenter Jobs with Constraints

Download Now
Provided by: Association for Computing Machinery
Topic: Big Data
Format: PDF
Max-Min Fairness is a flexible resource allocation mechanism used in most datacenter schedulers. However, an increasing number of jobs have hard placement constraints, restricting the machines they can run on due to special hardware or software requirements. It is unclear how to define, and achieve, max-min fairness in the presence of such constraints. The authors propose Constrained Max-Min Fairness (CMMF), an extension to max-min fairness that supports placement constraints, and show that it is the only policy satisfying an important property that incentivizes users to pool resources. Optimally computing CMMF is challenging, but they show that a remarkably simple online scheduler, called Choosy, approximates the optimal scheduler well.
Download Now

Find By Topic