On Certain New Models for Paging with Locality of Reference

DOI10.1007/978-3-540-77891-2_19MaRDI QIDQ5452166zbMATH OpenOpenAlexFDO

Authors Reza Dorrigiv, Alejandro Lopez-Ortiz

Publication date 25 March 2008

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77891-2_19

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• On paging with locality of reference
• Quantifying competitiveness in paging with locality of reference
• Competitive paging with locality of reference
• Quantifying competitiveness in paging with locality of reference
• Parameterized Analysis of Paging and List Update Algorithms

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A unified analysis of paging and caching
• Competitive paging algorithms
• Competitive paging with locality of reference
• On adequate performance measures for paging
• On paging with locality of reference
• On the separation and equivalence of paging strategies
• On-line file caching
• Page replacement with multi-size pages and applications to web caching
• Strongly Competitive Algorithms for Paging with Locality of Reference
• The working set model for program behavior

Cited in

(4)

• scientific article; zbMATH DE number 65707 (Why is no real title available?)
• On list update with locality of reference
• scientific article; zbMATH DE number 1263239 (Why is no real title available?)
• Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis

This page was built for publication: On Certain New Models for Paging with Locality of Reference

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