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 ?

Describe the binary search algorithm, QUESTION 1 Describe the binary se...

QUESTION 1 Describe the binary search algorithm using an example of your own. QUESTION 2 (a) By showing all your workings, give a big-O estimate for f(x) = (x + 1)lo

Bus structure, which computer architecture use single bus structure??????? ...

which computer architecture use single bus structure??????? tells the name and little bit working

Database design, design railway maintenance system. draw er diagram.

design railway maintenance system. draw er diagram.

Probability, Suppose that of 100 computers checked for viruses 30 where inf...

Suppose that of 100 computers checked for viruses 30 where infected and 70 where not. If we select 10 computers at random what is the probability that at most 4 of them are infecte

What is a Process and process mangemen in operating system? , A process is ...

A process is a chronological program in execution. The constituents of a process are the following: • The object program to be executed ( described the program text in UNIX) • Th

Short program to practice assembly language loops, Purpose of Code This...

Purpose of Code This is a short program to practice assembly language loops and if/else statements. You will use various jump commands and the cmp instruction.  The progra

What is a middleware, QUESTION (a) Using diagrams, describe the 2-tier ...

QUESTION (a) Using diagrams, describe the 2-tier and 3-tier architectures. (b) What is a middleware? Explain the functions of a middleware. Give two examples of middleware.

CS310, Ask question #Minimashdhdghfdgdfgdsgfdsgdsgdgdfgdgfdgdfgdfgdfsgfdsgd...

Ask question #Minimashdhdghfdgdfgdsgfdsgdsgdgdfgdgfdgdfgdfgdfsgfdsgdfsgum 100 words accepted#

ASSIGNMENTS, A STAIRCASE LIGHT IS CONTROLLED BY TWO SWITCHES ONE AT THE TOP...

A STAIRCASE LIGHT IS CONTROLLED BY TWO SWITCHES ONE AT THE TOP OF THE STAIRS AND ANOTHER AT THE BOTTOM OF STAIRS

About execution cycle, One time a program is in memory it has to be execut...

One time a program is in memory it has to be executed. To do this, each instruction must be appeared at, decoded and acted upon in turn until the program is finished. This is accom

Write Your Message!

Captcha
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!

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