Consider the following set: Processes - Priority - Next CPU burst time (T): P1 20 ms T2 ms T3 ms 4 P2 Priority2 Priority3 Priority4 P3 P4 T4 ms Assign different priorities to the processes", fix the length of the next CPU burst in milliseconds", and answer to the following questions: (i) illustratung the execution of these processes, and calculate the average waiting time (ii) emptive algorithm showing the STARVATION issue: draw the Gantt chart and calculate the average waiting time (iii) same data as in the previous point (where you had starvation) and showing how the OS can solve that issue by aging the processes: draw the Gantt chart and calculate the average waiting time Simulate the NON preemptive priority scheduling algorithm: draw the Gantt chart Add the arrival time for every process, and simulate the corresponding pre- The problem of starvation is solved by AGING. Make a simulation using the

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

Please solve it theory of Operating Systems and not as math/coding.

Consider the following set:
Processes - Priority - Next CPU burst time (T):
P1
4
20 ms
Priority2
Priority3
Priority4
P2
T2 ms
T3 ms
T4 ms
P3
P4
Assign different priorities to the processes", fix the length of the next CPU burst in milliseconds", and
answer to the following questions:
(i)
illustraung the execution of these processes, and calculate the average waiting time
(ii)
emptive algorithm showing the STARVATION issue: draw the Gantt chart and calculate the
average waiting time
(ii)
same data as in the previous point (where you had starvation) and showing how the OS can
solve that issue by aging the processes: draw the Gantt chart and calculate the average waiting
Simulate the NON preemptive priority scheduling algorithm: draw the Gantt chart
Add the arrival time for every process, and simulate the corresponding pre-
The problem of starvation is solved by AGING. Make a simulation using the
time
Transcribed Image Text:Consider the following set: Processes - Priority - Next CPU burst time (T): P1 4 20 ms Priority2 Priority3 Priority4 P2 T2 ms T3 ms T4 ms P3 P4 Assign different priorities to the processes", fix the length of the next CPU burst in milliseconds", and answer to the following questions: (i) illustraung the execution of these processes, and calculate the average waiting time (ii) emptive algorithm showing the STARVATION issue: draw the Gantt chart and calculate the average waiting time (ii) same data as in the previous point (where you had starvation) and showing how the OS can solve that issue by aging the processes: draw the Gantt chart and calculate the average waiting Simulate the NON preemptive priority scheduling algorithm: draw the Gantt chart Add the arrival time for every process, and simulate the corresponding pre- The problem of starvation is solved by AGING. Make a simulation using the time
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

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