ACM Computing Surveys (CSUR)
The Operational Analysis of Queueing Network Models
ACM Computing Surveys (CSUR)
Anomalies with variable partition paging algorithms
Communications of the ACM
Characteristics of program localities
Communications of the ACM
MIN—an optimal variable-space page replacement algorithm
Communications of the ACM
Organizing matrices and matrix operations for paged memory systems
Communications of the ACM
The working set model for program behavior
Communications of the ACM
Bibliography on paging and related topics
ACM SIGOPS Operating Systems Review
Characteristics and models of program behaviour
ACM '76 Proceedings of the 1976 annual conference
Methodology and empirical results of program behaviour measurements
PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
Optimal paging-strategies and stability considerations for solving large linear-systems.
Optimal paging-strategies and stability considerations for solving large linear-systems.
A study of program and memory policy behaviour.
A study of program and memory policy behaviour.
Program behavior and load dependent system performance.
Program behavior and load dependent system performance.
The modeling of virtual memory systems.
The modeling of virtual memory systems.
Performance measurement of paging behavior in multiprogramming systems
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
Compiler directed memory management policy for numerical programs
Proceedings of the tenth ACM symposium on Operating systems principles
| Hi-index | 0.00 |
Traces of numerical programs are used to examine their behavior in a paged virtual memory system. The working set policy is used for the replacement algorithm. It is found that the behavior of such programs is different from the behavior of other types of programs like compilers and system programs. These differences are most significant in the lifetime curves and the space-time cost curves. All programs examined showed ill-behavior. Moreover, the space-time costs of executing these programs are very sensitive to the choice of the control parmater, the window size. Our measurements show that approximations based on the common practice of using virtual time instead of real time in generating statistics are often inaccurate. The “primary knee criterion” of optimizing the space-time cost did not hold for some programs. The parameter-real memory and the real memory-fault rate anomalies show significantly in all but one of the seventeen programs examined.