Fast algorithms for testing fault-tolerance of sequenced jobs with deadlines
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F07%3A00318552" target="_blank" >RIV/67985840:_____/07:00318552 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Fast algorithms for testing fault-tolerance of sequenced jobs with deadlines
Original language description
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.
Czech name
Rychlé algoritmy pro testování tolerance chyb rozhodování úloh s termíny
Czech description
Článek navrhuje a analyzuje rychlé algoritmy pro testování tolerance chyb rozvrhování úloh s termíny.
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 28th IEEE Real-Time Systems Symposium (RTSS), 2007
ISBN
978-0-7695-3062-8
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
—
Publisher name
IEEEE
Place of publication
Location
Event location
Location
Event date
Dec 3, 2007
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000253708400013