The working set model for program behavior

DOI10.1145/363095.363141zbMath0159.45407OpenAlexW4235336266WikidataQ56032270 ScholiaQ56032270MaRDI QIDQ5545055

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)

Related Items

The working set algorithm has competitive ratio less than two ⋮ On the relative dominance of paging algorithms ⋮ Simulation of environmental flow problems in geometrically complex domains. II: A domain-splitting method ⋮ Zur Verbesserung der Lokalität im Zugriff auf Felder ⋮ Optimal eviction policies for stochastic address traces ⋮ Relative Worst-Order Analysis: A Survey ⋮ Aspects of compact programs and directly executed languages ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ Security Analysis of Cache Replacement Policies ⋮ A simulation tool for performance evaluation of the IBM 360/75 ⋮ A decomposable model of program paging behaviour ⋮ TPF: a dynamic system thrashing protection facility ⋮ On the self contained modelling of DB/DC systems ⋮ Analysis of storage hierarchy ⋮ Optimal multiprogramming ⋮ On paging with locality of reference ⋮ Job scheduling in multiprogrammed computer systems ⋮ Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis ⋮ On Certain New Models for Paging with Locality of Reference ⋮ Relative interval analysis of paging algorithms on access graphs ⋮ Performance predictions for extended paged memories ⋮ On frequency analysis of sequential program code execution ⋮ A Survey of Algorithms and Models for List Update ⋮ Unnamed Item ⋮ Parameterized analysis of paging and list update algorithms ⋮ On the working set size and its normal approximation