Open AccessImplementation Of Hybrid Scheduler In Hadoop
Author(s) -
B. Thirumala Rao,
M Susmitha,
T. Swathi,
Akhil Goel
Publication year - 2018
Publication title -
international journal of engineering and technology
Language(s) - English
Resource type - Journals
ISSN - 2227-524X
DOI - 10.14419/ijet.v7i2.7.11084
Subject(s) - computer science , dynamic priority scheduling , round robin scheduling , rate monotonic scheduling , fair share scheduling , earliest deadline first scheduling , two level scheduling , deadline monotonic scheduling , fixed priority pre emptive scheduling , distributed computing , scheduling (production processes) , parallel computing , mathematical optimization , operating system , mathematics , schedule
The paper focusses on priority based round robin scheduling algorithm for scheduling jobs in Hadoop environment. By Using this Proposed Scheduling Algorithm it reduces the starvation of jobs. And the advantage of priority scheduling is that the process with the highest priority will be executed first. Combining the both strategies of round robin and priority scheduling algorithm a optimized algorithm is to be implemented. Which works more efficiently even after considering all the parameters of scheduling algorithm. This proposed algorithm is also compared with existing round robin and priority scheduling algorithms.