Question
In: Computer Science
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, and the priority given in integers (lower numbers represent higher priorities) :
Process Arrival Time Burst Time priority
P1 0 17 2
P2 5 8 3
P3 7 11 1
a. Draw Gantt charts illustrating the execution of these processes using nonpreemptive priority and preemptive priority, and Round Robins scheduling (time quantum = 4 ms).
b. What is the turnaround time of each process for each of the scheduling algorithms in part a?
Solutions
Expert Solution
a.) In Non-Preemptive there will be no context switching between processes whereas in preemptive there will be context switching between processes based on priority given.
b.) The average turn around time(TAT) for Non-preemptive priority is 23ms and for Preemptive priority it is 23.3ms and for Roundrobin priority it is 23.6ms.
venereology answered 7 months agoRelated Solutions
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...
Consider the following set of processes, with the length of the CPU burst given in milliseconds:...
Consider the following set of processes, with the length of the
CPU burst given in milliseconds:
Process
Burst Time
Priority
P1
2
2
P2
1
1
P3
8
4
P4
4
2
P5
5
3
The processes are assumed to have
arrived in the order P1, P2, P3,
P4, P5, all at time 0.
Draw four Gantt charts that illustrate the execution of these
processes using the following scheduling algorithms: FCFS, SJF, non
preemptive priority (a smaller priority number implies...
Consider the following set of processes, with the length of the CPU burst given in milliseconds...
Consider the following set of processes, with the length of the
CPU burst given in milliseconds
Process
Burst Time Priority
P1
2
2
P2
1
1
P3
8
4
P4
4
2
P5
5
3
The processes are assumed to have
arrived in the order P1, P2, P3, P4, P5, all at time 0,
a. Draw four Gantt
charts that illustrate the execution of these processes
using the following scheduling algorithms: FCFS, SJF,
nonpreemptive...
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...
A set of processes along with their burst time in milliseconds is given below. The processes...
A set of processes along with their burst time in
milliseconds is given below. The processes should execute in First
Come First Served order. Assume that the quantum (q) is
3:
Process Burst Time
P1 22
P2 4
P3 12
P4 15
P5 2
Find the average waiting time using the Round Robin
algorithm. Round your answer to 2 decimal places
Consider the set of processes shown in the table above, with the length of the CPU-burst...
Consider the set of processes shown in the table above, with the
length of the CPU-burst time given in milliseconds. The processes
are assumed to have arrived in the order P5, P4,
P3, P2 , and P1, all approximately at
time 0. Draw three Gantt charts illustrating the execution of these
processes using SJF, Round-Robin (quantum size = 3), and a
non-preemptive priority (a smaller priority number implies
a higher priority) scheduling. Calculate average waiting
time of each scheduling. Calculate...
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...
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...
ADVERTISEMENT
ADVERTISEMENT
Latest Questions
- Given the following information for a monopolistic competitor: Demand: P = 78 – 5(Q) Marginal revenue:...
- Why does the auto industry prefer uniform (national) standards for automobile emissions as opposed to regionally...
- GOAL Apply the more general definition of torque. PROBLEM (a) A man applies a force of...
- a) If 8.00 hp are required to drive a 1800-kg automobile at 54.0 km/h on a...
- 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...
ADVERTISEMENT