Open AccessAn approach to reduce turn around timeand waiting timeby the selection of round robin and shortest job first algorithm
Author(s) -
Sarvesh Kumar,
Gaurav Kumar,
Komal K. Jain,
Anurekha Jain
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.8.10553
Subject(s) - turnaround time , computer science , queue , scheduling (production processes) , job queue , weighted round robin , software , algorithm , fair share scheduling , job scheduler , round robin scheduling , real time computing , mathematical optimization , operating system , mathematics , computer network , schedule
In this research,a study on operating system tells about its working, how it helps as interface between user software and system hardware .To implement this, different scheduling is used to provide multiple processing in a hardware. There are different levels of scheduler applied in different levels of process from ready queue to termination. This paper focuses on the average amount of waiting time and amount of turnaround time of processes. The proposed algorithm purely defines less waiting time and turnaround time as compared to the round robin scheduling and shortest job first scheduling algorithm.