Dynamic space-sharing in computer systems
Communications of the ACM
Program Behavior: Models and Measurements
Program Behavior: Models and Measurements
Operating Systems Theory
Methodology and empirical results of program behaviour measurements
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
A study of program locality and lifetime functions
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
The implications of working set analysis on supercomputing memory hierarchy design
Proceedings of the 19th annual international conference on Supercomputing
IEEE Transactions on Computers
Hi-index | 0.00 |
An algorithm for generating a page reference string which exhibits a given working set size behavior in the time domain is presented, and the possible applications of such a string are discussed. The correctness of the algorithm is proved, and its computational complexity found to be linear in the length of the string. A program implementing the algorithm, which is performed in one pass and requires very little space, is briefly described, and some experimental results are given.