Optimum checkpoints with age dependent failures

Summary This paper presents a method for obtaining the optimum checkpoint interval of a transaction processing computer system subject to time dependent failures. The system uses checkpointing to create a valid system state, and roll-back in order to recover from failures. Maximizing system availabi...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Gelenbe, Erol [verfasserIn] Hernández, Marisela

Format:	Artikel
Sprache:	Englisch

Erschienen:	1990

Schlagwörter:	Data Structure Communication Network Information Theory Computational Mathematic Computer System

Systematik:	SA 1220

Anmerkung:	© Springer-Verlag 1990

Übergeordnetes Werk:	Enthalten in: Acta informatica - Springer-Verlag, 1971, 27(1990), 6 vom: Mai, Seite 519-531
Übergeordnetes Werk:	volume:27 ; year:1990 ; number:6 ; month:05 ; pages:519-531

Links:	Volltext

DOI / URN:	10.1007/BF00277388

Katalog-ID:	OLC2056514532

Internformat


LEADER	01000caa a22002652 4500
001	OLC2056514532
003	DE-627
005	20230324021934.0
007	tu
008	200819s1990 xx \|\|\|\|\| 00\| \|\|eng c
024	7		\|a 10.1007/BF00277388 \|2 doi
035			\|a (DE-627)OLC2056514532
035			\|a (DE-He213)BF00277388-p
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
082	0	4	\|a 050 \|q VZ
084			\|a 24,1 \|2 ssgn
084			\|a SA 1220 \|q VZ \|2 rvk
100	1		\|a Gelenbe, Erol \|e verfasserin \|4 aut
245	1	0	\|a Optimum checkpoints with age dependent failures
264		1	\|c 1990
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 © Springer-Verlag 1990
520			\|a Summary This paper presents a method for obtaining the optimum checkpoint interval of a transaction processing computer system subject to time dependent failures. The system uses checkpointing to create a valid system state, and roll-back in order to recover from failures. Maximizing system availability we derive the optimum checkpoint interval as a function of the load of the system and of the time dependent failure rate. The results are illustrated numerically for the Weibull failure rate.
650		4	\|a Data Structure
650		4	\|a Communication Network
650		4	\|a Information Theory
650		4	\|a Computational Mathematic
650		4	\|a Computer System
700	1		\|a Hernández, Marisela \|4 aut
773	0	8	\|i Enthalten in \|t Acta informatica \|d Springer-Verlag, 1971 \|g 27(1990), 6 vom: Mai, Seite 519-531 \|w (DE-627)129288179 \|w (DE-600)120032-X \|w (DE-576)014469766 \|x 0001-5903 \|7 nnns
773	1	8	\|g volume:27 \|g year:1990 \|g number:6 \|g month:05 \|g pages:519-531
856	4	1	\|u https://doi.org/10.1007/BF00277388 \|z lizenzpflichtig \|3 Volltext
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-TEC
912			\|a SSG-OLC-MAT
912			\|a SSG-OPC-BBI
912			\|a GBV_ILN_11
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_65
912			\|a GBV_ILN_70
912			\|a GBV_ILN_130
912			\|a GBV_ILN_2002
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2006
912			\|a GBV_ILN_2010
912			\|a GBV_ILN_2018
912			\|a GBV_ILN_2020
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2088
912			\|a GBV_ILN_2244
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4046
912			\|a GBV_ILN_4082
912			\|a GBV_ILN_4103
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4193
912			\|a GBV_ILN_4266
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4310
912			\|a GBV_ILN_4311
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4318
912			\|a GBV_ILN_4319
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4700
936	r	v	\|a SA 1220
951			\|a AR
952			\|d 27 \|j 1990 \|e 6 \|c 05 \|h 519-531

Indexfelder

