Question
In: Computer Science
Consider the following processes that came at time zero with the following order of arrival with...
Consider the following processes that came at time zero with the following order of arrival with the given CPU burst time. Draw the chart for average turnaround time, average wait time, and average response time versus the time quantum 1,2,3,4,5,6 and 7 using a round-robin CPU scheduling algorithm.
Processes CPU Burst Time
P1 6
P2 3
P3 1
P4 7
Solutions
Expert Solution
1) time quantum=1
2) time quantum=2
3) time quantum=3
4) time quantum=4
5) time quantum=5
6) time quantum=6
7) time quantum=7
Please
comment in case of doubts or queries.
Kindly upvote if you found it useful :)
venereology answered 1 year agoRelated Solutions
1. Consider the following set of processes, with the length of CPU burst and arrival time...
1. Consider the following set of processes, with the length of
CPU burst and arrival time given in
milliseconds.
Process
Burst time Priority
Arrival
Time
P1
10
3
0
P2
1
1
2
P3
2
4
4
P4
5
2
8
a)
Draw the Gantt chart that illustrates the execution of these
processes using the preemptive priority scheduling
algorithm (a smaller priority number implies a higher
priority).
b)
What...
Consider following four processes arriving in the order of P1, P2, P3 and P4. Process Arrival...
Consider following four processes arriving in the order of P1,
P2, P3 and P4.
Process Arrival Time CPU burst Time
P1
0.0 6
P2
0.0
8
P3
0.0
7
P4
0.0
3
What is the average waiting time for RR scheduling (time quantum
= 5)?
What is the average waiting time for SJF scheduling?
What is the average waiting time for FCFS scheduling?
6. Consider the following set of processes P1, P2, P3, P4. Process Burst Time Arrival Time...
6. Consider the following set of processes P1, P2, P3, P4.
Process Burst Time Arrival Time Priority
P1 3 0 1
P2 5 1 2
P3 8 3 3
P4 4 4 2
a) Draw Gantt charts that illustrate the execution of these
processes using the following scheduling algorithms: first-come,
first-served (FCFS), priority scheduling (larger number=high
priority), and Round-Bobin (RR, quantum=2).
b) Compute the average waiting time, turnaround time for the three
algorithms. Turnaround time – amount of time to...
There are 4 processes with different arrival time and service time. Process Arrival Service A 0...
There are 4 processes with different arrival time and service
time.
Process
Arrival
Service
A
0
10
B
3
4
C
5
6
D
7
2
a. Use FCFS, RR(4), SPN, SRT, and HRRN to schedule them. Calculate
the waiting time and turnaround time for each process and the
average turnaround time for each algorithm.
b. Compare all the 5 algorithms. Considering the overhead time
for each scheduling takes 1 time unit, which is the best? If the
overhead takes...
You are given the following processes with CPU-burst time, arrival time and priority (lower # means...
You are given the following processes with CPU-burst time,
arrival time and priority (lower # means higher priority)
Process
CPU-burst
Arrival time
Priority
P1
12
0
5
P2
6
6
2
P3
9
1
2
P4
14
3
1
P5
7
5
4
For each of the following scheduling algorithm, show (using the
diagram as in the slides), how the process are being executed. Also
calculate the average wait time.
Shortest job first (non-preemptive)
Shortest remaining job first (preemptive)
Priority-based...
Create a scheduler that takes unlimited processes. It will ask for number of jobs, arrival time,...
Create a scheduler that takes unlimited processes. It will ask
for number of jobs, arrival time, and CPU burst time. It should use
FCFS, SJF, and SRTF methods. It should also print out the gantt
chart, waiting time, and turn around time for each of the
processes. Please solve using Java.
Suppose that the following processes arrive for execution at time 0 in the order A, B,...
Suppose that the following processes arrive for execution at
time 0 in the order A, B, C:
process
Run Time
Priority
A
4
1=high
B
2
3=low
C
3
2=medium
Determine the execution order (with the time marks) of these
process using the following 4 schedulings: FCFS, SJF, a
non-preemptive priority, and RR (time slice = 2).
What is the waiting time of each process for each of the
scheduling algorithm? Which scheduling algorithm achieves the
shortest average waiting time?
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:...
Consider the following set of processes, with the length of the
CPU-burst time given in milliseconds:
Process Burst
Time
P1 5
P2 3
P3 1
P4 7
P5 4
The processes are assumed to have arrived in the order
P1, P2, P3, P4, P5,
all at time 0.
If FCFS scheduling is used, what is the average turnaround time
of these processes?
Answer:
Consider the following set of processes, with the length of the
CPU-burst time given in milliseconds:
Process Burst
Time
P1 5
P2 3
P3 1
P4 7
P5 4 ...
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:...
Consider the following set of processes, with the length of the
CPU-burst time given in milliseconds:
Process Arrival Time Burst Time
P1 0 5
P2 2 3
P3 3 2
P4 4 4
P5 5 3
a. Draw Gantt charts illustrating the execution of these
processes using SJF pre-emptive
b. What is the turnaround time of each process for each of the
scheduling algorithms
c. What is the waiting time of each process for each of the
scheduling algorithms
Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:...
Consider the following set of
processes, with the length of the CPU-burst time given in
milliseconds:
Process
Burst Time
Priority
Arrival
Time
P1
10
3
0
P2
1
1
12
P3
2
4
0
P4
1
5
0
P5
5
2
0
In the above table, a smaller priority
number implies a higher priority. Suppose that these processes are
scheduled by the priority policy with preemption.
Draw the Gantt chart (i.e., time chart) illustrating the
execution of these processes.
What...
ADVERTISEMENT
ADVERTISEMENT
Latest Questions
- 23- Celsius Corp. is conducting a capital budgeting analysis to decide whether to invest in a...
- Using energy level diagrams, predict the relative stability of a Br2 molecule as well as the...
- A 0.0038 kg leaf falls 16.8 m to the ground, where it lands with a speed...
- Problem 1: In the figure to the right, m1=20.0kg and α=53.1o . The coefficient of kinetic...
- A palindrome is a string whose reversal is identical to the string. For example, 110010011 is...
- Explain how the shape of the load duration curve for a particular system affects the selection...
- For physics discussion post. Please TYPE the response as I struggle with reading written information. Explain...
ADVERTISEMENT