The Community for Technology Leaders
Green Image
Issue No. 02 - March (1981 vol. 7)
ISSN: 0098-5589
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.
replacement algorithm, Compilation, fault rate, locality, LRU, modular programming, optimum page size, paging behavior of data, relative difference in performance

T. Chusho and T. Hayashi, "Performance Analyses of Paging Algorithms for Compilation of a Highly Modularized Program," in IEEE Transactions on Software Engineering, vol. 7, no. , pp. 248-254, 1981.
94 ms
(Ver 3.3 (11022016))