A decomposable model of program paging behaviour

DOI10.1007/BF00288657zbMath0309.68059OpenAlexW1988638098MaRDI 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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items (1)

A note on the influence of program loading on the page fault rate

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

This page was built for publication: A decomposable model of program paging behaviour