Multi-Resource Aware Fairsharing for Heterogeneous Systems
Authors | |
---|---|
Year of publication | 2015 |
Type | Article in Proceedings |
Conference | Job Scheduling Strategies for Parallel Processing |
MU Faculty or unit | |
Citation | |
Web | http://www.cs.huji.ac.il/~feit/parsched/jsspp14 |
Doi | http://dx.doi.org/10.1007/978-3-319-15789-4_4 |
Field | Informatics |
Keywords | Multi-Resource Fairness; Fairshare; Heterogeneity |
Description | Current production resource management and scheduling systems often use some mechanism to guarantee fair sharing of computational resources among different users of the system. For example, the user who so far consumed small amount of CPU time gets higher priority and vice versa. However, different users may have highly heterogeneous demands concerning system resources, including CPUs, RAM, HDD storage capacity or, e.g., GPU cores. Therefore, it may not be fair to prioritize them only with respect to the consumed CPU time. Still, applied mechanisms often do not reflect other consumed resources or they use rather simplified and "ad hoc" solutions to approach these issues. We show that such solutions may be (highly) unfair and unsuitable for heterogeneous systems. We provide a survey of existing works that try to deal with this situation, analyzing and evaluating their characteristics. Next, we present new enhanced approach that supports multi-resource aware user prioritization mechanism. Importantly, this approach is capable of dealing with the heterogeneity of both jobs and resources. A working implementation of this new prioritization scheme is currently applied in the Czech National Grid Infrastructure MetaCentrum. |
Related projects: |