On Certain New Models for Paging with Locality of Reference

DOI10.1007/978-3-540-77891-2_19zbMATH Open1132.68826OpenAlexW1591135906MaRDI QIDQ5452166FDOQ5452166

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

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Cites Work

• Title not available (Why is that?)
• A unified analysis of paging and caching
• Competitive paging with locality of reference
• On the separation and equivalence of paging strategies
• On paging with locality of reference
• Competitive paging algorithms
• The working set model for program behavior
• On adequate performance measures for paging
• Strongly Competitive Algorithms for Paging with Locality of Reference
• On-line file caching
• Page replacement with multi-size pages and applications to web caching

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On list update with locality of reference
• 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)