The working set model for program behavior

DOI10.1145/363095.363141MaRDI QIDQ5545055zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Peter J. Denning

Publication date 1968

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/363095.363141

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• The working set algorithm has competitive ratio less than two
• An analytical study of strategy-oriented restructuring algorithms
• Efficient algorithms for dynamic allocation of distributed memory
• Competitive paging with locality of reference
• On paging with locality of reference

Cited in

(31)

• Simulation of environmental flow problems in geometrically complex domains. II: A domain-splitting method
• A decomposable model of program paging behaviour
• On the self contained modelling of DB/DC systems
• Analysis of storage hierarchy
• Optimal multiprogramming
• Parameterized analysis of paging and list update algorithms
• Relative interval analysis of paging algorithms on access graphs
• Performance predictions for extended paged memories
• A Survey of Algorithms and Models for List Update
• The working set algorithm has competitive ratio less than two
• Security Analysis of Cache Replacement Policies
• An analytical study of strategy-oriented restructuring algorithms
• scientific article; zbMATH DE number 3854406 (Why is no real title available?)
• Optimal eviction policies for stochastic address traces
• Aspects of compact programs and directly executed languages
• Job scheduling in multiprogrammed computer systems
• A simulation tool for performance evaluation of the IBM 360/75
• TPF: a dynamic system thrashing protection facility
• On the working set size and its normal approximation
• Evaluating models of memory allocation
• Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
• On Certain New Models for Paging with Locality of Reference
• Outperforming LRU via competitive analysis on parametrized inputs for paging
• On paging with locality of reference
• Zur Verbesserung der Lokalität im Zugriff auf Felder
• Relative Worst-Order Analysis: A Survey
• On the separation and equivalence of paging strategies and other online algorithms
• Paging and the address-translation problem
• Why increasing the hit ratio can hurt cache throughput
• On frequency analysis of sequential program code execution
• On the relative dominance of paging algorithms

This page was built for publication: The working set model for program behavior

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5545055)