Quantifying competitiveness in paging with locality of reference

DOI10.1007/s00453-018-0406-9zbMath1401.68367OpenAlexW2793086514MaRDI QIDQ1799211

Susanne Albers, Dario Frascaria

Publication date: 18 October 2018

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-018-0406-9

zbMATH Keywords

analysis of algorithmsonline algorithmexperimental studyoptimal offline algorithm

Mathematics Subject Classification ID

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

Cites Work

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

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