Manuscript Number : IJSRSET1624155
A Time Sharing Scheduler with Multiple Priority Based Queues for Improving Scheduling in Hadoop Cluster - Cloud Environment
Authors(3) :-Bakul Panchal, Priya Chak, Jayesh Mevada
Today, In the Era of Big data, it is in need of high levels of scalability and efficiently processing is main issue. So there is lot of challenges to handling data like how to store, retrieve and to process data efficiently. Hadoop is a distributed software platform for processing big data on a large cluster, which implements basic mechanism of Google’s MapReduce. The MapReduce job-scheduling algorithm is one of the core technologies of Hadoop. The default job scheduler of Hadoop is FIFO, which will start the job in the order as it is submitted, and this causes the job to be started later when it is submitted later. This paper uses the Time Sharing with increased time slot algorithm to solve this problem. With this scheduler, the job which is submitted late, will get quick response and started without long delay.
Bakul Panchal
Cloud Computing, FIFO, FAIR, Hadoop , MapReduce , Scheduling, SLS, Time Sharing.
Publication Details
Published in :
Volume 2 | Issue 4 | July-August 2016 Article Preview
Information Technology, L. D. College of Engineering, Ahmedabad, Gujarat, India
Priya Chak
Computer Engineering, Merchant Engineering College, Basna, Gujarat, India
Jayesh Mevada
Computer Engineering, Merchant Engineering College, Basna, Gujarat, India
Date of Publication :
2016-08-30
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) :
731-734
Manuscript Number :
IJSRSET1624155
Publisher : Technoscience Academy
Journal URL :
https://ijsrset.com/IJSRSET1624155