1. Schedule the following programs with listed workload and burst time and calculate average wait time for each algorithm: use (1) shortest job first, (2) first come first served (processes arrive in order P1 up to P5), (3) first come first served (processes arrive in reverse order P5 down t P1), and (4) Round Robin (assume 4 units of time every round) Process Burst time P1 7 P2 13 P3 8 P4 9 P5 15

1. Schedule the following programs with listed workload and burst time and calculate average wait time for each algorithm: use (1) shortest job first, (2) first come first served (processes arrive in order P1 up to P5), (3) first come first served (processes arrive in reverse order P5 down t P1), and (4) Round Robin (assume 4 units of time every round) Process Burst time P1 7 P2 13 P3 8 P4 9 P5 15

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

Eight batch jobs arrive almost at the same time in the following order: I₁, 2, ..., II8. The table below contains their running times and priorities: Job П1 П2 П3 П4 П П П П Running time (in min) 4 5 5 10 8 10 7 Priority 1 7 5 2 8 6 4 3 The highest priority is 1. For each of the following scheduling algorithms, determine the order of execution of processes and the mean process turnaround time: (a) priority scheduling; (b) first-come, first-served; (c) shortest job first. Scheduling is non-preemptive.
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
Please written by computer source All answers and responses must be written in python code, please dont bother to respond if you respond without python code.
An operating system uses the Banker's algorithm for deadlock avoidance when managing the allocation of three resource types X, Ý, and Z to three processes PO, P1, and P2. The table given below presents the current system state. There are 3 instances of type X, 2 instances of type Y and 2 instances of type Z still available. The system is currently in a safe state. Answer the following questions! Allocation Max X Y z X Y PO 0 1 8 4 3 (a) If PO requests 2 instances of Z during the P1 3 2 current state, can it be granted? Explain! (b) If P1 requests 2 instances of X during the P2 2 1 1 3 3 3 current state, can it be granted? Explain! CO
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,…
Can you please draw the time chart for the schedule? I need time chart. Thanks
Because every computation includes a sequential portion, there is a limit to how much you can speed up a task by adding processors. 3. Suppose a task includes one minute of sequential steps and a parallelizable portion that would take an hour if done sequentially. Fill in this table: Number of Processors C. 1 2 3 4 10 20 30 60 120 240 480 Total Time Required 61 minutes (1 hr + 1 min) 31 minutes (30 min + 1 min) Solution Type sequential solution parallel solutions 4. Consider the law of diminishing returns: a. If you have one processor and you add one more, how much time do you save? b. If you have 240 processors and you add 240 more, how much time do you save? Talk with Your Partner How many processors do you think are worth having for this problem?
the following system of periodic tasks is scheduled and executed according to a cyclic schedule. Choose an appropriate frame size. Preemptions are allowed (e.g. to split longer execution times) but the number of preemptions should be kept small. (9, 5.1, 1, 5.1) (8, 1) (13, 3) and (0.5, 22, 7, 22)
There are 12 processors in a network, each processor stores a different piece of information about a certain task. Assume that the time required to send information from one processor to another processor regardless of its size takes 100 microseconds. It is required that all the information (12 different pieces) about this task be available to all of the 12 processors. a) Find an algorithm to solve this problem in minimum time? b) Calculate its complexity and efficiency? c) Implement the above problem and submit the code.
Do the Round Robin:Quantom=3 scheduling algorithm to the list of processes. The process should provide : a. A detailed gantt chart b. finish time, turnaround time, waiting time c. The average turnaround time d. The average waiting time
Suppose we have three processes P0, P1, and P2. Process P0 executes statement S0 and process P1 executes statement S1 and process P2 executes statement S2. Use wait and signal to ensure the following: S2 is always executed before S1 and S1 is always executed before S0S0.
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