edited by
13,142 views
32 votes
32 votes

Thrashing

  1. reduces page I/O
  2. decreases the degree of multiprogramming
  3. implies excessive page I/O
  4. improve the system performance
edited by

4 Answers

Best answer
30 votes
30 votes
edited by
7 votes
7 votes

THRASHING : in thrashing maximum CPU time is wasted in I/O and page faults . So CPU utilization is less so scheduler tries to insert more page in its ready queue so that CPU utilization can be increased . so degree of multiprogramming will not be decreased 

ANS : c

3 votes
3 votes
Not just (c) but even option (b) is also true.

Thrashing also decreases the degree of multiprogramming because as per the definition of degree of multiprogramming it states that more no of pages to numerous processes are made to be stored at the main memory(ram) so as to asure the best cpu utilization. But thrashing occurs when cpu tends to execute a particular process and seeks for it's respective page in that instance the first page is present but second is absent in the main memory so inorder a hit fails... It now needs to search for that page in secondary memory and need to bring that page from secondary memory to the main memory for it's complete execution (page fault) .. In that case the degree of multiprogramming decreases.

 

And while bringing those pages... Consider a situation where multiple page faults occurs ie. The pages required are not available in the main memory then cpu will invest more of it's time in bringing the pages from secondary memory to main memory for it's execution. Due to which excessive page i/o occurs...

Hence (b) and (c) both the options are correct.

Hope this helps.
Answer:

Related questions

25 votes
25 votes
2 answers
1
34 votes
34 votes
3 answers
2
Kathleen asked Sep 29, 2014
10,944 views
Dirty bit for a page in a page tablehelps avoid unnecessary writes on a paging devicehelps maintain LRU informationallows only read on a pageNone of the above
17 votes
17 votes
3 answers
4
Kathleen asked Sep 29, 2014
6,136 views
Which of the following propositions is a tautology?$(p \vee q) \rightarrow p$$p \vee (q \rightarrow p)$$p \vee (p \rightarrow q)$$p \rightarrow (p \rightarrow q)$