Number of the records: 1

Algorithms for testing fault-tolerance of sequenced jobs

SYSNO ASEP	0338975
Document Type	J - Journal Article
R&D Document Type	Journal Article
Subsidiary J	Článek ve WOS
Title	Algorithms for testing fault-tolerance of sequenced jobs
Author(s)	Chrobak, M. (US) Hurand, M. (FR) Sgall, Jiří (MU-W)_{RID, ORCID, SAI}
Source Title	Journal of Scheduling - ISSN 1094-6136 Roč. 12, č. 5 (2009), s. 501-515
Number of pages	15 s.
Language	eng - English
Country	US - United States
Keywords	sequencing algorithms ; fault-tolerance ; dynamic programming
Subject RIV	IN - Informatics, Computer Science
R&D Projects	1M0545 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
	IAA100190902 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
	IAA1019401 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
UT WOS	000270340900007
DOI	10.1007/s10951-009-0126-8
Annotation	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.
Workplace	Mathematical Institute
Contact	Jarmila Štruncová, struncova@math.cas.cz, library@math.cas.cz, Tel.: 222 090 757
Year of Publishing	2010

Number of the records: 1