3,065 views

1 Answer

2 votes
2 votes

Answer:

For minimizing the average response time, the processes have to be executed according to the Shortest Job First.
$\begin {align} &0 < \textbf X <= 3: \textbf X, 3, 5, 6, 9\\
&3 < \textbf X <= 5: 3, \textbf X, 5, 6, 9\\
&5 < \textbf X <= 6: 3, 5, \textbf X, 6, 9\\
&6 < \textbf X <= 9: 3, 5, 6, \textbf X, 9\\
&\;\;\;\;\;\;\;\;\; \textbf X > 9: 3, 5, 6, 9, \textbf X  \end {align}$

Related questions

617
views
0 answers
0 votes
admin asked Oct 25, 2019
617 views
Five batch jobs. $A$ through $E$, arrive at a computer center at almost the same time. They have estimated running times of $10, 6, 2, 4,$ and $8$ ... that only one job at a time runs, until it finishes. All jobs are completely CPU bound.
2.2k
views
1 answers
1 votes
admin asked Oct 25, 2019
2,225 views
Measurements of a certain system have shown that the average process runs for a time $T$ before blocking on $I/O$. A process switch requires a time $S$, which is effectively wasted (overhead ... Q > T$S < Q < T $Q = S$Q\: \text{nearly}\: 0$
2.4k
views
1 answers
0 votes
admin asked Oct 25, 2019
2,390 views
Explain how time quantum value and context switching time affect each other, in a round-robin scheduling algorithm.
1.5k
views
3 answers
0 votes
admin asked Oct 25, 2019
1,490 views
Round-robin schedulers normally maintain a list of all runnable processes, with each process occurring exactly once in the list. What would happen if a process occurred twice in the list? Can you think of any reason for allowing this?