Three periodic processes with the following characteristics are to be scheduled: (D is the period and T is the total CPU time) needs to show your work. D T pl 20 5 p2 100 10 p3 120 42 (a) Determine if a feasible schedule exists. (b) Determine how many more processes, each with T = 3 and D=20, can run concurrently under EDF. (c) Determine how many more processes, each with T = 3 and D = 20, can run concurrently under RM.

Three periodic processes with the following characteristics are to be scheduled: (D is the period and T is the total CPU time) needs to show your work. D T pl 20 5 p2 100 10 p3 120 42 (a) Determine if a feasible schedule exists. (b) Determine how many more processes, each with T = 3 and D=20, can run concurrently under EDF. (c) Determine how many more processes, each with T = 3 and D = 20, can run concurrently under RM.

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

3. Job Scheduling: Consider the problem of scheduling n jobs of known durations t1, t2, ..., tn, for execution by a single processor. The jobs can be executed in any order, one job at a time. You want to find a schedule that minimizes the total time spent by all the jobs in the system. (The time spent by one job in the system is the sum of the time spent by this job in waiting plus the time spent on its execution.) Design a greedy algorithm for this problem. Does the greedy algorithm always yield an optimal solution?
Suppose you are given n tasks J = {j1, j2, · · · jn}.Each task ji has two parts - a preprocessing phase which takes pi units and a main phase whichtakes fi units of time. There are n machines that can execute the main phases of the jobs in parallel.However, the preprocessing phases need to be executed sequentially on a special machine. Thecompletion time of any schedule is the earliest time when all tasks have finished execution. Designa greedy algorithm which produces a schedule that minimizes the completion time. Here, youneed to give formal proof of correctness. Your proof should not exceed one side of an A4 sheet.Anything more than that will not be considered by the evaluator. Provide only pseudocode.
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 II 3 45 10 II₁ 35 5 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 are dealing with 6 processes p1;p2; : : : ;p6:(a) Processes p1;p2 in p3 arrive at time 2 ms, respectively. Each of those processesneeds 5 ms of CPU time.(b) Process p4 arrives at time 10 ms and needs 3 ms of CPU time.(c) Processes p5 in p6 arrive at time 19 ms. Process p5 needs 7 ms, while process p6needs 4 ms of CPU time.Scheduling is preemptive, where there process switch takes 1 ms. For the Round-Robinalgorithms with quantum 2 ms illustrate the execution of those processes on a timeline.Then determine the average turnaround time.
26. A system has four processes and five allocatable resources. The current allocation and maximum needs are as follows: Available 00 x 1 1 Allocated Махітит Process A 10 211 11213 Process B 20110 22210 Process C Process D 11010 21310 1111 0 11221 What is the smallest value of x for which this is a safe state?
a. Three processes share four resource units that can be reserved and released only one at a time. Each process needs a maximum of two units. Show that a deadlock cannot occur. b. N processes share M resource units that can be reserved and released only one at a time. The maximum need of each process does not exceed M, and the sum of all maximum needs is less than M + N. Show that a deadlock cannot occur.
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): P2 17 Process Service time (CPU burst) P1 53 P3 68 P4 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.
An operating system has a total of three user processes, and each of these processes uses a total of two units of the resource R. The total number of units that R is used up by the operating system is twelve. The absolute minimal number of R units that must be used to eliminate the possibility of any deadlocks happening is
We have 4 periodical processes II₁, I₂, I3 and П4, that process a video. We know their periods P, and their running times C; (in milliseconds). For: (a) the rate monotonic scheduling (RMS) algorithm and (b) the earliest deadline first (EDF) algorithm draw diagrams that displays the schedule for those processes for a period of 150 ms. The times are the following: Process PC₁ II₁ 45 10 II₂ 40 10 II 3 35 5 II4 50 10 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?
Consider the following 5 processes which are labelled as A, B, C, D and E. Process Arrival Time CPU Cycle PriorityA 0 5 3B 1 2 2C 4 1 5D 5 4 1E 5 2 4 List of processes You are required to draw a timeline Gantt Chart for each of the following CPU schedulingalgorithms. Calculate the average turnaround time and average waiting time for each of thescheduling algorithm respectively.(Note: Assume that larger priority number implies a higher priority) (i) Shortest Remaining Time First (SRTF), Round Robin (assume that time quantum in 3 time slices) and…
Question 1 (Task Scheduling Suppose that we have n tasks to schedule on a computer with a single-core processor where task i takes t, time units to finish. We would like to run all of the n tasks while minimizing the total waiting time for all tasks. Assuming that the first task starts at t = 0, the waiting time wi for task i is the total time before it is started. For example, if we have three tasks with execution times t₁ = 5, t₂ = 3, and t3 = 2 scheduled to run in the order (C1, C2, C3), the waiting times are w₁ = 0, w₂ = 5, and w3 = 5 + 3 = 8. If they are scheduled in the order (C3, C2, C₁), the waiting times become w3 = 0, w22, and w₁ = 2 + 3 = 5. Propose a greedy algorithm that finds the optimal scheduling for the n tasks with the minimum waiting time. Establish the running time of your algorithm. Prove the optimality of your algorithm.
An operating system uses the banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y and Z to three processes P0, P1 and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in safe state. Consider the following independent requests for additional resources in the current state- REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Write a program to check whether: Only REQ1 can be permitted Only REQ2 can be permitted Both REQ1 and REQ2 can be permitted Neither REQ1 nor REQ2 can be permitted