Maximum Satisfaction Scheduling algorithm Based on Hadoop Architecture

DOI

10.2991/wartia-16.2016.354How to use a DOI?

Keywords

Hadoop, MapReduce, scheduling algorithm, resources,

Abstract

Based on the MapReduce job scheduling technology for design reference, this paper has put forward the maximum satisfaction scheduling algorithm of Hadoop to effectively solve the scheduling problems in MapReduce. The algorithm has tried to modify the original algorithm of Hadoop, configure a satisfaction score for each submitted job, and obtain the maximum satisfaction score of the job under the same Hadoop system environment of hardware and software. Compared with the own scheduling algorithm of Hadoop—fair share scheduling, the experiment has eventually drawn the conclusion that the maximum satisfaction scheduling algorithm can get the outcomes that customers want, reduce a certain degree of scheduling time, and enhance the system throughput.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Kuan-ting Chen
AU  - Jian-hua Huang
AU  - Yi Jin
AU  - Xi He
PY  - 2016/05
DA  - 2016/05
TI  - Maximum Satisfaction Scheduling algorithm Based on Hadoop Architecture
BT  - Proceedings of the 2016 2nd Workshop on Advanced Research and Technology in Industry Applications
PB  - Atlantis Press
SP  - 1785
EP  - 1791
SN  - 2352-5401
UR  - https://doi.org/10.2991/wartia-16.2016.354
DO  - 10.2991/wartia-16.2016.354
ID  - Chen2016/05
ER  -