Some Distribution-Free Aspects of Paging Algorithm Performance

DOI10.1145/321796.321800MaRDI QIDQ3214382zbMATH OpenOpenAlexFDO

Authors P. A. Franaszek, T. J. Wagner

Publication date 1974

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

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(12)

• scientific article; zbMATH DE number 3787795 (Why is no real title available?)
• On Optimal Performance in Self-Organizing Paging Algorithams
• A universal online caching algorithm based on pattern matching
• On paging with locality of reference
• Paging against a distribution and IP networking
• Evaluating the quality of online optimization algorithms by discrete event simulation
• Optimal mapping in direct mapped cache environments
• Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities
• Distributional online weighted paging with limited horizon
• Stochastic control of paging in a two-level computer memory
• Fixed-parameter algorithms for unsplittable flow cover
• Optimal eviction policies for stochastic address traces

This page was built for publication: Some Distribution-Free Aspects of Paging Algorithm Performance

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