| Autor: |
Franklin, M. A., Gupta, R. K., Weissman, C. |
| Předmět: |
|
| Zdroj: |
Communications of the ACM; Apr1974, Vol. 17 Issue 4, p186-191, 6p, 9 Diagrams |
| Abstrakt: |
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 status, 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. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
