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 ?

Education and society, mention the aims of education in present scenario

mention the aims of education in present scenario

C++, Ask question #MiniA string S is said to be "Super ASCII", if it contai...

Ask question #MiniA string S is said to be "Super ASCII", if it contains the character frequency equal to their ascii values. String will contain only lower case alphabets (''''a''

Computer organisation, The key characteristics of DRAM?

The key characteristics of DRAM?

String problem, c program to convert S to palindromes with minimum number o...

c program to convert S to palindromes with minimum number of character replacements

Mini computers and micro computers, Mini Computers and Micro Computers: ...

Mini Computers and Micro Computers: The mini computers are intermediate in power, and may function as small mainframe computers. They are often dedicated to a particular purpo

Help for final project, Hello i am a computer science student. now we are g...

Hello i am a computer science student. now we are going to start our final project. we want to work on Google App Inventor and we want to create mobile application. we are two grou

List two i/o virtualization methods, Question 1 List two I/O virtualizatio...

Question 1 List two I/O virtualization methods. Based on different features compare these two methods Question 2 Discuss three areas considered by organizations to secure the

Explain Process States and Process Control Block (PCB), Process States Thr...

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)

Binary codes, Binary Codes: We have seen earlier that digital computer...

Binary Codes: We have seen earlier that digital computers use signals that have two distinct values and there exists a direct analogy between binary signals and binary digits.

Memory management, Memory Management: The purpose of the memory mana...

Memory Management: The purpose of the memory management system is to load programs into memory in such a way as to give each program loaded the memory that it requires for

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