Abstract
The paging problem is that of deciding which pages to keep in a cache of k pages to minimize the number of page faults for a two-level memory system. We consider efficient paging algorithms that require limited space and time on a unit-cost RAM with word size w. We present an implementation of the randomized marking algorithm of Fiat et al. that uses only k + o(k) bits of space while supporting page requests in O(1) worst-case time. In addition, we present a novel k-competitive deterministic algorithm called Surely Not Recently Used (SNRU) that approximates the Least Recently Used (LRU) algorithm. For any constant 1/k ≤ ε < 1/2, SNRU(∈) ensures that the ⌈(1/2 - ε)k⌉ most recently requested pages are in the cache, while using only O(1/ε) worst-case time per request and 2k + o(k) bits of space.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
