Association for Computing Machinery
There has been a recent industrial effort to develop multi-resource hierarchical schedulers. However, the existing implementations have some shortcomings in that they might leave resources unallocated or starve certain jobs. This is because the multi-resource setting introduces new challenges for hierarchical scheduling policies. The authors provide an algorithm, which they implement in Hadoop that generalizes the most commonly used multi-resource scheduler, DRF, to support hierarchies. Their evaluation shows that their proposed algorithm, H-DRF, avoids the starvation and resource inefficiencies of the existing open-source schedulers and outperforms slot scheduling.