본문 바로가기
  • Home

Pre-arrangement Based Task Scheduling Scheme for Reducing MapReduce Job Processing Time

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2013, 18(11), pp.23-30
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science

박정효 1 김준상 2 김창현 3 Won Joo Lee 4 Chang Ho Jeon 2

1한양대학교 컴퓨터공학과
2한양대학교
3한양대 컴퓨터공학과
4인하공업전문대학

Accredited

ABSTRACT

In this paper, we propose pre-arrangement based task scheduling scheme to reduce MapReduce job processing time. If a task and data to be processed do not locate in same node, the data should be transmitted to node where the task is allocated on. In that case, a job processing time increases owing to data transmission time. To avoid that case, we schedule tasks into two steps. In the first step, tasks are sorted in the order of high data locality. In the second step, tasks are exchanged to improve their data localities based on a location information of data. In performance evaluation,we compare the proposed method based Hadoop with a default Hadoop on a small Hadoop cluster in term of the job processing time and the number of tasks sorted to node without data to be processed by them. The result shows that the proposed method lowers job processing time by around 18%. Also, we confirm that the number of tasks allocated to node without data to be processed by them decreases by around 25%.

Citation status

* References for papers published after 2023 are currently being built.