Q-1: Draw the Shortest Remaining Time First (with Preemption) and Round Robin (no Preemption) Gannt chart for the following processes. Calculate average wait time for each algorithm using the processes data below. Round Robin uses a time quanta of 3. Process Number PH2RER PO P1 P3 P4 P5 Arrival Time Burst Time to Complete 10 0 3 4 13 25 26 2 6 10 1 3

Q-1: Draw the Shortest Remaining Time First (with Preemption) and Round Robin (no Preemption) Gannt chart for the following processes. Calculate average wait time for each algorithm using the processes data below. Round Robin uses a time quanta of 3. Process Number PH2RER PO P1 P3 P4 P5 Arrival Time Burst Time to Complete 10 0 3 4 13 25 26 2 6 10 1 3

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 snapshot of a system: Allocation Маx Available ABCD ABCD ABCD PO 2001 4212 3321 P1 3121 5252 P2 2103 2316 P3 1312 1424 P4 1432 3665 a. Illustrate that the system is in a safe state by demonstrating an order in which the processes may complete.
Q)Two processes P1, and P2 arrive at time=0 in order and have Process(execution time) as follows. P1(4), P2(2). Find the average waiting time for these processes if they are scheduled as Round Robin with time quanta of 1 unit. a)2 b)1 c)3 d)4 Q)Three processes P1, P2 and P3 arrive at time=0 in order and have Process(execution time) as follows. P1(10), P2(4), P3(7). Find the average response time for these processes if they are scheduled as Shortest Job First. a)12 b)3.3 c)5 d)4 Q)A process has executed 3 ms in its last burst and our estimate of its last burst was 6 ms. Find our estimate for its next burst with a)4 ms b)4.5 ms c)3.5 ms d)5 ms
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,…
Write the Gannt chart for the following processes using Round Robin (RR) algorithm. Time slice -4ms.
Bounded waiting requires that \A bound must exist on the number of times that other processes are allowed to enter their critical sections a) true b) false
Draw the Gantt Chart of the sequence of execution of the processes using Round RobinScheduling Algorithm considering the arrival time for all the process as ‘0’ and the quantum time as ‘3’. Find the average waiting time of the processes.
Consider the following set of four processes. Their arrival time and time to require completing the execution are given in the following table. Consider all times in milliseconds. Implement the SJF algorithm on given chart. Process Arrival Time (T0) Time required for completion (CPU Burst Time) P0 0 10 P1 1 6 P2 3 2 P3 5 4
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 "Shortest Job First" (SJF), specify the execution order of the processes, the average execution time (average turnaround time) and the average waiting time over all processes. You must show your calculations. You will not have to draw Gantt charts.
Six batch jobs arrive almost at the same time in the following order: p1;p2; : : : ;p6. The table below contains their running times and priorities: Job p1 p2 p3 p4 p5 p6Running time (in min) 8 1 5 3 7 4Priority 3 2 5 1 4 6 The highest priority is 6. For each of the following scheduling algorithms, determine the order of execution of processes and mean process turnaround time:(a) priority scheduling;(b) rst-come, rst-served;(c) shortest job rst.Scheduling is non-preemptive.
There are memory partitions in order of 150 KB, 500 KB, 400 KB, 800 KB and 900 KB. Use first fit, best fit, worst fit and next fit algorithms to allocate processes of parameters 90 KB, 417 KB, 212 KB, and 820 KB. Show the pictorial representation
Given the following mix of tasks, task lengths, and arrival times, compute the response time for each task, along with the average response time for the FIFO, RR, and SJF algorithms. Assume a time slice of 20 milliseconds and that all times are in milliseconds. Task 0 1 2 3 4 Length 90 30 40 20 50 Arrival Time 0 15 15 80 85
P and Q are two processes that share a set of variables that is common. The variable includes: seq, tA and tB: Before either process starts to execute, variable seg initially has the value 10. State the possible sets of different values of seg when both processes have finished executing. Provide an order of execution of statements from processes P and Q that would produce each of the values you give. Justify your answer in detail. ... P1: tA = seq + 1; P2: seq tA; Q1: tB = seqt 2; Q2: seq = tB; %3D %3D