Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Arrival Time ☐ CPU Burst Time/ Service Time/ Processing Time 3 Priority P1 0 2 P2 1 5 3 P3 2 2 1 P4 3 3 3 P5 4 4 4 a) Draw the Gantt charts illustrating the execution of these processes using: 1. FCFS 2. SJF (SPN) 3. SRT 4. HRRN 5. a nonpreemptive priority (a smaller priority number implies a higher priority) 6. RR (q= 1) 7. RR (q=3) 8. Combining RR (q=2) and priority scheduling 9. Feedback (q=1) 10. Feedback (q=2') b) Fill out the following table for each of the scheduling algorithms in part a. Process Arrival Starting Completion Response Waiting Turnaround Time Time Time Time Time Time P1 0 P2 1 P3 2 P4 3 P5 4 Average
Consider the following set of processes, with the length of the CPU burst time given in milliseconds: Process Arrival Time ☐ CPU Burst Time/ Service Time/ Processing Time 3 Priority P1 0 2 P2 1 5 3 P3 2 2 1 P4 3 3 3 P5 4 4 4 a) Draw the Gantt charts illustrating the execution of these processes using: 1. FCFS 2. SJF (SPN) 3. SRT 4. HRRN 5. a nonpreemptive priority (a smaller priority number implies a higher priority) 6. RR (q= 1) 7. RR (q=3) 8. Combining RR (q=2) and priority scheduling 9. Feedback (q=1) 10. Feedback (q=2') b) Fill out the following table for each of the scheduling algorithms in part a. Process Arrival Starting Completion Response Waiting Turnaround Time Time Time Time Time Time P1 0 P2 1 P3 2 P4 3 P5 4 Average
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
Related questions
Question
Solve A and B
Consider the following set of processes, with the length of the CPU burst time given in milliseconds:
Process
Arrival Time
CPU Burst Time/ Service Time/
Processing Time
Priority
P1
0
3
2
P2
1
5
3
P3
2
2
1
P4
3
3
3
P5
4
4
4
a) Draw the Gantt charts illustrating the execution of these processes using:
1. FCFS
2. SJF (SPN)
3. SRT
4. HRRN
5. a nonpreemptive priority (a smaller priority number implies a higher priority)
6. RR (q= 1)
7. RR (q= 3)
8. Combining RR (q=2) and priority scheduling
9. Feedback (q=1)
10. Feedback (q=2i)
b) Fill out the following table for each of the scheduling algorithms in part a.
Process
Arrival Time
Starting Time
Completion Time
Response Time
Waiting Time
Turnaround Time
P1
0
P2
1
P3
2
P4
3
P5
4
Average
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step 1: Informing about important notice :
VIEWStep 2: Drawing Gantt chart and filling table for FCFS algorithm :
VIEWStep 3: Drawing Gantt chart and filling table for SJF algorithm :
VIEWStep 4: Drawing Gantt chart and filling table for SRT algorithm :
VIEWStep 5: Drawing Gantt chart and filling table for HRRN algorithm :
VIEWStep 6: Drawing Gantt chart and filling table for non-preemptive priority algorithm :
VIEWSolution
VIEWStep by step
Solved in 7 steps with 5 images
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education