scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU

Question

german

2 years ago

8

scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU

bursts.

Computers and Technology

1 answer:

dexar [7] · Answer 1 · 2023-08-20T04:29:21+03:00

SJF scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts.

<h3>What is SJF in operating system?</h3>

SJF is a term that connote Shortest Job First. It is said to be a type of CPU scheduling whose algorithm is linked with each as it is said to process the length of the next CPU burst.

Note that for one to be able to know the time for the next CPU burst to take place, one need to take the SJF into consideration as that is its function.

Hence, SJF scheduling is approximated by predicting the next CPU burst with an exponential average of the measured lengths of previous CPU bursts.

See options below

A) Multilevel queue

B) RR

C) FCFS

D) SJF

Learn more about scheduling from

brainly.com/question/19309520

#SPJ1