Convoy Effect Elimination in FCFS Scheduling
Sambath M.1, K. Padmaveni2, Linda Joseph3, Ravi S.4, J. Thangakumar5, D. John Aravindhar6
1Sambath M., Assistant Professor, Department of CSE, Hindustan Institute of Technology and Science, Chennai, India.
2Dr. K. Padmaveni, Associate Professor, Department of CSE, Hindustan Institute of Technology and Science, Chennai, India.
3Linda Joseph, Assistant Professor, Department of CSE, Hindustan Institute of Technology and Science, Chennai, India.
4Ravi S., Assistant Professor, Department of CSE, Hindustan Institute of Technology and Science, Chennai, India.
5Dr. J. Thangakumar, Associate Professor, Department of CSE, Hindustan Institute of Technology and Science, Chennai, India.
6Dr. D. John Aravindhar, Professor, Department of CSE, Hindustan Institute of Technology and Science, Chennai, India.
Manuscript received on January 26, 2020. | Revised Manuscript received on February 05, 2020. | Manuscript published on February 30, 2020. | PP: 3218-3221 | Volume-9 Issue-3, February 2020. | Retrieval Number: C6092029320/2020©BEIESP | DOI: 10.35940/ijeat.C6092.029320
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: 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.
Keywords: Convoy effect, scheduler, throughput, turnaround time.