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 ?

Greedy and intelligence search, greedy and intelligence search

greedy and intelligence search

Digital to analogue conversion (dac), Digital to analogue conversion (dac):...

Digital to analogue conversion (dac): Since many systems used on aircraft will require outputs in analogue form, it will be necessary to be able to convert the digital informat

Login, Login Because the information on a network is sharable, network...

Login Because the information on a network is sharable, networks are very susceptible to unauthorized intruders. In order to prevent unauthorized access to use the services o

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

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

Describe counting instructions, They are used to reduce or enlarge the cont...

They are used to reduce or enlarge the content of the counters. DEC INC DEC INSTRUCTION Idea: To diminish the operator. Syntax: DEC destiny This action subtracts 1 from the destiny

Write a program to swap two names between two variables, QUESTION (a) W...

QUESTION (a) Write a program to swap two names between two variables for examples: N1 = "Mary Anne" N2 = "Queen Mary". The program should make use of an appropriate Fu

Data mining, Process of Data mining Data mining is an iterative process t...

Process of Data mining Data mining is an iterative process that typically involves the following phases: Problem definition A data mining project starts with the understanding o

What is an abstract data type, QUESTION (a) What is an abstract data ty...

QUESTION (a) What is an abstract data type? (b) Give two limitations of the array implementation of lists. (c) Give the major disadvantage of the dynamic implementation o

Poset , 1. (40 points) Add a course drop method to the system that you impl...

1. (40 points) Add a course drop method to the system that you implemented in Problem Set 1. Modularize your new implementation properly. For any new methods that you introduce: 1.

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