Analysis of the Optimal, Look-Ahead Demand Paging Algorithms

DOI10.1137/0205052MaRDI QIDQ4114758zbMATH OpenOpenAlexFDO

Authors Alan J. Smith

Publication date 1976

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0205052

Mathematics Subject Classification ID

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

Cited in

(1)

• Minimization of demand paging for the LRU stack model of program behavior

This page was built for publication: Analysis of the Optimal, Look-Ahead Demand Paging Algorithms

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