On adequate performance measures for paging

DOI10.1145/1132516.1132587zbMath1301.68024OpenAlexW2163724134MaRDI QIDQ2931411

Alexander Souza, Konstantinos D. Panagiotou

Publication date: 25 November 2014

Published in: Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

performance analysispaging problemLRU

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Theory of operating systems (68N25)

Related Items (13)

On the relative dominance of paging algorithms ⋮ Quantifying Competitiveness in Paging with Locality of Reference ⋮ Optimal eviction policies for stochastic address traces ⋮ Real-time integrated prefetching and caching ⋮ Average-case competitive analyses for one-way trading ⋮ Average-Case Competitive Analyses for One-Way Trading ⋮ On the Relative Dominance of Paging Algorithms ⋮ On the separation and equivalence of paging strategies and other online algorithms ⋮ Energy-Efficient Windows Scheduling ⋮ Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis ⋮ On Certain New Models for Paging with Locality of Reference ⋮ Quantifying competitiveness in paging with locality of reference ⋮ Parameterized analysis of paging and list update algorithms

This page was built for publication: On adequate performance measures for paging