Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.


CS604 Operating Systems GDB Fall 2020 Solution / Discussion

Graded Discussion Board (GDB) will be opened on Monday 22nd February, 2021 and it will be closed on Tuesday 23rd February, 2021.

CS 604 GDB solution 2021 ||Operating Systems|| vu all in one

Views: 464

Replies to This Discussion

Share the GDB Question & Discuss Here....         

Stay touched with this discussion, Solution idea will be uploaded as soon as possible in replies here before the due date.

CS604 GDB 

Dated: Feb 16, 21

Dear Students,

Graded Discussion Board (GDB) will be opened on Monday 22nd February, 2021 and it will be closed on Tuesday 23rd February, 2021.

Submit your responses on time to avoid any inconvenience.

Graded Discussion Topic and Instructions

GDB

During process execution when page fault is occurred, page that is referred by the process is not in the main memory. Secondly, there are no free frames in the free frame list. And main memory is fully committed. So we have to select the victim page to be replaced.

Page replacement algorithms used to deal with page- fault problem in main memory. However, Page replacement algorithms suffer from Belady’s Anomaly. Also Stack replacement algorithms that are class of page replacement algorithms may suffer from Belady’s Anomaly.

Topic:

Discuss, is Stack replacement algorithms suffer from Belady’s anomaly? If Yes, write down valid reason, if No, write down how it will deal with this problem.

 

Read the following instructions carefully before sending your comments:

  1. Your discussion must be based on logical facts and in-depth knowledge of topic is must for that.
  2. Your comments should be relevant to the topic i.e., clear and concise. (Maximum 4-5 lines answer).
  3. You should post your comments on Graded Discussion Board & not on the Regular MDB. Both will run parallel to each other during the time specified above.
  4. Books, websites, and other reading material may be consulted before posting your comments.
  5. No extra time will be given for discussion.
  6. You cannot participate in the discussion after the due date or through e-mail.
Solution IDEA:
Belady’s anomaly doesn’t affect Stack replacement algorithms :
Reasons :
Stack based algorithms do not suffer from Belady’s Anomaly, this is because these algorithms assign priority to a page for replacement that is independent of the number of frames in the main memory.
Stack based algorithms is one for which it can b shown that all the set of pages in memory for “N” frames is always a subset of the set of pages that would be in memory with N+1 frames .For LRU replacement , the set of pages in memory would be the n most recently referenced pages

RSS

© 2021   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service