Paging with Request Sets

Leah Epstein, Rob Van Stee, Tami Tamir

Research output: Contribution to journalArticlepeer-review


A generalized paging problem is considered. Each request is expressed as a set of u pages. In order to satisfy the request, at least one of these pages must be in the cache. Therefore, on a page fault, the algorithm must load into the cache at least one page out of the u pages given in the request. The problem arises in systems in which requests can be serviced by various utilities (e.g., a request for a data that lies in various web-pages) and a single utility can service many requests (e.g., a web-page containing various data). The server has the freedom to select the utility that will service the next request and hopefully additional requests in the future.
Original languageEnglish
Pages (from-to)67-81
Number of pages15
JournalTheory of Computing Systems
Issue number1
StatePublished - 3 Jul 2009


Dive into the research topics of 'Paging with Request Sets'. Together they form a unique fingerprint.

Cite this