• edited by
187 views
0 0 votes
Suppose that the following processes arrive for execution at the times indicated. Each process will run the listed amount of time.

$$
\begin{array}{|c|c|c|}
\hline
\text{Processes} & \text{Arrival Time (sec)} & \text{Running Time (sec)} \\
\hline
P1 & 0.0 & 16 \\
P2 & 0.3 & 5 \\
P3 & 1.0 & 3 \\
\hline
\end{array}
$$
What will be the average turnaround time if the shortest remaining first scheduling is used(roundoff to $2$ decimal places)?

1 Answer

Answer:
Position:
Show:

Related questions

1 1 vote
2 2 answers
271
271 views
GO Classes asked Sep 15, 2025
271 views
A computer system provides each process a maximum of $256$ TeraBytes(1 TeraByte $=2^{ 40}$ bytes) of address space and a physical memory of $4$GB. The system uses paging ...
1 1 vote
2 2 answers
238
238 views
GO Classes asked Sep 15, 2025
238 views
A computer system uses a $48$-bit virtual address space and a $32$-bit physical address space. The page table is currently organized as a three-level page table, with $4$...
1 1 vote
1 1 answer
351
351 views
GO Classes asked Sep 15, 2025
351 views
Consider a memory system with a TLB access time of $10$ ns and a memory access time of $110$ ns - assume the memory access time includes the time to check the TLB. If the...
1 1 vote
4 4 answers
465
465 views
GO Classes asked Sep 15, 2025
465 views
Consider a virtual memory system with TLB that can hold $1024$ entries and can be accessed in $1$ ns, page table entries can be found in $100$ ns in main-memory and the a...