Assume a system with N processes (named Pi, i 1,,N) where process Pi arrives at time i 1 All processes have CPU demands equal to 2 time units The CPU scheduler is allowed to make decisions of which process to start, or continue, executing next only at the time instants that a new process arrives to the system (so at times 0, 1, , N 1) as well as at the time instants when a process executing in the CPU completes its execution Prove, as formally as possible, that the best case average turnaround time is ((N 1)(N 2) 2) (2N) 3 Assume a system with N processes (named Pi, i 1, ,N) where process Pi arrives at time i 1 All processes have CPU demands equal to 2 time units The CPU scheduler is allowed to make decisions of which process to start, or continue, executing next only at the time instants that a new process arrives to the system (so at times 0, 1, , N 1) as well as at the time instants when a process executing in the CPU completes its execution Prove, as formally as possible, that the best case average turnaround time is ((N 1)(N 2) 2) (2N)

The Answer is in the image, click to view ...

Answered step by step

Verified Expert Solution

Link Copied!

Question

1 Approved Answer

Posted on Sep 24, 2024

Assume a system with N processes (named Pi, i=1,,N) where process Pi arrives at time i-1. All processes have CPU demands equal to 2 time

Assume a system with N processes (named Pi, i=1,,N) where process Pi arrives at time i-1. All processes have CPU demands equal to 2 time units. The CPU scheduler is allowed to make decisions of which process to start, or continue, executing next only at the time instants that a new process arrives to the system (so at times 0, 1, , N-1) as well as at the time instants when a process executing in the CPU completes its execution. Prove, as formally as possible, that the best case average turnaround time is ((N+1)(N+2)-2)/(2N). image text in transcribed

[3] Assume a system with N processes (named Pi, i=1,...,N) where process Pi arrives at time i-1. All processes have CPU demands equal to 2 time units. The CPU scheduler is allowed to make decisions of which process to start, or continue, executing next only at the time instants that a new process arrives to the system (so at times 0, 1, ..., N-1) as well as at the time instants when a process executing in the CPU completes its execution. Prove, as formally as possible, that the best case average turnaround time is ((N+1)(N+2)-2)/(2N)