Register

GO Classes DPP | OS |THREASHING

344 views
4 4 votes

Which of the following conditions is the MOST direct cause of 'Thrashing' in a virtual memory system?

  1. THE CPU UTILIZATION IS TOO HIGH DUE TO INTENSIVE COMPUTATION.
     
  2. THE SUM OF THE WORKING SET SIZES OF ALL ACTIVE PROCESSES EXCEEDS THE TOTAL PHYSICAL MEMORY.
     
  3. THE PAGE TABLE SIZE EXCEEDS THE AVAILABLE CACHE (TLB) SPACE.
     
  4. THE DISK SCHEDULING ALGORITHM IS INEFFICIENCT (E.G., FCFS INSTEAD OF SSTF).

2 Answers

1 1 vote
THE SUM OF THE WORKING SET SIZES OF ALL ACTIVE PROCESSES EXCEEDS THE TOTAL PHYSICAL MEMORY.

When the system cannot fit the active working sets in RAM, it enters a constant cycle of page faults and swapping, leading to thrashing.

THE DISK SCHEDULING ALGORITHM IS INEFFICIENCT (E.G., FCFS INSTEAD OF SSTF).

While inefficient, this affects latency and throughput but is not the root cause of process-level thrashing.

Correct option: B
0 0 votes

Answer Option B

Thrashing is a condition in an OS where the CPU spends most of its time swapping pages between RAM and DISK instead of executing processes.

This continous swapping occurs due to  lack of sufficient RAM for Active processes which is the direct cause.

Voting & Accepting an answer helps improve the community
Answer:
← Previous · GO Classes DPP | OS ...Next → · GO Classes DPP | OS ...
← Previous in category · GO Classes DPP | OS ...Next in category → · GO Classes DPP | OS ...
Position:
Show:

Related questions

1 1 vote
1 1 answer
330
330 views
GO Classes asked Jan 23
330 views
GO Classes DPP | OS |SYNCHRONIZATION
Two processes, $P 1$ and $P 2$, share a common variable $X$, which is initialized to $10$. They also use a binary semaphore $S$, initialized to $1$ . The processes execut...
1 1 vote
1 1 answer
276
276 views
GO Classes asked Jan 23
276 views
GO Classes DPP | OS |DISK SCHEDULING
Consider a disk queue with requests for I/O to blocks on cylinders $98, 183,37,122,14,124,65$, and 67 . The disk head is initially at cylinder $53$. Using the SCAN algori...
2 2 votes
2 2 answers
365
365 views
GO Classes asked Jan 23
365 views
GO Classes DPP | OS |PAGING
Consider a system with a $32$-bit logical address space and a page size of $4 ~\mathrm{KB}$. The system uses a two-level paging scheme where the first level (Outer Page T...
2 2 votes
1 1 answer
289
289 views
GO Classes asked Jan 23
289 views
GO Classes DPP | OS |CPU SCHEDULING
Consider a system with three processes, $P_1, P_2$, and $P_3$, with arrival times and burst times as shown in the table below. The system uses a Preemptive Priority Sched...