Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Error models and fault-secure scheduling in multiprocessor systems
Autore:
Hashimoto, K; Tsuchiya, T; Kikuno, T;
Indirizzi:
Hitachi Ltd, Hitachi Lab, Hitachi, Ibaraki 3191292, Japan Hitachi Ltd Hitachi Ibaraki Japan 3191292 Hitachi, Ibaraki 3191292, Japan Osaka Univ, Grad Sch Engn Sci, Dept Informat & Math Sci, Toyonaka, Osaka 5608531, Japan Osaka Univ Toyonaka Osaka Japan 5608531 i, Toyonaka, Osaka 5608531, Japan
Titolo Testata:
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS
fascicolo: 5, volume: E84D, anno: 2001,
pagine: 635 - 650
SICI:
0916-8532(200105)E84D:5<635:EMAFSI>2.0.ZU;2-C
Fonte:
ISI
Lingua:
ENG
Soggetto:
TASK-ALLOCATION; MAXIMIZING RELIABILITY; MULTICOMPUTER SYSTEMS; COMPUTING SYSTEMS; SPARE CAPACITY; PROCESSORS; TOLERANCE; ALGORITHM;
Keywords:
multiprocessors; fault-secure scheduling; task graphs; error models; tests;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
29
Recensione:
Indirizzi per estratti:
Indirizzo: Hashimoto, K Hitachi Ltd, Hitachi Lab, Hitachi, Ibaraki 3191292, Japan Hitachi Ltd Hitachi Ibaraki Japan 3191292 aki 3191292, Japan
Citazione:
K. Hashimoto et al., "Error models and fault-secure scheduling in multiprocessor systems", IEICE T INF, E84D(5), 2001, pp. 635-650

Abstract

A schedule for a parallel program is said to be 1-fault-secure if a systemthat uses the schedule can either produce correct output; for the program or detect the presence of any faults in a single processor. Although several fault-secure scheduling algorithms have been proposed, they can all only be applied to a class of tree-structured task graphs with a uniform computation cost. Besides, they assume a stringent error model, called the redeemable error model, that considers extremely unlikely cases. In this paper, wefirst propose two new plausible error models which restrict the manner of error propagation. Then we present three fault-secure scheduling algorithms, one for each of the three models. Unlike previous algorithms, the proposed algorithms can deal with any task graphs with arbitrary computation and communication costs. Through experiments, we evaluate these algorithms and study the impact of the error models on the lengths of fault-secure schedules.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 29/03/20 alle ore 09:34:06