Abstract
In recent years, big data applications with scheduling algorithms have evolved lot due to the advancement of new technologies and techniques. We are living in digital data world where the data size is in terms of Exabyte or Pico Byte. This large volume of data is referred as big data. In today’s business environment, the performance of applications largely depends on the efficient retrieval of relevant data on time; the data analysis and retrieval of relevant data need to be done at faster rate. The traditional scheduling algorithms will not be efficient to handle such huge volume of data, considering the above facts managing big data applications and scheduling of big data on distributed architecture has become a challenging research area in the last three–four years. To process such huge volume of data, efficient scheduling algorithms need to be adopted to achieve better performance. The existing MapReduce implementation on Hadoop framework on single node cluster limits themselves to implement all the jobs on single node cluster. In this paper, we will discuss different scheduling techniques and their performance effects on a multimode clusters. The parameters considered for performance evaluation are CPU time, physical memory, and virtual memory. The main aim is to provide survey of different scheduling algorithms that can be used across distributed architecture to achieve better performance in analysis of big data considering YouTube dataset. The results interpret that capacity-based scheduling algorithm is more efficient as compared to FIFO and FAIR in terms of CPU cycles, physical and virtual memory utilization.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Merla P, Liang Y (2017) Data analysis using hadoop mapreduce environment. Int J Adv Technol Eng Sci
Pandey K, Gadwal A, Lakkadwala P (2016) Hadoop multi node cluster resource analysis. IEEE Xplore
Andrews BP, Binu A (2013) Survey on job schedulers in hadoop cluster. IOSR J Comp Eng 15(1):46–50
Santhosh S, Kumar H (2015) Improved fair scheduling algorithm for tasktracker in hadoop map-reduce. Int J Adv Technol Eng Sci. 03(1)
Narkhede VP, Khandare ST (2013) Fair scheduling algorithm with dynamic load balancing using in grid. Res Inven Int J Eng Sci 2(10):53–57
Li X, Jiang T (2016) Rub_en ruiz, Heuristics for periodical batch job scheduling in a MapReduce computing framework. Inf Sci 326(1):119–133
Dhulavvagol PM, Kundur NC (2017) Human action detection and recognition using SIFT and SVM. In; Cognitive computing and information processing, CCIP 2017. Communications in computer and information science, vol 801. Springer, Singapore
Liroz-Gistau M, Akbarinia R, Agrawal D, Valduriez P, Hadoop FP. Efficient processing of skewed MapReduce jobs. Orig Res Article Inf
Brahmwar M, Kumar M, Sikka G (2016) Tolhit—a scheduling algorithm for hadoop cluster. Orig Res Article Procedia Comput Sci 89:203–208
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Appendix
Appendix
1.1 Results screen shots: Implementation Results of FIFO, FAIR, and CAPACITY Scheduling Algorithms
The above screen shot interprets that for FIFO scheduling algorithm CPU execution time is 31,090 ms, physical memory (in Bytes) is 1,981,964,288, and virtual memory (in Bytes) is 15,903,952,896.
The above screen shot interprets that for FAIR scheduling algorithm CPU execution time (in ms) is 30,200, physical memory (in Bytes) is 1,844,121,600, and virtual memory (in Bytes) is 15,858,708,480.
The above screen shot interprets that for CAPACITY scheduling algorithm CPU execution time (in ms) is 28,900, physical memory (in Bytes) is 1,832,574,976, and virtual memory (in Bytes) is 15,913,111,552.
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Dhulavvagol, P.M., Totad, S.G., Sourabh, S. (2019). Performance Analysis of Job Scheduling Algorithms on Hadoop Multi-cluster Environment. In: Sridhar, V., Padma, M., Rao, K. (eds) Emerging Research in Electronics, Computer Science and Technology. Lecture Notes in Electrical Engineering, vol 545. Springer, Singapore. https://doi.org/10.1007/978-981-13-5802-9_42
Download citation
DOI: https://doi.org/10.1007/978-981-13-5802-9_42
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-5801-2
Online ISBN: 978-981-13-5802-9
eBook Packages: EngineeringEngineering (R0)