Quantifying competitiveness in paging with locality of reference

DOI10.1007/978-3-662-47672-7_3MaRDI QIDQ3448771zbMATH OpenOpenAlexFDO

Authors Susanne Albers, Dario Frascaria

Publication date 27 October 2015

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://mediatum.ub.tum.de/doc/1524482/document.pdf

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Analysis of algorithms (68W40)

Recommendations

• Quantifying competitiveness in paging with locality of reference
• On paging with locality of reference
• Competitive paging with locality of reference
• scientific article; zbMATH DE number 1303543
• Algorithms – ESA 2004

Cites work

• A new measure for the study of on-line algorithms
• Access Graphs Results for LRU versus FIFO under Relative Worst Order Analysis
• Algorithms – ESA 2004
• Beyond Competitive Analysis
• Competitive paging with locality of reference
• LRU is better than FIFO
• Markov Paging
• On adequate performance measures for paging
• On paging with locality of reference
• On the relative dominance of paging algorithms
• On the separation and equivalence of paging strategies
• Paging and list update under bijective analysis
• Parameterized Analysis of Paging and List Update Algorithms
• Relative interval analysis of paging algorithms on access graphs
• Strongly Competitive Algorithms for Paging with Locality of Reference
• The relative worst-order ratio applied to paging

Cited in

(15)

• Quantifying competitiveness in paging with locality of reference
• Parameterized analysis of paging and list update algorithms
• On adequate performance measures for paging
• On the separation and equivalence of paging strategies
• scientific article; zbMATH DE number 65707 (Why is no real title available?)
• scientific article; zbMATH DE number 1263239 (Why is no real title available?)
• On-Line Paging Against Adversarially Biased Random Inputs
• scientific article; zbMATH DE number 742969 (Why is no real title available?)
• Strongly Competitive Algorithms for Paging with Locality of Reference
• Paging and list update under bijective analysis
• On Certain New Models for Paging with Locality of Reference
• Algorithms – ESA 2004
• Outperforming LRU via competitive analysis on parametrized inputs for paging
• On paging with locality of reference
• On the separation and equivalence of paging strategies and other online algorithms

This page was built for publication: Quantifying competitiveness in paging with locality of reference

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