Priority queue You have been asked to test the effectiveness of the following di
ID: 3803707 • Letter: P
Question
Priority queue You have been asked to test the effectiveness of the following different scheduling algorithms for different types of queuing applications. First-In-First-Out (FIFO): The jobs arc processed in the arriving order. I he job at the front of the queue is served until it has completed. That job is then removed from the queue. The next job at the front of the queue is served until it has completed and then it is removed from the queue. This process is continued until the queue is empty. Shortest-Job-First (SJF): The job with the shortest processing time is processed first until it has completed. That job is then removed from the queue. The next job with smallest processing is then served until it has completed and then it is removed from the queue. This process is continued until the queue is empty.Explanation / Answer
Basically, First come first serve algorithm comprises with the approach of providing the control to the process on the basis of there arrival time.This approach is basically simple,easy but also first come first serve scheduling method is nonpreemptive, which means process will run till it completes Because of this nonpreemptive scheduling, short processes may sometimes goes to starvation
Where as shortest job first provides the control to the process who need less time in processing this approach minimizes average waiting time.also there is high .
FIFO can be better than SJF only in some limited scenarios include when job pool contains large number of process with large burst jobs and very less with short jobs and also when job pool contains a large number of short burst jobs and very less long jobs.
Where as SJF is better than FIFO and can be effectively used with interactive processes where there is genrally a alteration between waiting and execution.Also, SJF is better where there is a accurate estimation of running time is provided.
Both of this scheduling algorithms can be used in multiple queue scheduling and also used in multiple feedback queue scheduling
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.