One of the important activities of operating systems is process scheduling. There are many algorithms available for scheduling like First Come First Served, Shortest Job First, Priority Scheduling and Round Robin. The fundamental algorithm is First Come First Served. It has some drawback of convoy effect. Convoy effect occurs when the small processes are waiting for lengthy process to complete. In this paper novel method is proposed to reduce convoy effect and to make the Scheduling optimal which reduces average waiting time and turnaround time.
CITATION STYLE
M., S. … Aravindhar, D. J. (2020). Convoy Effect Elimination in FCFS Scheduling. International Journal of Engineering and Advanced Technology, 9(3), 3218–3221. https://doi.org/10.35940/ijeat.c6092.029320
Mendeley helps you to discover research relevant for your work.