Name
Abstract | ||
|---|---|---|
ABSTRACTUsing tiny tasks (microtasks) has long been regarded an effective way of load balancing in parallel computing systems. When combined with containerized execution nodes pulling in work upon becoming idle, microtasking has the desirable property of automatically adapting its load distribution to the processing capacities of participating nodes - more powerful nodes finish their work sooner and, therefore, pull in additional work faster. As a result, microtasking is deemed especially desirable in settings with heterogeneous processing capacities and poorly characterized workloads. However, microtasking does have additional scheduling and I/O overheads that may make it costly in some scenarios. Moreover, the optimal task size generally needs to be learned. We herein study an alternative load balancing scheme - Heterogeneous MacroTasking (HeMT) - wherein workload is intentionally skewed according to the nodes' processing capacity. We implemented and open-sourced a prototype of HeMT within the Apache Spark application framework and conducted experiments using the Apache Mesos cluster manager. It's shown experimentally that when workload-specific estimates of nodes' processing capacities are learned, Spark with HeMT offers up to 10% shorter average completion times for realistic, multistage data-processing workloads over the baseline Homogeneous microTasking (HomT) system. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1145/3429885.3429962 | MIDDLEWARE |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
0 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuquan Shan | 1 | 9 | 5.03 |
| Kesidis, G. | 2 | 438 | 71.79 |
| Aman Jain | 3 | 2 | 1.73 |
| Bhuvan Urgaonkar | 4 | 2309 | 158.10 |
| Jalal Khamse-Ashari | 5 | 0 | 0.34 |
| Ioannis Lambadaris | 6 | 502 | 78.37 |