This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Use Bit Scanning in Replacement Decisions
February 1979 (vol. 28 no. 2)
pp. 133-141
M.C. Easton, IBM Thomas J. Watson Research Center
In paged storage systems, page replacement policies generally depend on a use bit for each page frame. The use bit is automatically turned on when the resident page is referenced. Typically, a page is considered eligible for replacement if its use bit has been scanned and found to be off on ? consecutive occasions, where ? is a parameter of the algorithm. This investigation focuses on the dependence of the number of bit-scanning operations on the value of ? and on properties of the string of page references. The number of such operations is a measure of the system overhead incurred while making replacement decisions. In particular, for several algorithms, the number of scans per reference is shown to be approximately proportional to ? However, empirical results from single-program traces show that the value of ? has little effect on the miss ratio. Although the miss ratios for the bit-scanning algorithms are close to those of least recently used (LRU), it is pointed out that increasing the value of ? need not bring the bit-scanning policies closer to LRU management.
Index Terms:
operating system overhead, Miss ratio, page fault rate, paged memories, page replacement algorithms, paged storage
Citation:
M.C. Easton, P.A. Franaszek, "Use Bit Scanning in Replacement Decisions," IEEE Transactions on Computers, vol. 28, no. 2, pp. 133-141, Feb. 1979, doi:10.1109/TC.1979.1675302
Usage of this product signifies your acceptance of the Terms of Use.