A Simple Linear Model of Demand Paging Performance.
Saved in:
| Title: | A Simple Linear Model of Demand Paging Performance. |
|---|---|
| Authors: | Saltzer, Jerome H.1, Weissman, C. |
| Source: | Communications of the ACM. Apr1974, Vol. 17 Issue 4, p181-186. 6p. 6 Graphs. |
| Subjects: | Paging (Computer science), Computer programming, Virtual machine systems, Digital computer simulation, Computers, Virtual storage (Computer science) |
| Abstract: | Predicting the performance of a proposed automatically managed multilevel memory system requires a model of the patterns by which programs refer to the information stored in the memory. Some recent experimental measurements on the Multics virtual memory suggest that, for rough approximations, a remarkably simple program reference model will suffice. The simple model combines the effect of the information reference pattern with the effect of the automatic management algorithm to produce a single, composite statement: the mean number of memory references between paging exceptions increases linearly with the size of the paging memory. The resulting model is easy to manipulate, and is applicable to such diverse problems as choosing an optimum size for a paging memory, arranging for reproducible memory usage charges, and estimating the core memory sharing. [ABSTRACT FROM AUTHOR] |
| Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
Be the first to leave a comment!
