Describe FCFS Scheduling algorithm ?, Basic Computer Science

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
Posted Date: 5/2/2012 8:07:59 AM | Location : United States







Related Discussions:- Describe FCFS Scheduling algorithm ?, Assignment Help, Ask Question on Describe FCFS Scheduling algorithm ?, Get Answer, Expert's Help, Describe FCFS Scheduling algorithm ? Discussions

Write discussion on Describe FCFS Scheduling algorithm ?
Your posts are moderated
Related Questions
To satisfy client needs through proxy server and not through main server, as some other user have already accessed that file and its copied to the proxy server, so next time a user

Simple Tasks to Accomplish Once you've worried for why you're performing AI, what has inspired you and how you're going to approach the job, then you can initialize to think for


Desk Top Publishing Program: Desktop publishing programs contain many of the features of word processing software, but .go even further in the ability to layout the format of

Question 1: a) A distinction is often made between computer architecture and computer organisation. Describe, using examples, the meaning of computer architecture. b) Name

Ask question #Minimum assignment on generations of computers 100 words accepted#

Define explicit, implicit and parametric representation and what are their advantages?

Question 1 Write an assembly language program to find the highest among two numbers Question2 Draw and explain the internal architecture of 8085 briefly Question3 Explai


What îs exactly data type and Database Assignment Help  ? We have can take several points of view, A data type îs set of values — char typically has 256 distinct values, into has