Part II: Counter-based clock page replacementalgorithm
In this part of the assignment, you are to replace thesecond-chance LRU approximation algorithm in both the active andinactive lists with a counter-based clock algorithm:
1. Keep a reference counter foreach frame, which is set to 0 initially.
2. Whentry_to_free_pages() is called, you scana frame in the following way. First, you add the reference bitvalue to the frame reference counter (and clear the reference bitat the same time). Then you check the frame reference counter. Ifthe counter is 0, you evict the page. Otherwise, you decrement thecounter by 1 and move the frame to the back of list (as
OR
PayPal Gateway not configured
OR
PayPal Gateway not configured