Algorithms for testing fault-tolerance of sequenced jobs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F09%3A00207317" target="_blank" >RIV/00216208:11320/09:00207317 - isvavai.cz</a>

Alternative codes found

RIV/67985840:_____/09:00338975

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Algorithms for testing fault-tolerance of sequenced jobs

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

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

Result was created during the realization of more than one project. More information in the Projects tab.

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2009

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Journal of Scheduling

ISSN

1094-6136

e-ISSN

—

Volume of the periodical

12

Issue of the periodical within the volume

5

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

15

Pages from-to

—

UT code for WoS article

000270340900007

EID of the result in the Scopus database

—