Question: ) Consider five processes p1, p2, p3, p4 and p5 that are wants to perform operation arriving at time 0 and 2. Maximum time requirement
) Consider five processes p1, p2, p3, p4 and p5 that are wants to perform operation arriving at time 0 and 2. Maximum time requirement of these process are 20, 40, 10,30,5 unit respectively. Processes spend 10% on I/O operation, 70% on CPU execution and last 20 % on I/O again. The CPU use SJF (preemptive version) algorithm, schedule a new process either when the running process gets blocked on I/O or when the running process finished its compute burst. Assume that all I/O operations can be overlapped as much as possible. Show complete workingType or paste question here
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
