Caching Is Hard—Even in the Fault Model

Abstract We prove strong ${\mathbb {NP}}$-completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Chrobak, Marek [verfasserIn] Woeginger, Gerhard J. Makino, Kazuhisa Xu, Haifeng

Format:	Artikel
Sprache:	Englisch

Erschienen:	2011

Schlagwörter:	Fault Model Vertex Cover Cache Size Page Fault Request Sequence

Anmerkung:	© The Author(s) 2011

Übergeordnetes Werk:	Enthalten in: Algorithmica - Springer-Verlag, 1986, 63(2011), 4 vom: 10. März, Seite 781-794
Übergeordnetes Werk:	volume:63 ; year:2011 ; number:4 ; day:10 ; month:03 ; pages:781-794

Links:	Volltext

DOI / URN:	10.1007/s00453-011-9502-9

Katalog-ID:	OLC2054844624

Internformat


LEADER	01000caa a22002652 4500
001	OLC2054844624
003	DE-627
005	20230403074058.0
007	tu
008	200819s2011 xx \|\|\|\|\| 00\| \|\|eng c
024	7		\|a 10.1007/s00453-011-9502-9 \|2 doi
035			\|a (DE-627)OLC2054844624
035			\|a (DE-He213)s00453-011-9502-9-p
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
082	0	4	\|a 004 \|q VZ
082	0	4	\|a 510 \|a 004 \|q VZ
100	1		\|a Chrobak, Marek \|e verfasserin \|4 aut
245	1	0	\|a Caching Is Hard—Even in the Fault Model
264		1	\|c 2011
336			\|a Text \|b txt \|2 rdacontent
337			\|a ohne Hilfsmittel zu benutzen \|b n \|2 rdamedia
338			\|a Band \|b nc \|2 rdacarrier
500			\|a © The Author(s) 2011
520			\|a Abstract We prove strong ${\mathbb {NP}}$-completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions in the area of paging and caching that were open since the 1990s.
650		4	\|a Fault Model
650		4	\|a Vertex Cover
650		4	\|a Cache Size
650		4	\|a Page Fault
650		4	\|a Request Sequence
700	1		\|a Woeginger, Gerhard J. \|4 aut
700	1		\|a Makino, Kazuhisa \|4 aut
700	1		\|a Xu, Haifeng \|4 aut
773	0	8	\|i Enthalten in \|t Algorithmica \|d Springer-Verlag, 1986 \|g 63(2011), 4 vom: 10. März, Seite 781-794 \|w (DE-627)129197564 \|w (DE-600)53958-2 \|w (DE-576)014456958 \|x 0178-4617 \|7 nnns
773	1	8	\|g volume:63 \|g year:2011 \|g number:4 \|g day:10 \|g month:03 \|g pages:781-794
856	4	1	\|u https://doi.org/10.1007/s00453-011-9502-9 \|z lizenzpflichtig \|3 Volltext
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-MAT
912			\|a SSG-OPC-MAT
912			\|a GBV_ILN_22
912			\|a GBV_ILN_24
912			\|a GBV_ILN_32
912			\|a GBV_ILN_65
912			\|a GBV_ILN_70
912			\|a GBV_ILN_105
912			\|a GBV_ILN_130
912			\|a GBV_ILN_2012
912			\|a GBV_ILN_2018
912			\|a GBV_ILN_2045
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_4266
912			\|a GBV_ILN_4318
912			\|a GBV_ILN_4319
951			\|a AR
952			\|d 63 \|j 2011 \|e 4 \|b 10 \|c 03 \|h 781-794

Indexfelder

