Scheduling algorithm based on prefetching in MapReduce clusters

doi:10.1016/j.asoc.2015.04.039

Scheduling algorithm based on prefetching in MapReduce clusters

2016-01-01

23

OA

AI

DOI：10.1016/j.asoc.2015.04.039

原文链接

查看原文

摘要

En 中文

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. (C) 2015 Elsevier B.V. All rights reserved.

Keyword:

Data locality

MapReduce

Prefetching

Task scheduler

Memory

Big data

Scheduling algorithm based on prefetching in MapReduce clusters

摘要

AI总结

期刊

机构

引用论文