In Additional-Reference-Bits algorithm,
A) the least-recently used page is identified very efficiently on a page fault.
B) a group of pages that have not been used recently are efficiently identified.
C) a page that has been referenced most recently is identified.
D) None of the above.

Question

Quizplus · Accepted Answer

Additional-Reference-Bits algorithm uses a reference bit for each page to keep track of when the page was last accessed. When a page fault occurs, the algorithm scans through all the pages to find a group of pages that have not been accessed recently based on their reference bit value, and selects one from the group to be replaced. Therefore, option B is correct as it identifies a group of pages efficiently. Option A and C are incorrect as they do not accurately describe the functionality of the algorithm.

In Additional-Reference-Bits Algorithm