Job Schedulers in Mapreduce

Job Schedulers in Mapreduce

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
  
© 2017 by IJETT Journal
Volume-47 Number-2
Year of Publication : 2017
Authors : Miss Jadhav Usha Dattatraya, Prof V.R Chirchi
DOI :  10.14445/22315381/IJETT-V47P213

Citation 

Miss Jadhav Usha Dattatraya, Prof V.R Chirchi "Job Schedulers in Mapreduce", International Journal of Engineering Trends and Technology (IJETT), V47(2),83-87 May 2017. ISSN:2231-5381. www.ijettjournal.org. published by seventh sense research group

Abstract
The aim of this paper is to provide a better understanding of job schedulers in MapReduce and identify important research directions in this area. it present advantages and disadvantages of different jobs scheduling algorithm in MapReduce also job schedulers in MapReduce and then their features and the application of each category of the schedulers are expressed and the Mapreduce is a programming model and an associated implementation for processing and generating large datasets that is amenable to a broad variety of real-world tasks users specify the computation in terms of a map and a reduce function, and the underlying runtime system automatically parallelizes the computation across large-scale clusters of machines, handles machine failures, and schedules inter-machine communication to make efficient use of the network and disks.

 References

[1] K. H. Lee, Y. J. Lee et al., "Parallel data processing with MapReduce: a survey", ACM SIGMOD Record, 2011, Vol. 40, No. 4, pp. 11- 20.
[2] B. T. Rao, L. S. S. Reddy, "Survey on Improved Scheduling in Hadoop MapReduce in Cloud Environments", International Journal of Computer Applications, 2011, Vol. 34, No. 9,pp. 29.
[3]J. Dean, S. Ghemawat, " MapReduce: simplified data processing on large clusters", Communications of the ACM, 2008, Vol. 51, No. 1, pp. 107-113.
[4] J. Jin, J. Luo, A. Song, F. Dong, and R. Xiong, “BAR: An efficient data locality driven task scheduling algorithm for cloud computing,” in Proc. 11th IEEE/ACM Int. Symp. Cluster, Cloud Grid Comput., May 2011, pp. 295–304.
[5] Z. Guo, G. Fox, and M. Zhou, “Investigation of data locality in mapreduce,” in Proc. 12th IEEE/ACM Int. Symp. uster, Cloud Grid.Comput., May 2012, pp. 419–426.
[6] C. He, Y. Lu, and D. Swanson, “Matchmaking: A new mapreduce scheduling technique,” in Proc. IEEE 3rd Int. Conf. Cloud Comput. Technol. Sci., Nov. 2011, pp. 40–47.
[7] M. Zaharia et al. “Delay scheduling: A simple technique for achieving locality and fairness in cluster scheduling” In EuroSys,2010.
[8] M. Ehsan, and R. Sion, “LiPS: A cost-efficient data and task co-scheduler for MapReduce,” in Proc. IEEE 27th Int. Symp. Parallel Distrib. Process. Workshops PhD Forum, May 2013,pp. 2230–2233.
[9] Tak-Lon (Stephen) Wu Computer Science, School of Informatics and Computing Indiana University, Bloomington “ MapReduce and Data Intensive Applications ’’.

Keywords
MapReduce Schedulers, Data Locality, Hadoop,scheduing algorithm, MapReduce.