Stack distance density and page fault probability in virtual memory systems

Abstract An algorithm is given for determining the stack distance density function for a system described by a first order Markov Chain. The algorithm is developed for and applied to a first order Markov model of program behavior. It is used to obtain an approximation to the page fault probability in a virtual memory system operating under demand paging and LRU replacement rule.