author_variant	e g eg m h mh
matchkey_str	article:00015903:1990----::piucekonsihgdpn
hierarchy_sort_str	1990
publishDate	1990
allfields	10.1007/BF00277388 doi (DE-627)OLC2056514532 (DE-He213)BF00277388-p DE-627 ger DE-627 rakwb eng 050 VZ 24,1 ssgn SA 1220 VZ rvk Gelenbe, Erol verfasserin aut Optimum checkpoints with age dependent failures 1990 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 1990 Summary This paper presents a method for obtaining the optimum checkpoint interval of a transaction processing computer system subject to time dependent failures. The system uses checkpointing to create a valid system state, and roll-back in order to recover from failures. Maximizing system availability we derive the optimum checkpoint interval as a function of the load of the system and of the time dependent failure rate. The results are illustrated numerically for the Weibull failure rate. Data Structure Communication Network Information Theory Computational Mathematic Computer System Hernández, Marisela aut Enthalten in Acta informatica Springer-Verlag, 1971 27(1990), 6 vom: Mai, Seite 519-531 (DE-627)129288179 (DE-600)120032-X (DE-576)014469766 0001-5903 nnns volume:27 year:1990 number:6 month:05 pages:519-531 https://doi.org/10.1007/BF00277388 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_11 GBV_ILN_24 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2002 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4103 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4193 GBV_ILN_4266 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4325 GBV_ILN_4700 SA 1220 AR 27 1990 6 05 519-531
spelling	10.1007/BF00277388 doi (DE-627)OLC2056514532 (DE-He213)BF00277388-p DE-627 ger DE-627 rakwb eng 050 VZ 24,1 ssgn SA 1220 VZ rvk Gelenbe, Erol verfasserin aut Optimum checkpoints with age dependent failures 1990 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 1990 Summary This paper presents a method for obtaining the optimum checkpoint interval of a transaction processing computer system subject to time dependent failures. The system uses checkpointing to create a valid system state, and roll-back in order to recover from failures. Maximizing system availability we derive the optimum checkpoint interval as a function of the load of the system and of the time dependent failure rate. The results are illustrated numerically for the Weibull failure rate. Data Structure Communication Network Information Theory Computational Mathematic Computer System Hernández, Marisela aut Enthalten in Acta informatica Springer-Verlag, 1971 27(1990), 6 vom: Mai, Seite 519-531 (DE-627)129288179 (DE-600)120032-X (DE-576)014469766 0001-5903 nnns volume:27 year:1990 number:6 month:05 pages:519-531 https://doi.org/10.1007/BF00277388 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_11 GBV_ILN_24 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2002 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4103 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4193 GBV_ILN_4266 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4325 GBV_ILN_4700 SA 1220 AR 27 1990 6 05 519-531
allfields_unstemmed	10.1007/BF00277388 doi (DE-627)OLC2056514532 (DE-He213)BF00277388-p DE-627 ger DE-627 rakwb eng 050 VZ 24,1 ssgn SA 1220 VZ rvk Gelenbe, Erol verfasserin aut Optimum checkpoints with age dependent failures 1990 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 1990 Summary This paper presents a method for obtaining the optimum checkpoint interval of a transaction processing computer system subject to time dependent failures. The system uses checkpointing to create a valid system state, and roll-back in order to recover from failures. Maximizing system availability we derive the optimum checkpoint interval as a function of the load of the system and of the time dependent failure rate. The results are illustrated numerically for the Weibull failure rate. Data Structure Communication Network Information Theory Computational Mathematic Computer System Hernández, Marisela aut Enthalten in Acta informatica Springer-Verlag, 1971 27(1990), 6 vom: Mai, Seite 519-531 (DE-627)129288179 (DE-600)120032-X (DE-576)014469766 0001-5903 nnns volume:27 year:1990 number:6 month:05 pages:519-531 https://doi.org/10.1007/BF00277388 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_11 GBV_ILN_24 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2002 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4103 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4193 GBV_ILN_4266 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4325 GBV_ILN_4700 SA 1220 AR 27 1990 6 05 519-531
allfieldsGer	10.1007/BF00277388 doi (DE-627)OLC2056514532 (DE-He213)BF00277388-p DE-627 ger DE-627 rakwb eng 050 VZ 24,1 ssgn SA 1220 VZ rvk Gelenbe, Erol verfasserin aut Optimum checkpoints with age dependent failures 1990 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 1990 Summary This paper presents a method for obtaining the optimum checkpoint interval of a transaction processing computer system subject to time dependent failures. The system uses checkpointing to create a valid system state, and roll-back in order to recover from failures. Maximizing system availability we derive the optimum checkpoint interval as a function of the load of the system and of the time dependent failure rate. The results are illustrated numerically for the Weibull failure rate. Data Structure Communication Network Information Theory Computational Mathematic Computer System Hernández, Marisela aut Enthalten in Acta informatica Springer-Verlag, 1971 27(1990), 6 vom: Mai, Seite 519-531 (DE-627)129288179 (DE-600)120032-X (DE-576)014469766 0001-5903 nnns volume:27 year:1990 number:6 month:05 pages:519-531 https://doi.org/10.1007/BF00277388 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_11 GBV_ILN_24 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2002 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4103 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4193 GBV_ILN_4266 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4325 GBV_ILN_4700 SA 1220 AR 27 1990 6 05 519-531
allfieldsSound	10.1007/BF00277388 doi (DE-627)OLC2056514532 (DE-He213)BF00277388-p DE-627 ger DE-627 rakwb eng 050 VZ 24,1 ssgn SA 1220 VZ rvk Gelenbe, Erol verfasserin aut Optimum checkpoints with age dependent failures 1990 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag 1990 Summary This paper presents a method for obtaining the optimum checkpoint interval of a transaction processing computer system subject to time dependent failures. The system uses checkpointing to create a valid system state, and roll-back in order to recover from failures. Maximizing system availability we derive the optimum checkpoint interval as a function of the load of the system and of the time dependent failure rate. The results are illustrated numerically for the Weibull failure rate. Data Structure Communication Network Information Theory Computational Mathematic Computer System Hernández, Marisela aut Enthalten in Acta informatica Springer-Verlag, 1971 27(1990), 6 vom: Mai, Seite 519-531 (DE-627)129288179 (DE-600)120032-X (DE-576)014469766 0001-5903 nnns volume:27 year:1990 number:6 month:05 pages:519-531 https://doi.org/10.1007/BF00277388 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_11 GBV_ILN_24 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2002 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4103 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4193 GBV_ILN_4266 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4325 GBV_ILN_4700 SA 1220 AR 27 1990 6 05 519-531
language	English
source	Enthalten in Acta informatica 27(1990), 6 vom: Mai, Seite 519-531 volume:27 year:1990 number:6 month:05 pages:519-531
sourceStr	Enthalten in Acta informatica 27(1990), 6 vom: Mai, Seite 519-531 volume:27 year:1990 number:6 month:05 pages:519-531
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Data Structure Communication Network Information Theory Computational Mathematic Computer System
dewey-raw	050
isfreeaccess_bool	false
container_title	Acta informatica
authorswithroles_txt_mv	Gelenbe, Erol @@aut@@ Hernández, Marisela @@aut@@
publishDateDaySort_date	1990-05-01T00:00:00Z
hierarchy_top_id	129288179
dewey-sort	250
id	OLC2056514532
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">OLC2056514532</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230324021934.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1990 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF00277388</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2056514532</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF00277388-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">050</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">24,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 1220</subfield><subfield code="q">VZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gelenbe, Erol</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimum checkpoints with age dependent failures</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1990</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">© Springer-Verlag 1990</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Summary This paper presents a method for obtaining the optimum checkpoint interval of a transaction processing computer system subject to time dependent failures. The system uses checkpointing to create a valid system state, and roll-back in order to recover from failures. Maximizing system availability we derive the optimum checkpoint interval as a function of the load of the system and of the time dependent failure rate. The results are illustrated numerically for the Weibull failure rate.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Structure</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Communication Network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational Mathematic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer System</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hernández, Marisela</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Acta informatica</subfield><subfield code="d">Springer-Verlag, 1971</subfield><subfield code="g">27(1990), 6 vom: Mai, Seite 519-531</subfield><subfield code="w">(DE-627)129288179</subfield><subfield code="w">(DE-600)120032-X</subfield><subfield code="w">(DE-576)014469766</subfield><subfield code="x">0001-5903</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:27</subfield><subfield code="g">year:1990</subfield><subfield code="g">number:6</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:519-531</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF00277388</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-TEC</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-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</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_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</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_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</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_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4082</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4103</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4193</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_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4310</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4311</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 1220</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">27</subfield><subfield code="j">1990</subfield><subfield code="e">6</subfield><subfield code="c">05</subfield><subfield code="h">519-531</subfield></datafield></record></collection>
author	Gelenbe, Erol
spellingShingle	Gelenbe, Erol ddc 050 ssgn 24,1 rvk SA 1220 misc Data Structure misc Communication Network misc Information Theory misc Computational Mathematic misc Computer System Optimum checkpoints with age dependent failures
authorStr	Gelenbe, Erol
ppnlink_with_tag_str_mv	@@773@@(DE-627)129288179
format	Article
dewey-ones	050 - General serial publications
delete_txt_mv	keep
author_role	aut aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	0001-5903
topic_title	050 VZ 24,1 ssgn SA 1220 VZ rvk Optimum checkpoints with age dependent failures Data Structure Communication Network Information Theory Computational Mathematic Computer System
topic	ddc 050 ssgn 24,1 rvk SA 1220 misc Data Structure misc Communication Network misc Information Theory misc Computational Mathematic misc Computer System
topic_unstemmed	ddc 050 ssgn 24,1 rvk SA 1220 misc Data Structure misc Communication Network misc Information Theory misc Computational Mathematic misc Computer System
topic_browse	ddc 050 ssgn 24,1 rvk SA 1220 misc Data Structure misc Communication Network misc Information Theory misc Computational Mathematic misc Computer System
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
hierarchy_parent_title	Acta informatica
hierarchy_parent_id	129288179
dewey-tens	050 - Magazines, journals & serials
hierarchy_top_title	Acta informatica
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)129288179 (DE-600)120032-X (DE-576)014469766
title	Optimum checkpoints with age dependent failures
ctrlnum	(DE-627)OLC2056514532 (DE-He213)BF00277388-p
title_full	Optimum checkpoints with age dependent failures
author_sort	Gelenbe, Erol
journal	Acta informatica
journalStr	Acta informatica
lang_code	eng
isOA_bool	false
dewey-hundreds	000 - Computer science, information & general works
recordtype	marc
publishDateSort	1990
contenttype_str_mv	txt
container_start_page	519
author_browse	Gelenbe, Erol Hernández, Marisela
container_volume	27
class	050 VZ 24,1 ssgn SA 1220 VZ rvk
format_se	Aufsätze
author-letter	Gelenbe, Erol
doi_str_mv	10.1007/BF00277388
dewey-full	050
title_sort	optimum checkpoints with age dependent failures
title_auth	Optimum checkpoints with age dependent failures
abstract	Summary This paper presents a method for obtaining the optimum checkpoint interval of a transaction processing computer system subject to time dependent failures. The system uses checkpointing to create a valid system state, and roll-back in order to recover from failures. Maximizing system availability we derive the optimum checkpoint interval as a function of the load of the system and of the time dependent failure rate. The results are illustrated numerically for the Weibull failure rate. © Springer-Verlag 1990
abstractGer	Summary This paper presents a method for obtaining the optimum checkpoint interval of a transaction processing computer system subject to time dependent failures. The system uses checkpointing to create a valid system state, and roll-back in order to recover from failures. Maximizing system availability we derive the optimum checkpoint interval as a function of the load of the system and of the time dependent failure rate. The results are illustrated numerically for the Weibull failure rate. © Springer-Verlag 1990
abstract_unstemmed	Summary This paper presents a method for obtaining the optimum checkpoint interval of a transaction processing computer system subject to time dependent failures. The system uses checkpointing to create a valid system state, and roll-back in order to recover from failures. Maximizing system availability we derive the optimum checkpoint interval as a function of the load of the system and of the time dependent failure rate. The results are illustrated numerically for the Weibull failure rate. © Springer-Verlag 1990
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT SSG-OPC-BBI GBV_ILN_11 GBV_ILN_24 GBV_ILN_31 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_65 GBV_ILN_70 GBV_ILN_130 GBV_ILN_2002 GBV_ILN_2005 GBV_ILN_2006 GBV_ILN_2010 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2088 GBV_ILN_2244 GBV_ILN_4012 GBV_ILN_4046 GBV_ILN_4082 GBV_ILN_4103 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4193 GBV_ILN_4266 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4310 GBV_ILN_4311 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 GBV_ILN_4325 GBV_ILN_4700
container_issue	6
title_short	Optimum checkpoints with age dependent failures
url	https://doi.org/10.1007/BF00277388
remote_bool	false
author2	Hernández, Marisela
author2Str	Hernández, Marisela
ppnlink	129288179
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1007/BF00277388
up_date	2024-07-04T04:32:13.043Z
_version_	1803621533533339648
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">OLC2056514532</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230324021934.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1990 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF00277388</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2056514532</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF00277388-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">050</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">24,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SA 1220</subfield><subfield code="q">VZ</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Gelenbe, Erol</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Optimum checkpoints with age dependent failures</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1990</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">© Springer-Verlag 1990</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Summary This paper presents a method for obtaining the optimum checkpoint interval of a transaction processing computer system subject to time dependent failures. The system uses checkpointing to create a valid system state, and roll-back in order to recover from failures. Maximizing system availability we derive the optimum checkpoint interval as a function of the load of the system and of the time dependent failure rate. The results are illustrated numerically for the Weibull failure rate.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data Structure</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Communication Network</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational Mathematic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer System</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hernández, Marisela</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Acta informatica</subfield><subfield code="d">Springer-Verlag, 1971</subfield><subfield code="g">27(1990), 6 vom: Mai, Seite 519-531</subfield><subfield code="w">(DE-627)129288179</subfield><subfield code="w">(DE-600)120032-X</subfield><subfield code="w">(DE-576)014469766</subfield><subfield code="x">0001-5903</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:27</subfield><subfield code="g">year:1990</subfield><subfield code="g">number:6</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:519-531</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF00277388</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-TEC</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-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</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_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</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_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2002</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</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_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2088</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4082</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4103</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4193</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_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4310</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4311</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</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="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="r" ind2="v"><subfield code="a">SA 1220</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">27</subfield><subfield code="j">1990</subfield><subfield code="e">6</subfield><subfield code="c">05</subfield><subfield code="h">519-531</subfield></datafield></record></collection>
score	7.403097

Nicht das Richtige dabei?

Schreiben Sie uns!

Optimum checkpoints with age dependent failures

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?