PAGING MORE THAN ONE PAGE

In this paper we extend the Paging Problem to the case in which each r equest specifies a set of pages that must be present in fast memory to serve it. The interest on this extension is motivated by many applica tions in which the execution of each task may require the presence of more than one page in fast memory. We introduce three different cost m odels that can be applied in this framework, namely the Full, Uniform and Constant cost models, and study lower and upper bounds for each on e of them, using competitive analysis techniques.