Question #58556
which of the following scheduling algorithms is a type of priority scheduling algorithm?
shortest-job-first
first-come-first-served
round-robin
none of the above
shortest-job-first
first-come-first-served
round-robin
none of the above
Expert's answer
The basic idea is straightforward: each process is assigned a priority, and priority is allowed to run. Equal-Priority processes are scheduled in FCFS order. The shortest-Job-First (SJF) algorithm is a special case of general priority scheduling algorithm.
An SJF algorithm is simply a priority algorithm where the priority is the inverse of the (predicted) next CPU burst. That is, the longer the CPU burst, the lower the priority and vice versa.
Answer: shortest-job-first.
An SJF algorithm is simply a priority algorithm where the priority is the inverse of the (predicted) next CPU burst. That is, the longer the CPU burst, the lower the priority and vice versa.
Answer: shortest-job-first.
