Three processes P1, P2 and P3 with related information are given in the following table: Process Burst Time (ms) Arrival Time(ms) P1 60 0 P2 40 10 P3 T 30 T is a positive integer (T>0). If you use a preemptive shortest job first scheduling algorithm to schedule the three processes, make a Gantt chart, and calculate different waiting times of three processes for all possible cases. Please show a professional perfect and complete solution with necessary details. (Operating Systems)

Three processes P1, P2 and P3 with related information are given in the following table: Process Burst Time (ms) Arrival Time(ms) P1 60 0 P2 40 10 P3 T 30 T is a positive integer (T>0). If you use a preemptive shortest job first scheduling algorithm to schedule the three processes, make a Gantt chart, and calculate different waiting times of three processes for all possible cases. Please show a professional perfect and complete solution with necessary details. (Operating Systems)

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter9: Integer Programming

Section: Chapter Questions

Problem 28RP

See similar textbooks

Similar questions

2 Assume that we are using SJF scheduling and we have the following schedule of arriving transactions and durations Job Name Arrival Time Duration A 1 10 B 0 13 C 0 100 Please complete the following measures (round each answer to the closest integer, if necessary) What is the average turnaround time (show your work)? What is the average response time (show your work)?
Given that there are FIVE (5) processes (A, B, C, D and E) and FOUR (4) resources (R1, R2,R3 and R4) involved in a project. Assume that all the resources are non-sharable and the number of instances for each resource is 2, 3, 2, 3 respectively. *Process A holds one instance of R1, R2 and R4. It requests one instance of R3.* Process B holds one instance of R1 and R3. It requests one instance of R4.* Process C holds one instance of R2 and R4.* Process D holds one instance of R2 and R4. It requests one instance of R1.* Process E holds one instance of R3. It requests one instance of R2. (i) Draw a directed resources allocation graph for the above scenario and Are these five processes in a deadlock state? Justify your answer.
Observe the table (picture) and do the following: Draw a Gantt Chart for the following scheduling policies: 1. First Come First Served (FCFS) 2. Shortest Remaining Time First (SRTF - preemptive version of Shortest Job First) Convention: if two jobs have the same remaining time, choose job that arrived earlier first. 3. Round Robin (RR) scheduling policy with a quantum size of 2 units. Conventions: 1. If a job finishes before the end of its quantum, finish that quantum and begin a new one immediately. 2. If a job finishes its quantum at the same time as a new job (i.e., a new CPU burst for a job) arrives, place the job that just finished its quantum ahead of the newly arriving job in the job queue.
I need an explanation when 2 schedules are conflict equivalent, with examples of conflict equivalent schedules.And examples where 2 schedules are not conflict equivalent. Please, be simple. Here is the Theorem, but I need someone to explain it better and use real example.
Alert dont submit AI generated answer. 1.Priority Pre-emptive scheduling – compute the average waiting time and the average turnaround time for the Priority Pre-emptive scheduling algorithm. Refer to Table 3 below for process information. Note that arrival times are not all zero. A.draw the Gantt chart to illustrate process scheduling B.calculate turnaround time per process and average turnaround time C. calculate wait time per process and average wait time 2.Shortest Remaining Time First (SRTF) scheduling - compute the average waiting time and the average turnaround time for the SRTF scheduling algorithm. Refer to Table 4 below for process information. Note that arrival times are not all zero. A.draw the Gantt chart to illustrate process scheduling B.calculate turnaround time per process and average turnaround time C.calculate wait time per process and average wait time
58. A schedule is __________ if it is conflict equivalent to a serial schedule. a. Conflict serializable b. Conflicting c. Non serializable d. None of the mentioned
COPY FROM CHEGG == DISLIKE AND REPORT Assume that a finite number of resources of a single resource type mustbe managed. Processes may ask for a number of these resources and will returnthem once finished. As an example, many commercial software packagesprovide a given number of licenses, indicating the number of applications thatmay run concurrently. When the application is started, the license count isdecremented. When the application is terminated, the license count isincremented. If all licenses are in use, requests to start the application aredenied. Such a request will be granted only when an existing license holderterminates the application and a license is returned. The following program segment is used to manage a finite number of instancesof an available resource. The maximum number of resources and the number ofavailable resources are declared as follows: #define MAX_RESOURCES 5 int available_resources = MAX_RESOURCES; /** When a process wishes to obtain a number of…
Consider the following schedule: S:R1(A), W2(A), Commit2, W1(A), W3(A), Commit3, Commit1 Which of the following is true and provide the correct reasoning for your answer:(A) The schedule is view serializable schedule and strict recoverable schedule(B) The schedule is non-serializable schedule and strict recoverable schedule(C) The schedule is non-serializable schedule and is not strict recoverable schedule.(D) The Schedule is serializable schedule and is not strict recoverable schedule
University AAA has 150 staff which consists of an academic and a non-academic category. Each staff is given an option to select either a PENSION ON 56 YEARS scheme or a PENSION ON 60 YEARS scheme. Display the details of each staff information and the total number of academic staff and non-academic staff that have selected a PENSION ON 56 YEARS scheme and a PENSION ON 60 YEARS scheme. You are required to get an output as shown in Figure B QUESTION 1. analyze the given problem (identify input, process and output). 2. design the given problem (write a pseudocode or draw a flowchart).
Question 13 sum .Suppose we had N processes that shared a critical section. We can safely assume that which of the following must be true? 1) All N processes share some resource. 2) The processes are independent processes. 3) The processes cannot communicate or synchronize. 4) All N processes execute the same exact program. Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
Question 2:In the University library every 5 minutes a student arrives arrives. The librarian takes 3 minutesto serve student. Complete the following table (for 10 students) and calculate the averagetime a student spends in the system, arrival rate, service rate and percentage idle time of server.(Assume the first student arrives at 8:00 A.M and service begin immediately).
A small engineering consulting firm is establishing a plan for next year. The director and thethree partners need to prioritize the eight projects. The expected profit for each project is givenin the following table together with the number of person-days required to prepare each project.Another measure included is the computing resource measured as the computer processingunit (CPU) time (in hours). You have been tasked to evaluate which projects they ought topursue based on efficiency. Given the sample data below, you plan to construct a dataenvelopment analysis (DEA) model:a. Which measures would you regard as inputs and outputs, respectively? Pleaseprovide your justification.b. Conduct data envelopment analysis, explain what type of DEA model is selectedand describe the project you regard as “efficient” and “inefficient”, respectively.c. Which project would you recommend and why?d. In what ways can you improve on your recommendation? You are free to openlysource for other datasets…