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 ?

Objectives of laboratory organisation and management, Objectives When y...

Objectives When you have completed all the work in this unit you should be able to: List the basic components of a personal computer system, 1. describe the use of comput

ToDoMenu, In this assignment, you should create a class called ToDoMenu whi...

In this assignment, you should create a class called ToDoMenu which has a main method that contains the code that implements a command-line menu for managing a collection of ToDoIt

Cryptography, Consider the one-time pad encryption scheme to encrypt a 1-bi...

Consider the one-time pad encryption scheme to encrypt a 1-bit message m, and assume m is chosen with uniform distribution from message space M={0,1}. Let E1 be the event "message

Functions, each of the following functions has the form f(x ) = (ax+b) mod ...

each of the following functions has the form f(x ) = (ax+b) mod n. assume that each function has type N base n arrow N base n, so that we can think of f as a cipher for an alphabet

Software engineering, architectural design

architectural design

Software engineering, how will a poorly conducted feasibility study affect ...

how will a poorly conducted feasibility study affect an implemented system

Theory of computation, I define a restricted form of TMs M as follows. Give...

I define a restricted form of TMs M as follows. Given any input x on the tape of M, the initial portion of the tape that holds x is read-only and one-way. That is, M cannot write o

COMPUTERS IN EDUCATION, What is CAI?Explain its pitsfalls

What is CAI?Explain its pitsfalls

Flowchart, create a flowchart showing average score for the 3 quizzes assum...

create a flowchart showing average score for the 3 quizzes assume that there are 3 sections each having 5 students the only valid number to be entered is 1-100 for the quizzes shou

Static ram, STATIC RAM: Flip-Flops are the basic memory cells in a stat...

STATIC RAM: Flip-Flops are the basic memory cells in a static RAM. Each flip-flop is based on either two bipolar transistors or two Metal Oxide Semiconductors Field-Effect Tra

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