Back to search

University of Waterloo

The Pair Cache Problem

Abstract

dc:description.abstract

This thesis investigates the pair cache problem, a unique variation of the classic cache replacement problem where each element is stored in two pages, and the cache only needs one of these pages to respond to a query. The thesis formalizes the definition of the pair cache problem, explores relevant historical background, and investigates both offline and online cases. In the offline case, we show that approximating the problem with a factor less than two is NP-hard, while in the online case, we extend the FIFO algorithm and prove that it works as a 4-factor approximation. The proposed pair cache scheme has practical applications in systems where data retrieval times are slow, and most processes require information stored in two different data sources. The goal of a pair cache management algorithm is to minimize the number of retrievals by deciding which page to retrieve on a miss and which page to discard when the cache is full.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2023

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Khodaee, SayedMohammadAmin
Advisor dc:contributor.advisor
  • Munro, J Ian

Subjects

dc:subject × 3

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/19927

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Khodaee, SayedMohammadAmin. The Pair Cache Problem. University of Waterloo, 2023. http://hdl.handle.net/10012/19927