Question
OPERATING SYSTEMS Assume you have the following jobs to execute with one processor: i t(p i ) Arrival Time 0 75 0 1 40 10
OPERATING SYSTEMS
Assume you have the following jobs to execute with one processor:
i | t(pi) | Arrival Time |
0 | 75 | 0 |
1 | 40 | 10 |
2 | 25 | 10 |
3 | 20 | 80 |
4 | 45 | 85 |
Suppose a system uses RR scheduling with a quantum of 15.
Create a Gantt chart illustrating the execution of these processes.
What is the turnaround time for process p4?
What is the average wait time for the processes?
Assume you have the following jobs to execute with on processor:
i | t(pi) | Arrival Time |
0 | 75 | 0 |
1 | 40 | 10 |
2 | 25 | 10 |
3 | 30 | 55 |
4 | 45 | 95 |
Suppose a system uses preemptive SJN scheduling.
Create a Gantt chart illustrating the execution of these processes.
What is the turnaround time for process p2?
What is the average wait time for the processes?
Using the table of problem 5, assume the context switch time is five time units with RR scheduling.
Create a Gantt chart illustrating the execution of these processes.
What is the turnaround time for process p3?
What is the average wait time for the processes?
Assume you have the following jobs to execute with one processor:
i | t(pi) | Priority |
0 | 80 | 2 |
1 | 25 | 4 |
2 | 15 | 3 |
3 | 20 | 4 |
4 | 45 | 1 |
The jobs are assumed to arrive at the same time. Using priority scheduling followed by FCFS, do the following:
Create a Gantt chart illustrating the execution of these processes.
What is the turnaround time for process p1?
What is the average wait time for the processes?
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