A Heterogeneity-Aware Task Scheduler for Spark
| Autor: | Ali R. Butt, Ramakrishnan Kannan, Luna Xu, Seung-Hwan Lim |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
020203 distributed computing
Computer science business.industry Distributed computing Big data Locality 020206 networking & telecommunications Graph theory 02 engineering and technology Dynamic priority scheduling Scheduling (computing) Spark (mathematics) 0202 electrical engineering electronic engineering information engineering Task analysis Resource management business |
| Zdroj: | CLUSTER |
| DOI: | 10.1109/cluster.2018.00042 |
| Popis: | Big data processing systems such as Spark are employed in an increasing number of diverse applications—such as machine learning, graph computation, and scientific computing—each with dynamic and different resource needs. These applications increasingly run on heterogeneous hardware, e.g., with out-of-core accelerators. However, big data platforms do not factor in the multi-dimensional heterogeneity of applications and hardware. This leads to a fundamental mismatch between the application and hardware characteristics, and the resource scheduling adopted in big data platforms. For example, Hadoop and Spark consider only data locality when assigning tasks to nodes, and typically disregard the hardware capabilities and suitability to specific application requirements. In this paper, we present RUPAM, a heterogeneity-aware task scheduling system for big data platforms, which considers both task-level resource characteristics and underlying hardware characteristics, as well as preserves data locality. RUPAM adopts a simple yet effective heuristic to decide the dominant scheduling factor (e.g., CPU, memory, or I/O), given a task in a particular stage. Our experiments show that RUPAM is able to improve the performance of representative applications by up to 62.3% compared to the standard Spark scheduler. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|