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
Find the corresponding matrix of the digraph above

Batch Processing When the entire computer system is dedicated to a single job, the system is said to be operating in Batch Processing mode. In this mode each program is run to

MAGNETIC CORE MEMORY: This type of memory is used extensively in airborne digital systems, although integrated circuits are being developed with most modern aircraft systems.

Explain about MIDI audio

The unconditional jumps in a written program in assembler language are specified by the jmp instruction; a jump is to moves the flow of the execution of a program by sending the co

how does one create a database in mysql

Question 1 What is mobile telephone initialization? Explain the three main goals of this procedure Define GSM system operations Introduction to mobile telephone initializ

They are utilized to move the contents of the operators. Each instruction can be used with many different modes of addressing. MOV MOVS (MOVSB) (MOVSW) MOV INSTRUCTION Principle: D


Process States Throughout the lifespan of a process, its execution position may be in one of four states: (linked with each state is generally a queue on which the process resides)