Algorithms for testing fault-tolerance of sequenced jobs

0338975 - MÚ 2010 RIV US eng J - Journal Article
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
R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902; GA AV ČR IAA1019401
Keywords : sequencing algorithms * fault-tolerance * dynamic programming
Subject RIV: IN - Informatics, Computer Science
Impact factor: 1.265, year: 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.
Permanent Link: http://hdl.handle.net/11104/0182616