Some Distribution-Free Aspects of Paging Algorithm Performance
From MaRDI portal
Publication:3214382
DOI10.1145/321796.321800zbMath0271.68024OpenAlexW2068651594MaRDI QIDQ3214382
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
Related Items (11)
Optimal mapping in direct mapped cache environments ⋮ A universal online caching algorithm based on pattern matching ⋮ Evaluating the quality of online optimization algorithms by discrete event simulation ⋮ Optimal eviction policies for stochastic address traces ⋮ Fixed-parameter algorithms for unsplittable flow cover ⋮ Unnamed Item ⋮ Stochastic control of paging in a two-level computer memory ⋮ On paging with locality of reference ⋮ On Optimal Performance in Self-Organizing Paging Algorithams ⋮ Asymptotic approximation of the move-to-front search cost distribution and least-recently used caching fault probabilities ⋮ Paging against a distribution and IP networking
This page was built for publication: Some Distribution-Free Aspects of Paging Algorithm Performance
