Počet záznamů: 1
Algorithms for testing fault-tolerance of sequenced jobs
- 1.0338975 - MÚ 2010 RIV US eng J - Článek v odborném periodiku
Chrobak, M. - Hurand, M. - Sgall, Jiří
Algorithms for testing fault-tolerance of sequenced jobs.
Journal of Scheduling. Roč. 12, č. 5 (2009), s. 501-515. ISSN 1094-6136. E-ISSN 1099-1425
Grant CEP: GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902; GA AV ČR IAA1019401
Klíčová slova: sequencing algorithms * fault-tolerance * dynamic programming
Kód oboru RIV: IN - Informatika
Impakt faktor: 1.265, rok: 2009
We study the problem of testing whether a given set of sequenced jobs can tolerate transient faults. We present efficient algorithms for this problem in several fault models. A fault model describes what types of faults are allowed and specifies assumptions on their frequency. Two types of faults are considered: hidden faults, that can only be detected after a job completes, and exposed faults, that can be detected immediately.
Trvalý link: http://hdl.handle.net/11104/0182616
Název souboru Staženo Velikost Komentář Verze Přístup Sgall1.pdf 1 579 KB Vydavatelský postprint vyžádat
Počet záznamů: 1