Quantifying competitiveness in paging with locality of reference

DOI10.1007/978-3-662-47672-7_3zbMATH Open1401.68366OpenAlexW1032693136MaRDI QIDQ3448771FDOQ3448771

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (15)

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

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)