DMCA
A bi-criteria scheduling heuristics for distributed embedded systems under reliability and real-time constraints (2004)
| Venue: | In Int. Conf. on Dependable Systems and Networks, DSN’04 |
| Citations: | 40 - 6 self |
BibTeX
@INPROCEEDINGS{Assayad04abi-criteria,
author = {Ismail Assayad and Alain Girault and Hamoudi Kalla},
title = {A bi-criteria scheduling heuristics for distributed embedded systems under reliability and real-time constraints},
booktitle = {In Int. Conf. on Dependable Systems and Networks, DSN’04},
year = {2004},
pages = {347--356},
publisher = {IEEE}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Multi-criteria scheduling problems, involving optimiza-tion of more than one criterion, are subject to a growing interest. In this paper, we present a new bi-criteria schedul-ing heuristic for scheduling data-flow graphs of operations onto parallel heterogeneous architectures according to two criteria: first the minimization of the schedule length, and second the maximization of the system reliability. Reliabil-ity is defined as the probability that none of the system com-ponents will fail while processing. The proposed algorithm is a list scheduling heuristics, based on a bi-criteria com-promise function that introduces priority between the op-erations to be scheduled, and that chooses on what subset of processors they should be scheduled. It uses the active replication of operations to improve the reliability. If the system reliability or the schedule length requirements are not met, then a parameter of the compromise function can be changed and the algorithm re-executed. This process is iterated until both requirements are met.
Keyphrases
bi-criteria scheduling heuristic real-time constraint embedded system system reliability schedule length schedule length requirement bi-criteria com-promise function new bi-criteria schedul-ing heuristic data-flow graph multi-criteria scheduling problem heterogeneous architecture compromise function system com-ponents active replication
