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 s a nonpreemptive priority (a smaller priority number implies a higher priority) 6 RR (q=1) 7. RR (q=3) & 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 P1 0 Time 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
icon
Related questions
Question
Solve problem A and fill out all of the given shorts
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
s a nonpreemptive priority (a smaller priority number
implies a higher priority)
6 RR (q=1)
7. RR (q=3)
& 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
P1 0
Time
P2
1
P3
2
P4
3
P5
4
Average
Transcribed Image Text: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 s a nonpreemptive priority (a smaller priority number implies a higher priority) 6 RR (q=1) 7. RR (q=3) & 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 P1 0 Time P2 1 P3 2 P4 3 P5 4 Average
Expert Solution
steps

Step by step

Solved in 1 steps

Blurred answer
Similar questions
  • SEE MORE 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