An Efficient Fault-Tolerant Multi-Bus Data Scheduling Algorithm Based on Replication and Deallocation

The paper proposes a new reliable fault-tolerant scheduling algorithm for real-time embedded systems. The proposed scheduling algorithm takes into consideration only one bus fault in multi-bus heterogeneous architectures, caused by hardware faults and compensated by software redundancy solutions. Th...

Full description

Saved in:
Bibliographic Details
Published inCybernetics and information technologies : CIT Vol. 16; no. 2; pp. 69 - 84
Main Authors Arar, Chafik, Khireddine, Mohamed Salah
Format Journal Article
LanguageEnglish
Published Sofia De Gruyter Open 01.06.2016
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Sciendo
Subjects
active and passive redundancy
deallocation
Fault-tolerance
real time systems
replication
scheduling
Online AccessGet full text
ISSN1314-4081
1311-9702
1314-4081
DOI10.1515/cait-2016-0021

Cover

More Information
Summary:The paper proposes a new reliable fault-tolerant scheduling algorithm for real-time embedded systems. The proposed scheduling algorithm takes into consideration only one bus fault in multi-bus heterogeneous architectures, caused by hardware faults and compensated by software redundancy solutions. The proposed algorithm is based on both active and passive backup copies, to minimize the scheduling length of data on buses. In the experiments, this paper evaluates the proposed methods in terms of data scheduling length for a set of DAG benchmarks. The experimental results show the effectiveness of our technique.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1314-4081
1311-9702
1314-4081
DOI:10.1515/cait-2016-0021