Scheduling for response time in Hadoop MapReduce

Xiangming Dai, Brahim Bensaou

Research output: Chapter in Book/Conference Proceeding/ReportConference Paper published in a bookpeer-review

13 Citations (Scopus)

Abstract

In this paper, we propose a novel task scheduling algorithm for Hadoop MapReduce called dynamic priority multiqueue scheduler (DPMQS). DPMQS i) increases the data locality of jobs, and, ii) dynamically increases the priority of jobs that are near to completing their Map phase, to bridge the time gap between the start of the reduce tasks and the execution of the reduce function for these jobs. We discuss the details of DPMQS and its practical implementation, then assess its performance in a small physical cluster and large-scale simulated clusters and compare it to the other schedulers available in Hadoop. Both real experiments and simulation results show that DPMQS decreases significantly the response time, and demonstrate that DPMQS is insensitive to changes in the cluster geometry.

Original languageEnglish
Title of host publication2016 IEEE International Conference on Communications, ICC 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781479966646
DOIs
Publication statusPublished - 12 Jul 2016
Event2016 IEEE International Conference on Communications, ICC 2016 - Kuala Lumpur, Malaysia
Duration: 22 May 201627 May 2016

Publication series

Name2016 IEEE International Conference on Communications, ICC 2016

Conference

Conference2016 IEEE International Conference on Communications, ICC 2016
Country/TerritoryMalaysia
CityKuala Lumpur
Period22/05/1627/05/16

Bibliographical note

Publisher Copyright:
© 2016 IEEE.

Fingerprint

Dive into the research topics of 'Scheduling for response time in Hadoop MapReduce'. Together they form a unique fingerprint.

Cite this