The least recently used paging algorithm is popularly known, yet has the disadvantage of producing continuous page faults when a cyclic reference of m plus 1 or more pages is made with m pages in the main memory. A semi-dynamic algorithm, SDMRU, is proposed which avoids such continuous page faults over relatively high ranges of memory size when tested with constructed programs of characteristic and representative behavior. The implementation is simple. A suggestion for modifying it into a demand prepaging algorithm is also made. The suitability of SDMRU in a multiprogramming environment is also discussed.
机构:
Texas A&M Univ, College Station,, TX, USA, Texas A&M Univ, College Station, TX, USATexas A&M Univ, College Station,, TX, USA, Texas A&M Univ, College Station, TX, USA