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:
| Autor principal: | |
|---|---|
| Formato: | Artículo publishedVersion |
| Lenguaje: | Inglés |
| Publicado: |
1997
|
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_03043975_v181_n1_p75_Feuerstein |
| Aporte de: |
| id |
paperaa:paper_03043975_v181_n1_p75_Feuerstein |
|---|---|
| record_format |
dspace |
| spelling |
paperaa:paper_03043975_v181_n1_p75_Feuerstein2023-06-12T16:47:25Z Paging more than one page Theor Comput Sci 1997;181(1):75-90 Feuerstein, E. 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 info:eu-repo/semantics/article info:ar-repo/semantics/artículo info:eu-repo/semantics/publishedVersion application/pdf eng info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar 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) |
| language |
Inglés |
| orig_language_str_mv |
eng |
| topic |
Mathematical models Problem solving Paging problem Storage allocation (computer) |
| spellingShingle |
Mathematical models Problem solving Paging problem Storage allocation (computer) Feuerstein, E. 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. |
| format |
Artículo Artículo publishedVersion |
| author |
Feuerstein, E. |
| author_facet |
Feuerstein, E. |
| author_sort |
Feuerstein, E. |
| 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 |
http://hdl.handle.net/20.500.12110/paper_03043975_v181_n1_p75_Feuerstein |
| work_keys_str_mv |
AT feuersteine pagingmorethanonepage |
| _version_ |
1769810232730451968 |