A decomposable model of program paging behaviour
From MaRDI portal
Publication:1219162
DOI10.1007/BF00288657zbMath0309.68059MaRDI QIDQ1219162
H. Vantilborgh, Pierre Courtois
Publication date: 1976
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00288657
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Predicting Working Set Sizes
- Patterns in Program References
- Characteristics of program localities
- Error Analysis in Nearly-Completely Decomposable Stochastic Systems
- Computation of page fault probability from program transition diagram
- On the working set size and its normal approximation
- The performance of a system for automatic segmentation of programs within an ALGOL compiler (GIER ALGOL)
- The working set model for program behavior
- One way of estimating frequencies of jumps in a program
- Principles of Optimal Page Replacement
- A study of storage partitioning using a mathematical model of locality
- Properties of the working-set model
- Locality in Page Reference Strings
- A Unified Approach to the Evaluation of a Class of Replacement Algorithms
- Aggregation of Variables in Dynamic Systems