Question
Assume four jobs with arrival time, CPU burst times and I/O wait times as shown below: Job Arrival time CPU burst time I/O wait time
Assume four jobs with arrival time, CPU burst times and I/O wait times as shown below:
Job | Arrival time | CPU burst time | I/O wait time |
A | 4 | 2 | |
4 | |||
4 | |||
B | 1 | 4 | |
2 | |||
3 | |||
C | 3 | 1 | |
D | 0 | 5 |
Assuming that the Shortest Remaining Time First (SRTF - preemptive version of Shortest Job First) scheduling policy is used to schedule job CPU bursts, choose the job that will be scheduled in each of the time slot starting at each of the times indicated in the table below. If no job is scheduled in a given time slot, choose "-". Convention: if two jobs have the same remaining time, choose job that arrived earlier first.
0 | [ Select ] ["A", "B", "C", "D", "-"] |
1 | [ Select ] ["A", "B", "C", "D", "-"] |
2 | [ Select ] ["A", "B", "C", "D", "-"] |
3 | [ Select ] ["A", "B", "C", "D", "-"] |
4 | [ Select ] ["A", "B", "C", "D", "-"] |
5 | [ Select ] ["A", "B", "C", "D", "-"] |
6 | [ Select ] ["A", "B", "C", "D", "-"] |
7 | [ Select ] ["A", "B", "C", "D", "-"] |
8 | [ Select ] ["A", "B", "C", "D", "-"] |
9 | [ Select ] ["A", "B", "C", "D", "-"] |
10 | [ Select ] ["A", "B", "C", "D", "-"] |
11 | [ Select ] ["A", "B", "C", "D", "-"] |
12 | [ Select ] ["A", "B", "C", "D", "-"] |
13 | [ Select ] ["A", "B", "C", "D", "-"] |
14 | [ Select ] ["A", "B", "C", "D", "-"] |
15 | [ Select ] ["A", "B", "C", "D", "-"] |
16 | [ Select ] ["A", "B", "C", "D", "-"] |
17 | [ Select ] ["A", "B", "C", "D", "-"] |
18 | [ Select ] ["A", "B", "C", "D", "-"] |
19 | [ Select ] ["A", "B", "C", "D", "-"] |
Assuming that the Round Robin (RR) scheduling policy with a quantum size of 2 units is used to schedule job CPU bursts, choose the job that will be scheduled in each of the time slot starting at each of the times indicated in the table below. If no job is scheduled in a given time slot, choose "-".
Conventions:
1. If a job finishes before the end of its quantum, finish that quantum and begin a new one immediately.
2. If a job finishes its quantum at the same time as a new job (i.e., a new CPU burst for a job) arrives, place the job that just finished its quantum ahead of the newly arriving job in the job queue.
0 | [ Select ] ["A", "B", "C", "D", "-"] |
1 | [ Select ] ["A", "B", "C", "D", "-"] |
2 | [ Select ] ["A", "B", "C", "D", "-"] |
3 | [ Select ] ["A", "B", "C", "D", "-"] |
4 | [ Select ] ["A", "B", "C", "D", "-"] |
5 | [ Select ] ["A", "B", "C", "D", "-"] |
6 | [ Select ] ["A", "B", "C", "D", "-"] |
7 | [ Select ] ["A", "B", "C", "D", "-"] |
8 | [ Select ] ["A", "B", "C", "D", "-"] |
9 | [ Select ] ["A", "B", "C", "D", "-"] |
10 | [ Select ] ["A", "B", "C", "D", "-"] |
11 | [ Select ] ["A", "B", "C", "D", "-"] |
12 | [ Select ] ["A", "B", "C", "D", "-"] |
13 | [ Select ] ["A", "B", "C", "D", "-"] |
14 | [ Select ] ["A", "B", "C", "D", "-"] |
15 | [ Select ] ["A", "B", "C", "D", "-"] |
16 | [ Select ] ["A", "B", "C", "D", "-"] |
17 | [ Select ] ["A", "B", "C", "D", "-"] |
18 | [ Select ] ["A", "B", "C", "D", "-"] |
19 | [ Select ] ["A", "B", "C", "D", "-"] |
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started