DocumentCode
752297
Title
Performance Analyses of Paging Algorithms for Compilation of a Highly Modularized Program
Author
Chusho, Takeshi ; Hayashi, Toshihiro
Author_Institution
Systems Development Laboratory
Issue
2
fYear
1981
fDate
3/1/1981 12:00:00 AM
Firstpage
248
Lastpage
254
Abstract
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.
Keywords
Compilation; LRU; fault rate; locality; modular programming; optimum page size; paging behavior of data; relative difference in performance; replacement algorithm; Algorithm design and analysis; Database systems; Hardware; Information analysis; Laboratories; Mathematical analysis; Performance analysis; Performance loss; Relational databases; Timing; Compilation; LRU; fault rate; locality; modular programming; optimum page size; paging behavior of data; relative difference in performance; replacement algorithm;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/TSE.1981.234522
Filename
1702831
Link To Document