Part I Assume that the ready queue has just received for processes: P1, P2, P3, P4, in that order. All at time 0. The CPU execution times for these processes are as follows: Process Execution Time P1 P2 P3 P4 13 8 15 6 Draw the Gantt chart and calculate the metric listed in parentheses for each of the following scheduling algorithms: 1. First Come, First Served (Total Wait Time) 2. Shortest Job First (Total Wait Time) 3. Round Robin, with a time quantum of 5 ms (Total Wait and Response Times)

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
Part I
Assume that the ready queue has just received for processes: P1, P2, P3, P4, in that order. All at time 0. The
CPU execution times for these processes are as follows:
Process Execution Time
P1
P2
P3
P4
13
8
15
6
Draw the Gantt chart and calculate the metric listed in parentheses for each of the following scheduling
algorithms:
1. First Come, First Served (Total Wait Time)
2. Shortest Job First (Total Wait Time)
3. Round Robin, with a time quantum of 5 ms (Total Wait and Response Times)
Part II
Now assume that P1 arrives in the ready queue at time 0, P2 arrives at time 4, P3 arrives at time 10, and P4
arrives at time 20. The CPU execution times for the processes are the same as in Part I:
Process Execution Time
P1
P2
P3
P4
P1
13
P2
8
P3
15
P4
6
Draw the Gantt chart and calculate the total wait time for each of the following scheduling algorithms:
1. Shortest Job First
2. Shortest Remaining Time Next (remember, this is a preemptive algorithm)
3. Preemptive priority with the following priorities:
Process Priority
3
4
1
2
For this system, assume that the highest priority has the lowest number (i.e., 1 is the most important)
4. Non-Preemptive priority with the same priorities as above. Be sure to note priority inversion when/if it
occurs. Priority inversion is when a process with a lower priority executes over a process with a higher
priority.
Transcribed Image Text:Part I Assume that the ready queue has just received for processes: P1, P2, P3, P4, in that order. All at time 0. The CPU execution times for these processes are as follows: Process Execution Time P1 P2 P3 P4 13 8 15 6 Draw the Gantt chart and calculate the metric listed in parentheses for each of the following scheduling algorithms: 1. First Come, First Served (Total Wait Time) 2. Shortest Job First (Total Wait Time) 3. Round Robin, with a time quantum of 5 ms (Total Wait and Response Times) Part II Now assume that P1 arrives in the ready queue at time 0, P2 arrives at time 4, P3 arrives at time 10, and P4 arrives at time 20. The CPU execution times for the processes are the same as in Part I: Process Execution Time P1 P2 P3 P4 P1 13 P2 8 P3 15 P4 6 Draw the Gantt chart and calculate the total wait time for each of the following scheduling algorithms: 1. Shortest Job First 2. Shortest Remaining Time Next (remember, this is a preemptive algorithm) 3. Preemptive priority with the following priorities: Process Priority 3 4 1 2 For this system, assume that the highest priority has the lowest number (i.e., 1 is the most important) 4. Non-Preemptive priority with the same priorities as above. Be sure to note priority inversion when/if it occurs. Priority inversion is when a process with a lower priority executes over a process with a higher priority.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 3 images

Blurred answer
Knowledge Booster
Parallel Processing
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