What are the problems with first come first served scheduling algorithms?

      

What are the problems with first come first served scheduling algorithms?

  

Answers


Chei
It is a non preemptive algorithm which means the process priority doesn’t matter. Thus if high priority process waits,the system will crash because of improper process scheduling.
No optimal average waiting time.
Resource's utilization in parallel is not possible which leads to convoy effect and hence poor resource utilization.

Softwaretech answered the question on April 27, 2019 at 09:40


Next: Describe the reaction of Nitrogen with burning magnesium.
Previous: What is meant by the term convoy effect?

View More Computer Science Questions and Answers | Return to Questions Index


Exams With Marking Schemes

Related Questions