Scheduling algorithm based on prefetching in MapReduce clusters

Mingming Sun*, Hang Zhuang, Changlong Li, Kun Lu, Xuehai Zhou

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

Abstract

Due to cluster resource competition and task scheduling policy, some map tasks are assigned to nodes without input data, which causes significant data access delay. Data locality is becoming one of the most critical factors to affect performance of MapReduce clusters. As machines in MapReduce clusters have large memory capacities, which are often underutilized, in-memory prefetching input data is an effective way to improve data locality. However, it is still posing serious challenges to cluster designers on what and when to prefetch. To effectively use prefetching, we have built HPSO (High Performance Scheduling Optimizer), a prefetching service based task scheduler to improve data locality for MapReduce jobs. The basic idea is to predict the most appropriate nodes for future map tasks based on current pending tasks and then preload the needed data to memory without any delaying on launching new tasks. To this end, we have implemented HPSO in Hadoop-1.1.2. The experiment results have shown that the method can reduce the map tasks causing remote data delay, and improves the performance of Hadoop clusters.

Original languageEnglish
Pages (from-to)1109-1118
Number of pages10
JournalApplied Soft Computing
Volume38
DOIs
StatePublished - Jan 2016
Externally publishedYes

Keywords

  • Big data
  • Data locality
  • MapReduce
  • Memory
  • Prefetching
  • Task scheduler

Fingerprint

Dive into the research topics of 'Scheduling algorithm based on prefetching in MapReduce clusters'. Together they form a unique fingerprint.

Cite this