• edited by
1,198 views
0 0 votes

 

Consider four process all are arriving at time zero, with total execution time of 20, 10, 10 and 20 unit respectively. Each process spends the first 20% of execution time doing CPU, the next 60%of doing IO computation and the last 20% of time doing CPU computation again. The operating  system uses longest time  remaining first scheduling algorithm (LRTF) and schedules a new process either when running process get blocked IO or when the running process finishes its CPU burst. Assume that are I/O operations can be overlapped as much as possible. What is the completion time of process P0?  [Note: When same burst occurs for multiple process high priority given to lowest process id].

  1. 18
  2. 20
  3. 24
  4. 28

I am getting 20 as answer if I schedule based only on

schedules a new process either when running process get blocked IO or when the running process finishes its CPU burst.

Please log in or register to answer this question.

Position:
Show:

Related questions

0 0 votes
0 0 answers
959
959 views
Shivam Kasat asked Jan 13, 2019
959 views
An array A of size n is known to be sorted except for the first k elements and the last k elements, where K is a constant. Which of the following algorithms will be the b...
0 0 votes
0 0 answers
1.8k
1.8k views
Shivam Kasat asked Jan 13, 2019
1,774 views
Assume in TCP client is sending segment to server. After successfully receiving segments from client, server is waiting for next segments and clients is also waiting for ...