@@ -7,14 +7,50 @@ title: Resource Allocation and Scheduling
7
7
8
8
_ Is the Problem Real?_
9
9
10
+ While the fair allocation of resources has been widely discussed in a single resource environment, and different adaptations
11
+ of max-min fairness (maximizing the minimum allocation of a user in a system) are found to work well, this paper addresses
12
+ the fair allocation of resources in a multi-resource environment. With a large number of shared platforms that support
13
+ coexisting applications (e.g., MapReduce, Spark, etc.) with multiple users, sharing multiple resources (CPU, RAM, etc.)
14
+ fairly across the different users is an important problem to address.
15
+
10
16
_ What is the solution's main idea?_
11
17
18
+ The main idea behind the solution is the generalization of "max-min" fairness to the multi-resource domain. In particular,
19
+ different users have different demands for each of the resources, and fair share is determined by "max-min" fair-share for
20
+ the dominant resource (most heavily allocated resource) for that user.
21
+
12
22
_ Why is the solution different from previous work?_
13
23
24
+ The authors discuss properties that such an allocation policy must possess:
25
+ * sharing incentive (better to share than desire exclusive access to resources),
26
+ * strategy proofness (no benefit in lying about resource demands),
27
+ * envy-freeness (no preference for another user’s allocation), and,
28
+ * pareto efficiency (impossible to increase allocation of one user without decreasing allocation of another).
29
+
30
+ Additionally, properties like
31
+ * single resource fairness (reduction to max-min fairness in presence of a single resource),
32
+ * bottleneck fairness (when a single resource is bottlenecked, reduces to max-min fairness for bottlenecked resource),
33
+ * population monotonicity (no decrease in allocation on adding users), and
34
+ * resource monotonicity (no decrease in allocation on adding resources)
35
+ are also desirable.
36
+
37
+ The authors show analytically that while DRF possesses all of these properties except resource monotonicity,
38
+ alternate fairness policies like asset fairness and Competitive Equilibrium from Equal Incomes (CEEI) lose
39
+ out on more important properties like sharing incentive or strategy proofness.
40
+
14
41
_ Does the paper identify any fundamental/hard trade-offs?_
15
42
43
+ As discussed before, the authors mention several desirable properties that are expected from a multi-resource allocation
44
+ policy. While these properties may not be complete, there is an inherent tradeoff that is exposed between them, and
45
+ different allocation policies typically tradeoff some of the desirable properties for others. However, DRF acheives
46
+ almost all these properties, apart from resource monotonicity.
47
+
16
48
_ Will the paper be influential in 10 years?_
17
49
50
+ Since a majority of resource allocators in and across cluster computing frameworks rely on some notions of fairness,
51
+ DRF is an important contribution in that direction. With its adoption in Mesos, it already has had real-world impact,
52
+ and I expect it to continue to be influential both in industry and in academia.
53
+
18
54
## Omega: flexible, scalable schedulers for large compute clusters
19
55
20
56
_ Is the Problem Real?_
0 commit comments