Paging more than one page
In this paper we extend the Paging Problem to the case in which each request specifies a set of pages that must be present in fast memory to serve it. The interest on this extension is motivated by many applications in which the execution of each task may require the presence of more than one page i...
Guardado en:
| Publicado: |
1997
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03043975_v181_n1_p75_Feuerstein http://hdl.handle.net/20.500.12110/paper_03043975_v181_n1_p75_Feuerstein |
| Aporte de: |
| id |
paper:paper_03043975_v181_n1_p75_Feuerstein |
|---|---|
| record_format |
dspace |
| spelling |
paper:paper_03043975_v181_n1_p75_Feuerstein2023-06-08T15:29:34Z Paging more than one page Mathematical models Problem solving Paging problem Storage allocation (computer) In this paper we extend the Paging Problem to the case in which each request specifies a set of pages that must be present in fast memory to serve it. The interest on this extension is motivated by many applications in which the execution of each task may require the presence of more than one page in fast memory. We introduce three different cost models that can be applied in this framework, namely the Full, Uniform and Constant cost models, and study lower and upper bounds for each one of them, using competitive analysis techniques. 1997 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03043975_v181_n1_p75_Feuerstein http://hdl.handle.net/20.500.12110/paper_03043975_v181_n1_p75_Feuerstein |
| institution |
Universidad de Buenos Aires |
| institution_str |
I-28 |
| repository_str |
R-134 |
| collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
| topic |
Mathematical models Problem solving Paging problem Storage allocation (computer) |
| spellingShingle |
Mathematical models Problem solving Paging problem Storage allocation (computer) Paging more than one page |
| topic_facet |
Mathematical models Problem solving Paging problem Storage allocation (computer) |
| description |
In this paper we extend the Paging Problem to the case in which each request specifies a set of pages that must be present in fast memory to serve it. The interest on this extension is motivated by many applications in which the execution of each task may require the presence of more than one page in fast memory. We introduce three different cost models that can be applied in this framework, namely the Full, Uniform and Constant cost models, and study lower and upper bounds for each one of them, using competitive analysis techniques. |
| title |
Paging more than one page |
| title_short |
Paging more than one page |
| title_full |
Paging more than one page |
| title_fullStr |
Paging more than one page |
| title_full_unstemmed |
Paging more than one page |
| title_sort |
paging more than one page |
| publishDate |
1997 |
| url |
https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03043975_v181_n1_p75_Feuerstein http://hdl.handle.net/20.500.12110/paper_03043975_v181_n1_p75_Feuerstein |
| _version_ |
1768543560366292992 |