Abstract
The dynamlic behavior of programs is studied through LRU (Least-Recently-Used) stack distribution assuming Markovian page references. We propose a new analysis method to calculate steady state probabilities for the LRU stack. We first prove that a Markov chain which describes the behavior of an LRU stack of full-length is lumpable to a Markov chain having a smaller transition matrix than that in the original Markov chain. Based on this lumpability, we propose an algorithm to calculate the invariant vector for the transition matrix of the Markov chain for a full-length LRU stack. We show numerical examples calculated with the proposed algorithm, and evaluate computational efficiency of the proposed method.
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 callMore From: Journal of the Operations Research Society of Japan
Disclaimer: 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.
