Register

Shortest Job First

• edited by
989 views
0 0 votes

 

SJF uses Aging algorithm with $\alpha=\frac{1}{2}$ and $\mathrm{T}_{0}=10 \mathrm{~ms}$. The previous four runs from oldest to most recent are $40,20,40$ and 15 ms . The prediction of next CPU burst time of the process is $\qquad$ .

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · self doubt aptitudeNext → · Lattice
← Previous in category · Full adderNext in category → · DLC madeeasy
Position:
Show:

Related questions

0 0 votes
1 1 answer
2.1k
2.1k views
Mukesh_Kumar asked Dec 30, 2023
2,118 views
Let there are 4 processes P1, P2, P3 and P4 whose arrival time is 0 milliseconds and CPU burst time are 6, 8, 7 and 3 milliseconds respectively. If the operating system uses shortest job first scheduling algorithm, then the difference between waiting time of process P3 and P₁ is 1) 3 milliseconds 2) 6 milliseconds 3) 9 milliseconds 4) 12 milliseconds
2 2 votes
1 1 answer
873
873 views
suvasish pal asked Sep 2, 2017
873 views
Shortest job next
Why sjf is not a practical implementation ?
0 0 votes
2 2 answers
2.1k
2.1k views
Banti Arya asked Jan 27, 2016
2,148 views
job scheduling
A set of ' $n$ ' jobs is given. Associated with job $i$ is an integer deadline $d_{1} \geq 0$ and a profit $P_{i}>0$ and each job need to be executed for one unit of time...
2 2 votes
3 answers 3 answers
3.4k
3.4k views
shreshtha5 asked Nov 22, 2015
3,417 views
job scheduling
We are given eight jobs $J_{1}, J_{2}, \ldots, J_{1}$ and each job requires one unit of execution. Only one job can be executed at a time. Each job has its respective pro...