Improving MapReduce performance in heterogeneous environments
Matei Zaharia, Andy Konwinski, Anthony D. Joseph et al. · 2008
MapReduce is emerging as an important programming model for large-scale data-parallel applications such as web indexing, data mining, and scientific simulation. Hadoop is an open-source implementation of MapReduce enjoying wide adoption and is often used for short jobs where low response time is critical. Hadoop's performance is closely tied to its task scheduler, which implicitly assumes that cluster nodes are homogeneous and tasks make progress linearly, and uses these assumptions to decide when to speculatively re-execute tasks that appear to be stragglers. In practice, the homogeneity assumptions do not always hold. An especially compelling setting where this occurs is a virtualized data center, such as Amazon's Elastic Compute Cloud (EC2). We show that Hadoop's scheduler can cause severe performance degradation in heterogeneous environments. We design a new scheduling algorithm, Longest Approximate Time to End (LATE), that is both simple and highly robust to heterogeneity. LATE can improve Hadoop response times by a factor of 2 in 200-node clusters on EC2.
Cited by 1,588 works. doi:10.5555/1855741.1855744
Authors
References
- MapReduce
- The Google file system
- Xen and the art of virtualization
- Dryad
- Pig latin
- Interpreting the Data: Parallel Analysis with Sawzall
- The ganglia distributed monitoring system: design, implementation, and experience
- X-trace: a pervasive network tracing framework
- Task Assignment in a Distributed System: Improving Performance by Unbalancing Load
- Wide area cluster monitoring with Ganglia