author_variant	m c mc g j w gj gjw k m km h x hx
matchkey_str	article:01784617:2011----::ahnihreeitea
hierarchy_sort_str	2011
publishDate	2011
allfields	10.1007/s00453-011-9502-9 doi (DE-627)OLC2054844624 (DE-He213)s00453-011-9502-9-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Chrobak, Marek verfasserin aut Caching Is Hard—Even in the Fault Model 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2011 Abstract We prove strong ${\mathbb {NP}}$-completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions in the area of paging and caching that were open since the 1990s. Fault Model Vertex Cover Cache Size Page Fault Request Sequence Woeginger, Gerhard J. aut Makino, Kazuhisa aut Xu, Haifeng aut Enthalten in Algorithmica Springer-Verlag, 1986 63(2011), 4 vom: 10. März, Seite 781-794 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:63 year:2011 number:4 day:10 month:03 pages:781-794 https://doi.org/10.1007/s00453-011-9502-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_32 GBV_ILN_65 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2045 GBV_ILN_2190 GBV_ILN_4266 GBV_ILN_4318 GBV_ILN_4319 AR 63 2011 4 10 03 781-794
spelling	10.1007/s00453-011-9502-9 doi (DE-627)OLC2054844624 (DE-He213)s00453-011-9502-9-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Chrobak, Marek verfasserin aut Caching Is Hard—Even in the Fault Model 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2011 Abstract We prove strong ${\mathbb {NP}}$-completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions in the area of paging and caching that were open since the 1990s. Fault Model Vertex Cover Cache Size Page Fault Request Sequence Woeginger, Gerhard J. aut Makino, Kazuhisa aut Xu, Haifeng aut Enthalten in Algorithmica Springer-Verlag, 1986 63(2011), 4 vom: 10. März, Seite 781-794 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:63 year:2011 number:4 day:10 month:03 pages:781-794 https://doi.org/10.1007/s00453-011-9502-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_32 GBV_ILN_65 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2045 GBV_ILN_2190 GBV_ILN_4266 GBV_ILN_4318 GBV_ILN_4319 AR 63 2011 4 10 03 781-794
allfields_unstemmed	10.1007/s00453-011-9502-9 doi (DE-627)OLC2054844624 (DE-He213)s00453-011-9502-9-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Chrobak, Marek verfasserin aut Caching Is Hard—Even in the Fault Model 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2011 Abstract We prove strong ${\mathbb {NP}}$-completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions in the area of paging and caching that were open since the 1990s. Fault Model Vertex Cover Cache Size Page Fault Request Sequence Woeginger, Gerhard J. aut Makino, Kazuhisa aut Xu, Haifeng aut Enthalten in Algorithmica Springer-Verlag, 1986 63(2011), 4 vom: 10. März, Seite 781-794 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:63 year:2011 number:4 day:10 month:03 pages:781-794 https://doi.org/10.1007/s00453-011-9502-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_32 GBV_ILN_65 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2045 GBV_ILN_2190 GBV_ILN_4266 GBV_ILN_4318 GBV_ILN_4319 AR 63 2011 4 10 03 781-794
allfieldsGer	10.1007/s00453-011-9502-9 doi (DE-627)OLC2054844624 (DE-He213)s00453-011-9502-9-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Chrobak, Marek verfasserin aut Caching Is Hard—Even in the Fault Model 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2011 Abstract We prove strong ${\mathbb {NP}}$-completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions in the area of paging and caching that were open since the 1990s. Fault Model Vertex Cover Cache Size Page Fault Request Sequence Woeginger, Gerhard J. aut Makino, Kazuhisa aut Xu, Haifeng aut Enthalten in Algorithmica Springer-Verlag, 1986 63(2011), 4 vom: 10. März, Seite 781-794 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:63 year:2011 number:4 day:10 month:03 pages:781-794 https://doi.org/10.1007/s00453-011-9502-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_32 GBV_ILN_65 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2045 GBV_ILN_2190 GBV_ILN_4266 GBV_ILN_4318 GBV_ILN_4319 AR 63 2011 4 10 03 781-794
allfieldsSound	10.1007/s00453-011-9502-9 doi (DE-627)OLC2054844624 (DE-He213)s00453-011-9502-9-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Chrobak, Marek verfasserin aut Caching Is Hard—Even in the Fault Model 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s) 2011 Abstract We prove strong ${\mathbb {NP}}$-completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions in the area of paging and caching that were open since the 1990s. Fault Model Vertex Cover Cache Size Page Fault Request Sequence Woeginger, Gerhard J. aut Makino, Kazuhisa aut Xu, Haifeng aut Enthalten in Algorithmica Springer-Verlag, 1986 63(2011), 4 vom: 10. März, Seite 781-794 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:63 year:2011 number:4 day:10 month:03 pages:781-794 https://doi.org/10.1007/s00453-011-9502-9 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_32 GBV_ILN_65 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2045 GBV_ILN_2190 GBV_ILN_4266 GBV_ILN_4318 GBV_ILN_4319 AR 63 2011 4 10 03 781-794
language	English
source	Enthalten in Algorithmica 63(2011), 4 vom: 10. März, Seite 781-794 volume:63 year:2011 number:4 day:10 month:03 pages:781-794
sourceStr	Enthalten in Algorithmica 63(2011), 4 vom: 10. März, Seite 781-794 volume:63 year:2011 number:4 day:10 month:03 pages:781-794
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Fault Model Vertex Cover Cache Size Page Fault Request Sequence
dewey-raw	004
isfreeaccess_bool	false
container_title	Algorithmica
authorswithroles_txt_mv	Chrobak, Marek @@aut@@ Woeginger, Gerhard J. @@aut@@ Makino, Kazuhisa @@aut@@ Xu, Haifeng @@aut@@
publishDateDaySort_date	2011-03-10T00:00:00Z
hierarchy_top_id	129197564
dewey-sort	14
id	OLC2054844624
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2054844624</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230403074058.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2011 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00453-011-9502-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054844624</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00453-011-9502-9-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chrobak, Marek</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Caching Is Hard—Even in the Fault Model</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s) 2011</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We prove strong ${\mathbb {NP}}$-completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions in the area of paging and caching that were open since the 1990s.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault Model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Vertex Cover</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cache Size</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Page Fault</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Request Sequence</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Woeginger, Gerhard J.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Makino, Kazuhisa</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xu, Haifeng</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Algorithmica</subfield><subfield code="d">Springer-Verlag, 1986</subfield><subfield code="g">63(2011), 4 vom: 10. März, Seite 781-794</subfield><subfield code="w">(DE-627)129197564</subfield><subfield code="w">(DE-600)53958-2</subfield><subfield code="w">(DE-576)014456958</subfield><subfield code="x">0178-4617</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:63</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:4</subfield><subfield code="g">day:10</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:781-794</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00453-011-9502-9</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2045</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">63</subfield><subfield code="j">2011</subfield><subfield code="e">4</subfield><subfield code="b">10</subfield><subfield code="c">03</subfield><subfield code="h">781-794</subfield></datafield></record></collection>
author	Chrobak, Marek
spellingShingle	Chrobak, Marek ddc 004 ddc 510 misc Fault Model misc Vertex Cover misc Cache Size misc Page Fault misc Request Sequence Caching Is Hard—Even in the Fault Model
authorStr	Chrobak, Marek
ppnlink_with_tag_str_mv	@@773@@(DE-627)129197564
format	Article
dewey-ones	004 - Data processing & computer science 510 - Mathematics
delete_txt_mv	keep
author_role	aut aut aut aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	0178-4617
topic_title	004 VZ 510 004 VZ Caching Is Hard—Even in the Fault Model Fault Model Vertex Cover Cache Size Page Fault Request Sequence
topic	ddc 004 ddc 510 misc Fault Model misc Vertex Cover misc Cache Size misc Page Fault misc Request Sequence
topic_unstemmed	ddc 004 ddc 510 misc Fault Model misc Vertex Cover misc Cache Size misc Page Fault misc Request Sequence
topic_browse	ddc 004 ddc 510 misc Fault Model misc Vertex Cover misc Cache Size misc Page Fault misc Request Sequence
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
hierarchy_parent_title	Algorithmica
hierarchy_parent_id	129197564
dewey-tens	000 - Computer science, knowledge & systems 510 - Mathematics
hierarchy_top_title	Algorithmica
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)129197564 (DE-600)53958-2 (DE-576)014456958
title	Caching Is Hard—Even in the Fault Model
ctrlnum	(DE-627)OLC2054844624 (DE-He213)s00453-011-9502-9-p
title_full	Caching Is Hard—Even in the Fault Model
author_sort	Chrobak, Marek
journal	Algorithmica
journalStr	Algorithmica
lang_code	eng
isOA_bool	false
dewey-hundreds	000 - Computer science, information & general works 500 - Science
recordtype	marc
publishDateSort	2011
contenttype_str_mv	txt
container_start_page	781
author_browse	Chrobak, Marek Woeginger, Gerhard J. Makino, Kazuhisa Xu, Haifeng
container_volume	63
class	004 VZ 510 004 VZ
format_se	Aufsätze
author-letter	Chrobak, Marek
doi_str_mv	10.1007/s00453-011-9502-9
dewey-full	004 510
title_sort	caching is hard—even in the fault model
title_auth	Caching Is Hard—Even in the Fault Model
abstract	Abstract We prove strong ${\mathbb {NP}}$-completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions in the area of paging and caching that were open since the 1990s. © The Author(s) 2011
abstractGer	Abstract We prove strong ${\mathbb {NP}}$-completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions in the area of paging and caching that were open since the 1990s. © The Author(s) 2011
abstract_unstemmed	Abstract We prove strong ${\mathbb {NP}}$-completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions in the area of paging and caching that were open since the 1990s. © The Author(s) 2011
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_22 GBV_ILN_24 GBV_ILN_32 GBV_ILN_65 GBV_ILN_70 GBV_ILN_105 GBV_ILN_130 GBV_ILN_2012 GBV_ILN_2018 GBV_ILN_2045 GBV_ILN_2190 GBV_ILN_4266 GBV_ILN_4318 GBV_ILN_4319
container_issue	4
title_short	Caching Is Hard—Even in the Fault Model
url	https://doi.org/10.1007/s00453-011-9502-9
remote_bool	false
author2	Woeginger, Gerhard J. Makino, Kazuhisa Xu, Haifeng
author2Str	Woeginger, Gerhard J. Makino, Kazuhisa Xu, Haifeng
ppnlink	129197564
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1007/s00453-011-9502-9
up_date	2024-07-04T00:35:13.280Z
_version_	1803606623029035008
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2054844624</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230403074058.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s2011 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00453-011-9502-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054844624</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00453-011-9502-9-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Chrobak, Marek</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Caching Is Hard—Even in the Fault Model</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© The Author(s) 2011</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract We prove strong ${\mathbb {NP}}$-completeness for the four variants of caching with multi-size pages. These four variants are obtained by choosing either the fault cost or the bit cost model, and by combining it with either a forced or an optional caching policy. This resolves two questions in the area of paging and caching that were open since the 1990s.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fault Model</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Vertex Cover</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cache Size</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Page Fault</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Request Sequence</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Woeginger, Gerhard J.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Makino, Kazuhisa</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Xu, Haifeng</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Algorithmica</subfield><subfield code="d">Springer-Verlag, 1986</subfield><subfield code="g">63(2011), 4 vom: 10. März, Seite 781-794</subfield><subfield code="w">(DE-627)129197564</subfield><subfield code="w">(DE-600)53958-2</subfield><subfield code="w">(DE-576)014456958</subfield><subfield code="x">0178-4617</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:63</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:4</subfield><subfield code="g">day:10</subfield><subfield code="g">month:03</subfield><subfield code="g">pages:781-794</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00453-011-9502-9</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2045</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">63</subfield><subfield code="j">2011</subfield><subfield code="e">4</subfield><subfield code="b">10</subfield><subfield code="c">03</subfield><subfield code="h">781-794</subfield></datafield></record></collection>
score	7.399625

Nicht das Richtige dabei?

Schreiben Sie uns!

Caching Is Hard—Even in the Fault Model

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?