On adequate performance measures for paging

DOI10.1145/1132516.1132587MaRDI QIDQ2931411zbMATH OpenOpenAlexFDO

Authors Alexander Souza, Konstantinos 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

LRUpaging problemperformance analysis

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3537218
• On the relative dominance of paging algorithms
• On the Relative Dominance of Paging Algorithms
• On the separation and equivalence of paging strategies
• Quantifying competitiveness in paging with locality of reference
• Quantifying competitiveness in paging with locality of reference
• A unified analysis of paging and caching

Cited in

(22)

• A unified analysis of paging and caching
• Quantifying competitiveness in paging with locality of reference
• Parameterized analysis of paging and list update algorithms
• On the separation and equivalence of paging strategies
• Analysis of page replacement policies in the fluid limit
• Optimal management of dynamic buffer caches
• Quantifying competitiveness in paging with locality of reference
• Average-Case Competitive Analyses for One-Way Trading
• Optimal eviction policies for stochastic address traces
• Real-time integrated prefetching and caching
• scientific article; zbMATH DE number 3537218 (Why is no real title available?)
• A New Method for Computing Page-Fault Rates
• scientific article; zbMATH DE number 2065272 (Why is no real title available?)
• On-Line Paging Against Adversarially Biased Random Inputs
• On the Relative Dominance of Paging 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
• Outperforming LRU via competitive analysis on parametrized inputs for paging
• Average-case competitive analyses for one-way trading
• On the separation and equivalence of paging strategies and other online algorithms
• On the relative dominance of paging algorithms

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

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