Suppose that the following processes arrive for execution at time 0 in the order A, B,...

Suppose that the following processes arrive for execution at time 0 in the order A, B, C:

process	Run Time	Priority
A	4	1=high
B	2	3=low
C	3	2=medium

Determine the execution order (with the time marks) of these process using the following 4 schedulings: FCFS, SJF, a non-preemptive priority, and RR (time slice = 2).
What is the waiting time of each process for each of the scheduling algorithm? Which scheduling algorithm achieves the shortest average waiting time?

Solutions

Expert Solution

If you have any questions please comment me

If you like my work please upvote me

Manojponduru answered 2 years ago

Next > < Previous

Related Solutions

Assume there are three processes A, B and C. All processes are submitted for execution at...

Assume there are three processes A, B and C. All processes are submitted for execution at the same time. The process A executes for 2 milliseconds and then does I/O for 3 milliseconds and then executes for 3 milliseconds more. The process B executes for 4 milliseconds and then does I/O for 7 milliseconds. The process C executes for 2 millisecond and then does I/O for 4 milliseconds. Assume no contention for the resources and the order of execution (priority)...

Consider the following processes that came at time zero with the following order of arrival with...

Consider the following processes that came at time zero with the following order of arrival with the given CPU burst time. Draw the chart for average turnaround time, average wait time, and average response time versus the time quantum 1,2,3,4,5,6 and 7 using a round-robin CPU scheduling algorithm. Processes CPU Burst Time P1 6 P2 3 P3 1 P4 7

17. For time t on the interval [0, 8], people arrive at a venue for an...

17. For time t on the interval [0, 8], people arrive at a venue for an outdoor concert at a rate modeled by A(t) = 0.3sin(1.9t) + 0.3cos(0.6t) + 1.3. For time t on the interval [0, 1], no one leaves the venue, but for t on the interval [1, 8], people leave the venue at a rate modeled by L(t) = 0.2cos(1.9t) + 0.2sin t + 0.8. Both functions A(t) and L(t) are measured in hundreds of people per...

8- a) How is execution order determined in LabVIEW? b) What is the difference between a...

8- a) How is execution order determined in LabVIEW? b) What is the difference between a ‘For-Loop’ and a ‘While-Loop?’ c) What is a cluster in LabVIEW? What is an array in LabVIEW? When should each be used? d) Explain two methods for creating a SubVI. e) Where/How is the “Description and Tips” comments entered for a VI? For a control? For an indicator? f) What two structures are used in a state machine implementation in LabVIEW? How are they...

Suppose that we are at time zero. Passengers arrive at a train station according to a...

Suppose that we are at time zero. Passengers arrive at a train station according to a Poisson process with intensity λ. Compute the expected value of the total waiting time of all passengers who have come to the station in order to catch a train that leaves at time t. The answer is λt^2/2

Draw six Gantt charts that illustrate the execution of these processes using the following scheduling algorithms:

Determine the reaction order and the rate constant for the following data set: Time (s) 0...

Determine the reaction order and the rate constant for the following data set: Time (s) 0 50 100 150 200 250 Concentration (M) 0.01000 0.00887 0.00797 0.00723 0.00662 0.00611

Suppose the following two processes

Suppose the following two processes, foo and bar, are executed concurrently and share the semaphore variables S and R (each initialized to 1) and the integer variable x (initialized to 0).a. Can the concurrent execution of these two processes result in one or both being blocked forever? If yes, give an execution sequence in which one or both are blocked forever.b. Can the concurrent execution of these two processes result in the indefinite postponement of one of them? If yes,...

a) Verify that the indicial equation of Bessel's equation of order p is (r-p)(r+p)=0 b) Suppose...

a) Verify that the indicial equation of Bessel's equation of order p is (r-p)(r+p)=0 b) Suppose that p is not an integer. Carry out the computation to obtain the solutions y1 and y2 above.

The wait time (after a scheduled arrival time) in minutes for a train to arrive is...

The wait time (after a scheduled arrival time) in minutes for a train to arrive is Uniformly distributed over the interval [0,12]. You observe the wait time for the next 95 trains to arrive. Assume wait times are independent. Part a) What is the approximate probability (to 2 decimal places) that the sum of the 95 wait times you observed is between 536 and 637? Part b) What is the approximate probability (to 2 decimal places) that the average of...

Subjects