3,325 views
0 0 votes
Consider three Processes P1 , P2, P3 arriving in the Ready Queue at time 0 in the order P1, P2, P3 Their service time requirements are 10, 20 & 30 units respectively. Each Process spends 20% of its Service time on I/O followed by 70% of its Service time on Computation at CPU and last 10% on I/O before completion.

Assuming Concurrent I/O and negligible Scheduling Overhead. Calculate for FCFS Scheduling

(i) Average TAT of Processes

(2)% CPU idleness.

1 Answer

0 0 votes

best question which I came across.

Position:
Show:

Related questions

0 0 votes
1 1 answer
880
880 views
Aniket1710 asked Jul 20, 2023
880 views
Let m[0]…m[4] be mutexes (binary semaphores) and P[0] …. P[4] be processes.Suppose each process P[i] executes the following:P(i){ while(1) { P(m[i]); ...
2 2 votes
3 3 answers
1.7k
1.7k views
Aniket1710 asked Jul 20, 2023
1,718 views
For following code how many times the '*' will printed?main(){ int i,n ; for(i = 1 ; i<=n ; ++i) { fork(); printf("*"); }}
3 3 votes
4 4 answers
1.5k
1.5k views
delxbydelt asked Mar 15, 2024
1,515 views
Consider a uniprocessor system with n processes in the ready queue. Round robin scheduling with time quantum x is used for process scheduling. Assume each process require...
0 0 votes
2 2 answers
902
902 views
legacy asked Nov 27, 2022
902 views
] Our CPU is currently idle and the current time is labeled time 0. Four processes arrive to the ready queue at the following times and with the following required run ti...