Part IAssume that the ready queue has just received for processes: P1, P2, P3, P4, in that order. All at time 0. TheCPU execution times for these processes are as follows:Process Execution TimeP1P2P3P4138156Draw the Gantt chart and calculate the metric listed in parentheses for each of the following schedulingalgorithms: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 IINow assume that P1 arrives in the ready queue at time 0, P2 arrives at time 4, P3 arrives at time 10, and P4arrives at time 20. The CPU execution times for the processes are the same as in Part I:Process Execution TimeP1P2P3P4P113P28P315P46Draw the Gantt chart and calculate the total wait time for each of the following scheduling algorithms:1. Shortest Job First2. Shortest Remaining Time Next (remember, this is a preemptive algorithm)3. Preemptive priority with the following priorities:Process Priority3412For 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 itoccurs. Priority inversion is when a process with a lower priority executes over a process with a higherpriority.

The CPU scheduling algorithm is used to decide which processes will be allocated to the CPU. The…

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 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

See similar textbooks

Similar questions

Q7
10.Consider the following set of processes, the length of the CPU burst time given in milliseconds: Process Burst time: P1 6 P2 8 P3 7 P4 3 Assuming the above process being scheduled with the SJF scheduling algorithm: a) The waiting time for process P1 is 3ms. b) The waiting time for process P1 is 0ms. c) The waiting time for process P1 is 16ms. d) The waiting time for process P1 is 9ms. Page 2 of 8
***please answer asap, upvote gauranteed
The following processes are being scheduled using a priority (a smaller priority number implies a higher priority) and shortest job first all preemptive scheduling algorithms. Process Priority Burst Arrival P1 50 30 0 P2 40 35 25 P3 40 35 30 P4 45 25 60 P5 15 20 100 P6 20 20 105 i. Draw the Gantt charts that illustrate the execution of these processes using the above scheduling algorithms. ii. What is the turnaround time of each process for each of the scheduling algorithms in part a? iii. What is the waiting time of each process for each of these scheduling algorithms? iv. Which of the algorithms results in the minimum average waiting time (over all processes)?
Real-time Scheduling: Pick all verifiable claims. Time is divided into equal portions using Rate Monotonic (RM) scheduling, which necessitates that each process first seek a chunk. Real-time systems with CPU utilisation below one are scheduled by RM. Earliest Deadline First (EDF) may schedule a real-time system when CPU utilisation is less than 1. Every pth time unit, a new process is started. Shorter processes are prioritised through RM scheduling. The quickest procedures are given priority in EDF scheduling.
(D) Add a new task Z with period T=100, D=T, and execution time C=x to the following task set. What is the maximum value of x such that the new task set is guaranteed to be schedulable for EDF scheduling algorithm based on utilization bound test? Task Period T [ms] Deadline D [ms] Execution time C [ms] A 7 7 2 14 14 18 18 6. 3. B.
Problem 2 Most scheduling analysis techniques assume the worst-case execution time (WCET) to model the computational demand of a real-time task. Assume that: o Each declaration statement costs 1 µs to execute. o Each assignment statement costs 1 us to execute. o The assignment of initial values to elements of arrays also costs 1 us regardless of the number of elements. O A function call costs 2 us plus WCET for the function. o Each compare statement costs 2 us. o Each addition and subtraction operation costs 3 us. o Each multiplication and division operation costs 4 us. o Each return statement costs 2 us. Each modulo operation costs 5 us. The function abs( ) is predefined and costs 5 us. o Assume that the overhead to call function abs( ) is already included in its WCET estimation. o Reading a value of an array element costs 0 us. I/ % reminder int main() char Flag; int result; int P; int Q: int find; int count; int data [6] = {1, 2, 3, 4, 5, 6}; count = 6; P=-163; Q = 12; Flag = 'F';…
The following processes are being scheduled using a priority (a smaller priority number implies a higher priority) and shortest job first all preemptive scheduling algorithms. Process Priority Burst Arrival P1 50 30 0 P2 40 35 25 P3 40 35 30 P4 45 25 60 P5 15 20 100 P6 20 20 105 Draw the Gantt charts that illustrate the execution of these processes using the above scheduling algorithms. What is the turnaround time of each process for each of the scheduling algorithms in part a? What is the waiting time of each process for each of these scheduling algorithms? Which of the algorithms results in the minimum…
d) Multilevel Queue Scheduling with Feedback Q3) Consider three CPU-intensive processes, which require 20, 10 and 3 time units and arrive at times 0, 2 and 6, respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. (Explain your answer)
The following processes are being scheduled using a priority (a smaller priority number implies a higher priority) and shortest job first all preemptive scheduling algorithms. Process Priority Burst Arrival P1 50 30 0 P2 40 35 25 P3 40 35 30 P4 45 25 60 P5 15 20 100 P6 20 20 105 Draw the Gantt charts that illustrate the execution of these processes using the above scheduling algorithms. What is the turnaround time of each process for each of the scheduling algorithms in part a? What is the waiting time of each process for each of these scheduling algorithms? Which of the algorithms results in the minimum average…
Suppose that the following processes arrive for execution at the times indicated. Each process will run for the amount of time listed. In answering the questions, use preemptive scheduling, and base all decisions on the information you have at the time the decision must be made. Process P1 P2 P3 P4 P5 Arrival Time 0 2 4 6 8 Burst Time 12 4 8 2 6 What is the average waiting time for these processes with the Shortest-Job-First scheduling algorithm?
Consider the following set of processes, with arrival times and the length of the CPU burst time given in milliseconds. a. Draw a Gantt chart that illustrates the execution of these processes using the Shortest-Remaining Time First (SRTF) scheduling algorithm. b. Give the average waiting time of Shortest-Remaining Time First (SRTF) scheduling algorithm. Note: Preempted processes are added to the end of the ready queue. Process Arrival Time Burst Time A 4 B 1 3 1 D 3 4 3