This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Working Set and Page Fault Frequency Paging Algorithms: A Performance Comparison
August 1978 (vol. 27 no. 8)
pp. 706-712
R.K. Gupta, Federal and Special Systems Group, Burroughs Corporation
Performance of a paged virtual memory computer system operating under working set (WS) and page fault frequency (PFF) paging algorithms is analyzed analytically. Performance sensitivity to program reference behavior and paging algorithm parameter is studied for the two paging algorithms. The results indicate that when performance with the two algorithms is compared, the WS algorithm is generally less sensitive to changes in program behavior. Results are also provided relating to performance sensitivity to algorithm parameter selection.
Index Terms:
working set (WS), Page fault frequency (PFF), paging algorithms, program reference behavior, virtual memory
Citation:
R.K. Gupta, M.A. Franklin, "Working Set and Page Fault Frequency Paging Algorithms: A Performance Comparison," IEEE Transactions on Computers, vol. 27, no. 8, pp. 706-712, Aug. 1978, doi:10.1109/TC.1978.1675177
Usage of this product signifies your acceptance of the Terms of Use.