A measure for program locality in demand paging

Abstract

The concept of information flow and information theory, adapted from the management sciences, is utilized to provide a measure of program locality that could be used to analyze, compare, and extend various replacement algorithms. A Locality Matrix Model (LMM) is derived and analyzed in the areas of page fault reductions and the determination of memory requirements to contain any inherent program locality. This approach of dynamic clustering page references is used to predict stationary behavior of the reference string.