Program behavior and the page-fault-frequency replacement algorithm
- 1 November 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 9 (11) , 29-38
- https://doi.org/10.1109/c-m.1976.218439
Abstract
Virtual memory is one of the major concepts that has evolved in computer architecture over the last decade. It has had a great impact on the design of new computer systems since it was first introduced by the designers of the Atlas computer in 1962. A virtual memory is usually divided into blocks of contiguous locations to allow an efficient mapping of the logical addresses into the physical address space. In this paper, we are concerned with paging systems, that is, systems for which the blocks of contiguous locations are of equal size. The memory system consists of two levels: main memory and auxiliary memory. The occurrence of a reference to a page that is currently not in main memory is called a page fault. A page fault results in the interruption of the program and the transfer of the referenced page from auxiliary to main memory.Keywords
This publication has 9 references indexed in Scilit:
- Analysis of the PFF replacement algorithm via a semi-Markov modelCommunications of the ACM, 1976
- The independence of miss ratio on page sizeJournal of the ACM, 1976
- Performance of replacement algorithms with different page sizesComputer, 1974
- A study of storage partitioning using a mathematical model of localityCommunications of the ACM, 1972
- Experiments with program localityPublished by Association for Computing Machinery (ACM) ,1972
- The page fault frequency replacement algorithmPublished by Association for Computing Machinery (ACM) ,1972
- Evaluation techniques for storage hierarchiesIBM Systems Journal, 1970
- Dynamic space-sharing in computer systemsCommunications of the ACM, 1969
- The working set model for program behaviorCommunications of the ACM, 1968