We have 4 periodical processes II₁, I2, I3 and II4, that process a video. We know their periods P, and their running times C; (in milliseconds). For: (a) the earliest deadline first (EDF) algorithm and (b) the rate monotonic scheduling (RMS) algorithm draw diagrams that displays the schedule for those processes for a period of 150 ms. The times are the following: Process P Ci II₁ 60 15 II₂ 40 10 45 10 35 5 II 3 II₁ In the case of equal priorities the process that is already running has the priority. If this is not the case then take the process with the lowest ID. Does any of the above algorithms fail?

We have 4 periodical processes II₁, I2, I3 and II4, that process a video. We know their periods P, and their running times C; (in milliseconds). For: (a) the earliest deadline first (EDF) algorithm and (b) the rate monotonic scheduling (RMS) algorithm draw diagrams that displays the schedule for those processes for a period of 150 ms. The times are the following: Process P Ci II₁ 60 15 II₂ 40 10 45 10 35 5 II 3 II₁ In the case of equal priorities the process that is already running has the priority. If this is not the case then take the process with the lowest ID. Does any of the above algorithms fail?

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

Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority Arrival Time P1 20 2 0 P2 10 1 1 P3 80 4 2 P4 40 2 3 P5 50 3 4 Draw the GANTT Chart for the schedule of the processes, the waiting time for each process, the average waiting time, the turnaround time for each process and average turnaround time using the following scheduling algorithm. c.…
Let the processes P1, P2, P3, and P4 be given. They arrive in the system at the same time in this order. The processes have the following service times (in time units): Process P1 P2 P3 P4 Service time (CPU burst) 53 17 68 24 For the scheduling method "Round Robin" (RR), specify the average execution time (average turnaround time) and the number of context switches. The time quantum q is set to 20 time units. You must show your calculations. You will not have to draw Gantt charts. Note: For RR, processes execute in order of their ID (i.e., P1-P2-P3-P4).
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority Arrival Time P1 20 2 0 P2 10 1 1 P3 80 4 2 P4 40 2 3 P5 50 3 4 Draw the GANTT Chart for the schedule of the processes, the waiting time for each process, the average waiting time, the turnaround time for each process and average turnaround time using the following scheduling algorithm.…
Consider the following set of processes that arrive at time = 0, with the length of the CPU - burst time given in milliseconds and time quantum = 4: 1)Draw the Time chart illustrating the execution of the process using Round Robin scheduling and non preemptive priority scheduling. 2) Find the average waiting time.
Let the processes P1, P2, P3, P4, and P5 be given. They arrive in the system at the same time in this order. The processes have the attached service times (in time units) and priorities. For each of the scheduling methods (First Come, first served (FIFO), Shortest Job First, Round Robin, and Priority Scheduling), specify the execution order of the processes and the average execution time (average turnaround time) for all processes. First, determine and state the execution times of the individual processes and then calculate the average value. Note: • For Shortest Job First, If the required service time (CPU time) is the same for two or more processes, use First Come, first served to resolve the conflict. • For Round Robin, the time quantum q = one time unit. • For Priority Scheduling, low integer priority values signify high priorities, with O being the highest possible priority. If multiple processes have the same priority, use First Come, first served to resolve the conflict. Also,…
2. Consider the following processes with their associated CPU burst times. The processes have entered the system in the order that they are presented in the table. Process : BurstTime P1 : 7 P2 : 1 P3 : 13 P4 : 4 P5 : 5 For each of the following scheduling algorithms, draw a Gantt chart that illustrates the order of execution for each of these processes. Also, compute the average waiting time for each algorithm. a. First Come First Served b. Shortest Job First c. Round Robin (with time quantum of 3)
Consider the following set of processes, with the length of the CPU burst given in milliseconds. Process Burst Time Priority P1 2 2 P2 1 1 P3 8 4 The processes are assumed to have arrived in the order of P1, P2, P3, P4, P5 all at time 0. a. Draw the Gantt charts that illustrate the execution of these processes using the following scheduling algorithms: preemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2). b. What is the turnaround time of each process for each of the scheduling algorithms in part i? c. Which of the algorithms results in the minimum average waiting time (over all processes)?
Consider the following set of processes, with the length of the CPU burst given in milliseconds: Process Burst Time Priority Arrival Time P1 20 2 0 P2 10 1 1 P3 80 4 2 P4 40 2 3 P5 50 3 4 Draw the GANTT Chart for the schedule of the processes, the waiting time for each process, the average waiting time, the turnaround time for each process and average turnaround time using the following scheduling algorithm. b.…
1. Consider the following set of processes, with the length of the CPU burst given inmilliseconds: Process Burst Time PriorityP1 2 2P2 1 1P3 8 4P4 4 2P5 5 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0.a. Draw four Gantt charts that illustrate the execution of these processes using thefollowing scheduling algorithms: FCFS, SJF, nonpreemptive priority (a larger prioritynumber implies a higher priority), and RR (quantum = 2).b. What is the turnaround time of each process for each of the scheduling algorithms inpart a?c. What is the waiting time of each process for each of these scheduling algorithms?d. Which of the algorithms results in the minimum average waiting time (over allprocesses)?
Consider the last 5 alphabets of your name as processes. The size of the process is the ASCII code of the alphabet. If your name has alphabets less than 5 then add P, X, and Z in the end. Size of memory is 500 MB. Having dual core processor show the sequence in which the processes will be loaded in memory. Arrival of first process is at 9 a.m and each process arrives 5 mins after the previous process. The burst time of all processes is 10 and the priority of vowels (i.e. a,e,i,o,u) is 1 and priority of all other processes is 2. Apply the scheduling algorithms to show in which sequence the processes will execute. Calculate the waiting time of each process and average waiting time. What do you think which algorithm works best in the given scenario. Give reason for your answer. Note : My Name is Sufyan
Consider the last 5 alphabets of your name as processes. The size of the process is the ASCII code of the alphabet. If your name has alphabets less than 5 then add P, X, and Z in the end. Size of memory is 500 MB. Having dual core processor show the sequence in which the processes will be loaded in memory. Arrival of first process is at 9 a.m and each process arrives 5 mins after the previous process. The burst time of all processes is 10 and the priority of vowels (i.e. a,e,i,o,u) is 1 and priority of all other processes is 2. Apply the scheduling algorithms to show in which sequence the processes will execute. Calculate the waiting time of each process and average waiting time. What do you think which algorithm works best in the given scenario. Give reason for your answer NOTE : NAME IS " BILAL".
Consider the following set of processes, with the length of the CPU burst given in milliseconds Draw the Gantt Chart and calculate the Waiting time and the turnaround time. Upload the solution as a file