Paging more than one page

Autores
Feuerstein, E.
Año de publicación
1997
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
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.
Fuente
Theor Comput Sci 1997;181(1):75-90
Materia
Mathematical models
Problem solving
Paging problem
Storage allocation (computer)
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by/2.5/ar
Repositorio
Biblioteca Digital (UBA-FCEN)
Institución
Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
OAI Identificador
paperaa:paper_03043975_v181_n1_p75_Feuerstein
Acceder
id BDUBAFCEN_d8cd7d66da76ddf1eb10b38e0a77e9fd
oai_identifier_str paperaa:paper_03043975_v181_n1_p75_Feuerstein
network_acronym_str BDUBAFCEN
repository_id_str 1896
network_name_str Biblioteca Digital (UBA-FCEN)
spelling Paging more than one pageFeuerstein, E.Mathematical modelsProblem solvingPaging problemStorage 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.1997info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfhttp://hdl.handle.net/20.500.12110/paper_03043975_v181_n1_p75_FeuersteinTheor Comput Sci 1997;181(1):75-90reponame:Biblioteca Digital (UBA-FCEN)instname:Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesinstacron:UBA-FCENenginfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by/2.5/ar2025-09-29T13:43:00Zpaperaa:paper_03043975_v181_n1_p75_FeuersteinInstitucionalhttps://digital.bl.fcen.uba.ar/Universidad públicaNo correspondehttps://digital.bl.fcen.uba.ar/cgi-bin/oaiserver.cgiana@bl.fcen.uba.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:18962025-09-29 13:43:01.615Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturalesfalse
dc.title.none.fl_str_mv Paging more than one page
title Paging more than one page
spellingShingle Paging more than one page
Feuerstein, E.
Mathematical models
Problem solving
Paging problem
Storage allocation (computer)
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
dc.creator.none.fl_str_mv Feuerstein, E.
author Feuerstein, E.
author_facet Feuerstein, E.
author_role author
dc.subject.none.fl_str_mv Mathematical models
Problem solving
Paging problem
Storage allocation (computer)
topic Mathematical models
Problem solving
Paging problem
Storage allocation (computer)
dc.description.none.fl_txt_mv 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.
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.
publishDate 1997
dc.date.none.fl_str_mv 1997
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/20.500.12110/paper_03043975_v181_n1_p75_Feuerstein
url http://hdl.handle.net/20.500.12110/paper_03043975_v181_n1_p75_Feuerstein
dc.language.none.fl_str_mv eng
language eng
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by/2.5/ar
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by/2.5/ar
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv Theor Comput Sci 1997;181(1):75-90
reponame:Biblioteca Digital (UBA-FCEN)
instname:Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron:UBA-FCEN
reponame_str Biblioteca Digital (UBA-FCEN)
collection Biblioteca Digital (UBA-FCEN)
instname_str Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
instacron_str UBA-FCEN
institution UBA-FCEN
repository.name.fl_str_mv Biblioteca Digital (UBA-FCEN) - Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales
repository.mail.fl_str_mv ana@bl.fcen.uba.ar
_version_ 1844618737232117760
score 13.070432

Publicaciones similares