Describe FCFS Scheduling algorithm ?, Basic Computer Science

Assignment Help:
FCFS algorithm also known as:
• First-In-First-Out (FIFO)
• Run-Until-Done
• Run-to-Completion
• Possibly, First-Come-First-Served algorithm is the easiest scheduling algorithm is the simplest scheduling algorithm. Processes are transmitted according to their advent time on the ready queue. Being a nonpreemptive discipline, one time a process has a CPU, it runs to end. The FCFS scheduling is fair in the proper sense or human sense of fairness but it is unfair in the sense that extended jobs make short jobs wait and insignificant jobs make important jobs wait.
• FCFS is more expected than most of other schemes since it offers time. FCFS scheme is not helpful in scheduling interactive users because it cannot guarantee good response time. The code for FCFS scheduling is easy to write and understand. One of the major drawbacks of this scheme is that the standard time is often quite long.
• The First-Come-First-Served algorithm is hardly ever used as a master scheme in modern operating systems but it is frequently embedded inside other schemes

Related Discussions:- Describe FCFS Scheduling algorithm ?

Application software, APPLICATION SOFTWARE Application Software ...

APPLICATION SOFTWARE Application Software generally is the software which is used to generate customized applications for the clients. Ex: Word Star, Lotus 1-2-3, Ms-

MIS, information system providors

information system providors

Operating system, Operating System: Operating  System is the software ...

Operating System: Operating  System is the software that manages all the computers' resources to optimize its performance provides common services for efficient execution of v

Oop, evolution of oop

evolution of oop

With an example, Question 1 With an example, illustrate the concept of ext...

Question 1 With an example, illustrate the concept of extern variable Question 2 What is the difference between pointer variable and simple variable? Question 3 Give the

Algorithm writing, algorithm to simulate railway reservation process

algorithm to simulate railway reservation process

Historical background of computers, Historical Background The br...

Historical Background The brief history of the growth of computers is given below: Abacus:   It was the first mechanical device developed approximately 3,000 year

System software, note on high level language and low level language

note on high level language and low level language

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd