Paging more than one page

Mostrar todas las versiones(3)

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...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Feuerstein, E.
Formato:	Artículo publishedVersion
Publicado:	1997
Materias:	Mathematical models Problem solving Paging problem Storage allocation (computer)
Acceso en línea:	http://hdl.handle.net/20.500.12110/paper_03043975_v181_n1_p75_Feuerstein http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_03043975_v181_n1_p75_Feuerstein_oai
Aporte de:	Repositorio Digital de la Universidad de Buenos Aires (UBA) de Universidad de Buenos Aires

id	I28-R145-paper_03043975_v181_n1_p75_Feuerstein_oai
record_format	dspace
spelling	I28-R145-paper_03043975_v181_n1_p75_Feuerstein_oai2020-10-19 Feuerstein, E. 1997 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. application/pdf http://hdl.handle.net/20.500.12110/paper_03043975_v181_n1_p75_Feuerstein info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar Theor Comput Sci 1997;181(1):75-90 Mathematical models Problem solving Paging problem Storage allocation (computer) Paging more than one page info:eu-repo/semantics/article info:ar-repo/semantics/artículo info:eu-repo/semantics/publishedVersion http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_03043975_v181_n1_p75_Feuerstein_oai
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-145
collection	Repositorio Digital de la Universidad de Buenos Aires (UBA)
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 http://repositoriouba.sisbi.uba.ar/gsdl/cgi-bin/library.cgi?a=d&c=artiaex&d=paper_03043975_v181_n1_p75_Feuerstein_oai
work_keys_str_mv	AT feuersteine pagingmorethanonepage
_version_	1766026689155956736

Paging more than one page

Ejemplares similares