Thumbnail
Access Restriction
Subscribed

Author Gupta, R. K. ♦ Franklin, M. A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
Language English
Subject Keyword Page fault probability ♦ Demand paging ♦ Virtual memory ♦ Page fault ♦ Program model ♦ Markov model ♦ Program behavior ♦ Replacement rule
Abstract An algorithm is given for calculating page fault probability in a virtual memory system operating under demand paging with various memory sizes and replacement rules. A first order Markov model of program behavior is assumed, and a representation of the system based on memory states, control states, and memory substates is presented. The algorithm is general in the sense that the page fault probabilities can be calculated for nonpredictive replacement rules applied to any program represented by a one-step Markov chain. A detailed example is given to illustrate the algorithm for Random and Least Recently Used (LRU) replacement rules.
Description Affiliation: Washington Univ., St. Louis, MO (Franklin, M. A.; Gupta, R. K.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 17
Issue Number 4
Page Count 6
Starting Page 186
Ending Page 191


Open content in new tab

   Open content in new tab
Source: ACM Digital Library