This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Performance Analyses of Paging Algorithms for Compilation of a Highly Modularized Program
March 1981 (vol. 7 no. 2)
pp. 248-254
T. Chusho, Systems Development Laboratory
Previous works on paging behavior have mainly concentrated on procedures, not on data. This paper is an attempt to clarify the paging behavior of data referenced by a newly developed language processor, and theoretically analyze the performance of several page replacement algorithms with no loss of generality.
Index Terms:
replacement algorithm, Compilation, fault rate, locality, LRU, modular programming, optimum page size, paging behavior of data, relative difference in performance
Citation:
T. Chusho, T. Hayashi, "Performance Analyses of Paging Algorithms for Compilation of a Highly Modularized Program," IEEE Transactions on Software Engineering, vol. 7, no. 2, pp. 248-254, March 1981, doi:10.1109/TSE.1981.234522
Usage of this product signifies your acceptance of the Terms of Use.