Match the page eviction algorithm to the description. 1. Thi…
Match the page eviction algorithm to the description. 1. This algorithm proceeds in a round-robin fashion. On page fault, if the current page’s reference bit is set, it is cleared and the next page is chosen, this repeats until a page whose reference bit is not set is found. That page is then evicted.[1] 2. This algorithm uses a referenced and modified bit for each page to approximate the least recently used algorithm.[2] 3. This algorithm tracks the number of times a page is used, evicting the least recently used page.[3] 4. This algorithm uses a time window to define a working set of pages that are the most active. It then attempts to evict a page that is not in the working set, only evicting the oldest page if all pages are in the working set.[4]
Read Details