Draw three Gantt charts that illustrate the execution of these processes using FCFS, preemptive Shortest Job First (SJF), and priority scheduling with round robin (quantum - 2) scheduling algorithms. The preemptive SJF does not use the priority to make its decision. ****To avoid confusion here: If a process of highest priority is currently scheduled, and another process of the highest priority class arrives, newly arriving process MUST WAIT UNTIL THE END OF THE QUANTUM OF THE ACTIVE PROCESS. If a process of a lower priority class is currently scheduled, and a process of higher priority class has arrived, the newly arriving process CAN PREEMPT THE ACTIVE PROCESS WITHOUT WAITING UNTIL THE END OF THE QUANTUM.****

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Consider the following set of processes, with the length of the CPU burst given in
milliseconds. In the last column, O denotes the highest priority whereas 2 denotes
the lowest priority level.
Process
Arrival Time (ms)
Burst Time (ms)
Priority
P1
0
10
2
P2
3
3
1
P3
2
0
P4
5
3
0
P5
6
5
1
Draw three Gantt charts that illustrate the execution of these processes using FCFS,
preemptive Shortest Job First (SJF), and priority scheduling with round robin
(quantum = 2) scheduling algorithms.
The preemptive SJF does not use the priority to make its decision.
****To avoid confusion here: If a process of highest priority is currently scheduled,
and another process of the highest priority class arrives, newly arriving process
MUST WAIT UNTIL THE END OF THE QUANTUM OF THE ACTIVE PROCESS. If a
process of a lower priority class is currently scheduled, and a process of higher
priority class has arrived, the newly arriving process CAN PREEMPT THE ACTIVE
PROCESS WITHOUT WAITING UNTIL THE END OF THE QUANTUM.****
Transcribed Image Text:Consider the following set of processes, with the length of the CPU burst given in milliseconds. In the last column, O denotes the highest priority whereas 2 denotes the lowest priority level. Process Arrival Time (ms) Burst Time (ms) Priority P1 0 10 2 P2 3 3 1 P3 2 0 P4 5 3 0 P5 6 5 1 Draw three Gantt charts that illustrate the execution of these processes using FCFS, preemptive Shortest Job First (SJF), and priority scheduling with round robin (quantum = 2) scheduling algorithms. The preemptive SJF does not use the priority to make its decision. ****To avoid confusion here: If a process of highest priority is currently scheduled, and another process of the highest priority class arrives, newly arriving process MUST WAIT UNTIL THE END OF THE QUANTUM OF THE ACTIVE PROCESS. If a process of a lower priority class is currently scheduled, and a process of higher priority class has arrived, the newly arriving process CAN PREEMPT THE ACTIVE PROCESS WITHOUT WAITING UNTIL THE END OF THE QUANTUM.****
What is the turnaround time of P4 for each of the scheduling algorithms:
1. 1
2. 2
3. 3
4. 4
5. 5
6.
6
FCFS
7. 7
Preemptive SJF
8. 8
Priority with RR
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
Transcribed Image Text:What is the turnaround time of P4 for each of the scheduling algorithms: 1. 1 2. 2 3. 3 4. 4 5. 5 6. 6 FCFS 7. 7 Preemptive SJF 8. 8 Priority with RR 9. 9 10. 10 11. 11 12. 12 13. 13 14. 14 15. 15
Expert Solution
steps

Step by step

Solved in 2 steps with 4 images

Blurred answer
Knowledge Booster
Dynamic Multithreading
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education