Consider the following set of processes, with the length of the CPU-burst time given in milliseconds: In addition to the processes listed above, the system also can enter an idle state (which there is no consumption for CPU resources. This idle state identified as p_idle). This state should be appearing in drawing Gantt Chart whenever the system has no other available processes to run.Each process is assigned a numerical priority, with a higher number indicating a higher relative priority.For each of the scheduling algorithms:FCFS (first come, first serve)Preemptive, Round robin scheduling algorithm: The length of a time quantum is 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue. Draw a Gantt chart to show how these processes would be scheduled.Give the turnaround time (total time from first arrival into ready state until cpu-burst is completed) of each process.Give the waiting time (total time spent in the Ready state) of each process.Give the average waiting time of all the processes. Processburst TimePriorityArrivalP1 cat20400P2 dog253025P3 giraffe253030P4 lion153560P5 tiger105100P6 ant1010105

Average Waiting Time=60+0+15+10+0+0=4.17msUnderstanding the Problem:Processes: We have a set of…

Answered: Process burst Time Priority Arrival P1…

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

See similar textbooks

Related questions

Question

Consider the following set of processes, with the length of the CPU-burst time given in milliseconds:

In addition to the processes listed above, the system also can enter an idle state (which there is no consumption for CPU resources. This idle state identified as p_idle). This state should be appearing in drawing Gantt Chart whenever the system has no other available processes to run.

Each process is assigned a numerical priority, with a higher number indicating a higher relative priority.

For each of the scheduling algorithms:

FCFS (first come, first serve)
Preemptive, Round robin scheduling algorithm: The length of a time quantum is 10 units. If a process is preempted by a higher-priority process, the preempted process is placed at the end of the queue.

Draw a Gantt chart to show how these processes would be scheduled.
Give the turnaround time (total time from first arrival into ready state until cpu-burst is completed) of each process.
Give the waiting time (total time spent in the Ready state) of each process.
Give the average waiting time of all the processes.