This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance of replacement algorithms with different page sizes
Nov. 1974 (vol. 7 no. 11)
pp. 14-23
W. W. Chu, Computer Science Department University of California at Los Angeles
H. Opderbeck, Computer Science Department University of California at Los Angeles
Dynamic memory management is an important advance in memory allocation, especially in virtual memory systems. In this paper we consider the case of paged memory systems — i.e., systems whose physical and logical address space is partitioned into equal sized blocks of contiguous addresses. Paged memories have been used by many computer systems. However, the relationships among page fault frequency (the frequency of those instances at which an executing program requires a page of data or instructions not in main memory), efficiency, and space-time product with various replacement algorithms and page sizes are still not sufficiently understood and are of considerable interest.
Citation:
W. W. Chu, H. Opderbeck, "Performance of replacement algorithms with different page sizes," Computer, vol. 7, no. 11, pp. 14-23, Nov. 1974, doi:10.1109/MC.1974.6323352
Usage of this product signifies your acceptance of the Terms of Use.