Published February 29, 2020 | Version v1
Journal article Open

Convoy Effect Elimination in FCFS Scheduling

Creators

  • 1. Assistant Professor, Department of CSE, Hindustan Institute of Technology and Science, Chennai, India.
  • 2. Professor, Department of CSE, Hindustan Institute of Technology and Science, Chennai, India.

Contributors

  • 1. Publisher

Description

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.

Files

C6092029320.pdf

Files (354.7 kB)

Name Size Download all
md5:e2c53ab5ca0c317d7e04feebed56259e
354.7 kB Preview Download

Additional details

Related works

Is cited by
Journal article: 2249-8958 (ISSN)

Subjects

ISSN
2249-8958
Retrieval Number
C6092029320/2020©BEIESP