Open AccessConvoy Effect Elimination in FCFS Scheduling
Author(s) -
M. Sambath,
K. Padmaveni,
Russ Joseph,
J. Kumar,
D. John Aravindhar
Publication year - 2020
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.c6092.029320
Subject(s) - computer science , scheduling (production processes) , turnaround time , dynamic priority scheduling , rate monotonic scheduling , fair share scheduling , distributed computing , earliest deadline first scheduling , two level scheduling , mathematical optimization , real time computing , schedule , mathematics , operating system
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.