Describe FCFS Scheduling algorithm ?, Basic Computer Science

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 ?

Super computers, Super Computers: The specialised demands and requirem...

Super Computers: The specialised demands and requirements of science, industry and military have led to the creation of powerful super computers. For numerically intensive com

How can we create a fcb file?, Creating a new file For the formation of fil...

Creating a new file For the formation of files the 21H interruption 16H function is used. DX must identify a control structure whose necessities are that as a minimum the logic uni

Numerical data , i don''t understand how to create a program using double, ...

i don''t understand how to create a program using double, int, float, short etc

Explain the terms sampling and aliasing, QUESTION (a) Consider a syste...

QUESTION (a) Consider a system with input x[n] and output y[n] that satisfy the difference equation: Y[n] = x[n] + 0.5 x[n-2] + 0.2 x[n+1]

Disaccharide sugars, Disaccharide Sugars: Disaccharide - Carbohydrate made...

Disaccharide Sugars: Disaccharide - Carbohydrate made up of two monosaccharides (a sugar dimer) Condensation reaction between 2 monosaccharides Linkage between

Optical disk storage and cd - rom, Optical disk storage and cd - ROM: ...

Optical disk storage and cd - ROM: Optical disk storage is relatively new alternative to magnetic storage. Digital data is burnt into the surface of a plastic disk coated with

Switching mechanisms , SWITCHING MECHANISMS: Switching mechanisms are ...

SWITCHING MECHANISMS: Switching mechanisms are techniques devised to send messages in many dinections at once and to ensure that these messages are received with a minimum of

Unix fork program help, Will someone be able to help me with this I have tw...

Will someone be able to help me with this I have two text files that I can send. I am confused, is someone looking at this or is it still waiting to be assigned? this is the code

Long term goal of artificial intelligence, Long term goal of artificial int...

Long term goal of artificial intelligence: This is not to be complex with the applications of AI programs to other sciences, discussed later. Rather, it is just pointing out th

Characterizations of artificial intelligence, Characterizations of Artifici...

Characterizations of Artificial Intelligence Artificial Intelligence is a typical science to describe, because it has fuzzy borders with, psychology, computer science, mathemat

Write Your Message!

Name

Email id

Message

Verfication Code

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!

Submit Assignment

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