edited by
578 views
0 votes
0 votes

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$ minutes. Their (externally determined) priorities are $3, 5, 2, 1,$ and $4,$ respectively, with $5$ being the highest priority. For each of the following scheduling algorithms, determine the mean process turnaround time. Ignore process switching overhead.

  1. Round robin.
  2. Priority scheduling.
  3. First-come, first-served $($run in order $10, 6, 2, 4, 8)$.
  4. Shortest job first.

For $(a)$, assume that the system is multiprogrammed, and that each job gets its fair share of the CPU. For $(b)$ through $(d),$ assume that only one job at a time runs, until it finishes. All jobs are completely CPU bound. 

edited by

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
admin asked Oct 25, 2019
567 views
Consider a system in which it is desired to separate policy and mechanism for the scheduling of kernel threads. Propose a means of achieving this goal.
0 votes
0 votes
1 answer
2
1 votes
1 votes
1 answer
4
admin asked Oct 25, 2019
2,101 views
The aging algorithm with $a = 1/2$ is being used to predict run times. The previous four runs, from oldest to most recent, are $40, 20, 40,$ and $15$ msec. What is the pr...