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?

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter13: Structures

Section: Chapter Questions

Problem 4PP

See similar textbooks

Similar questions

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?
As a teaching administrator of the department, your responsibility is to schedule the classes for a particular classroom. Suppose there are n classes, each class i is represented by its start time and finishing time [Si, fi], and we say that two classes i and j are non-conflicting if they do not overlap in time (i.e., sizfj or szfi). You want to schedule as many classes for the classroom as possible, but the scheduled classes should be non-conflicting. Develop an algorithm so that you can select the maximum number of classes for the classroom. (We are expecting either pseudocode or language description of your algorithm)
Computer Science Suppose that we have a set of 4 single tasks (not periodic), with arrival times Ak, deadlines Dk, and computation times are as follows: V. -16 AK 10 C DR 18 T1 T2 T3 T4 4 28 12 6. 17 3 3 13 Generate a graphical representation of schedules for this task set, using Earliest Deadline First (EDF). Show timelines for the arrivals of all tasks, and the final EDF schedule. Determine whether, or not, this task- set is schedulable using EDF. Indicate any tasks that do not meet their deadlines.
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? (Hint: You may get a clue from Prim’s Algorithm)
(i) Describe Banker’s algorithm for deadlock avoidance with supporting example Consider a computer system with has four identical units of a resource R. There are three processes each with a maximum claim of two units of resource R. Processes can request these resources in anyway, that is, two in one shot or one by one. The system always satisfies a request a request for a resource if enough resources are available. If the process doesn’t request any other kind of resource, show that the system never deadlock Give a solution for the following synchronization problem using semaphores Producer- Consumer Problem Readers- Writers Problem List out the issues in preprocessor scheduling that causes performance degradation in multiprocessor systems
BRACU has n students who are regular competitive programmers. According to the ACM ICPC rules, each person can participate in the regional championship 6. at most 5 times. The head of the BRACU ACM Chapter is recently gathering teams to participate in this championship. Each team must consist of exactly three people, at that, any person cannot be a member of two or more teams. What maximum number of teams can the head make if he wants each team to participate in the world championship with the same members at least k times? The first line of input contains two integers, n and k. The next line contains n integers: yly2.yn (0syis5), where yi shows the number of times the ihperson participated in the ACM ICPC Regional. Write a python program that prints how many teams can be formed according to the above problem statement. Sample Input 1 52 04510 Sample Input 2 Sample Output 1 6 4 Page 7 / 10 012345
Consider a computer system which has four identical units of a resource R. There are three processes each with a maximum claim of two units of resource R. Processes can request these resources in any way that is, two in one shot or one by one. The system always satisfies a request for a resource if enough resources are available. If the processes don't request any other kind of resource, show that the system never deadlocks?
without out vectors .. using c++ ..Given a set of activities and the starting and finishing time of each activity, find themaximum number of activities that can be performed by a single person assuming that aperson can only work on a single activity at a time.This problem is called the activity selection problem, which concerns the selection ofnon-conflicting activities to perform within a given time frame, given a set of activities eachmarked by a start and finish time. Input:11{1, 4}, {3, 5}, {0, 6}, {5, 7}, {3, 8}, {5, 9}, {6, 10}, {8, 11}, {8, 12}, {2, 13}, {12, 14}Output:4{1, 4}, {5, 7}, {8, 11}, {12, 14}
Question Harry has a big wall clock, that got hit while he was playing. Now, the minute hand doesn't rotate by the angle 2t/3600 each second, but now it moves according to different angle x. You can assume that coordinates of the centre of the clock are (0, 0) and the length of the minute hand is I. One endpoint of the minute hand is always located at the clock centre; the other endpoint is initially located at the point (0, 1). One second later, Harry observes that this endpoint is at distance d above the x-axis, i.e., the y-coordinate of this endpoint is equal to d. Harry is curious about where the minute hand will be (specifically, its y-coordinate) after t seconds. Because t can be very large, Harry can't wait for that moment. Please help him to write a python code that prints a single line containing the output. Input: 422 Output 4
a) Explain on Simulated Annealing algorithm behaves at very high temperatures, and how it behaves at very low temperatures. (b) Imagine the implementation of Simulated Annealing algorithm in real life. Let's say, you have a caretaker at your home. Your home has a garden and it has a fountain with a network of pipes that contains 150 faucets. You informed your caretaker that you are going for short holiday to Langkawi for 3 days and when you return you would like the fountain to spray as high as possible. Your caretaker knows that it is impossible to check all faucets within 3 days to obtain an optimal setting. You can use Simulated Annealing algorithm to maximize the height of the fountain, also can assume whether a faucet can be ON or OFF and measuring the water height. Adding to that, you can make any other assumptions required for this scenario, explain clearly using Simulated Annealing algorithm.
1),. Given the following descriptions of FSA, please answer the following questions. Q = {90, 91, 92, 93} I = {a,b} A = {91,92} The transition function is defined below: 8(90, a) = 91 8(92, a) = 92 a. Draw a diagram of this FSA. b. Give a state transition table of this FSA. 8(90, b) = 93 8(92, b) = 93 8(9₁, a) = 91 8(93, a) = 92 8(91, b) = 92 8(93, b) = 93
thermostat, which will turn the heat on when the room temperature drops h degrees below its set point, Ts, and cuts heat off at a temperature h degrees higher than Ts . The system heats at a constant rate Q (thermal units per time unit), and the volume of the room is V, so, if the room were perfectly insulated, the heating system would raise the temperature of the room at the rate KVQ (degrees per time unit), where K is a constant of proportionality giving the change in temperature per thermal unit per unit volume. However, there is a heat loss to the outside that is proportional to the difference in temperature between the room and the outside. Using the modified Euler method, write a FORTRAN program to simulate this system, if the room temperature at time is T(t), T(0) = To, and the outside temperature, Tout' is given by: Case (1) : Tout is constant < Ts Case (2) : Tout = A sin(wt + 4)| , %3D reflecting daily cycles. A is temperature range, 2n/w is the period of a cycle, and o is the…