Fault-tolerant scheduling of real-time tasks on heterogeneous systems

Wei, Mengxue; Liu, Jing; Li, Tao; Xu, Xin; Hu, Wei; Zhao, Debin

doi:10.1109/iciea.2017.8282986

Cited by 8 publications

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To evaluate the effectiveness of the proposed algorithm, several series of experiments have been conducted on a computer with the 64-bit Windows 10 operating system, a dual processor Intel(R) Core (TM) CPU @ 2.2GHz and an 8GB RAM. Two algorithms DB-FTSA [20] and FTSA [32] are selected as comparison baselines. FTSA is an excellent fault tolerance algorithm for solving reliability problems with no timing constraint.…”

Section: Methodsmentioning

confidence: 99%

See 1 more Smart Citation

A Novel and Adaptive Transient Fault-Tolerant Algorithm Considering Timing Constraint on Heterogeneous Systems

2020

Self Cite

View full text Add to dashboard Cite

Due to high performance and low power consumption, heterogeneous processors are widely used in many real-time systems. In these systems, if tasks are not completed before deadline, it will cause disastrous consequences, and thus it is important to provide fault-tolerance. This paper proposes a novel, adaptive and transient fault-tolerant scheduling algorithm to solve the fault-tolerant problem in heterogeneous real-time systems, aiming to improve system reliability within a given deadline. Since task replication is efficient in improving system reliability, the proposed algorithm supports multiple replicas for each primary task and allows the primary tasks and their replicas to be scheduled on the same processor to increase reliability and lower latency. Also, the algorithm can dynamically adjust the number of replicas for each task to accommodate the deadline and ensure higher reliability. Simulated results show that the proposed algorithm can achieve higher reliability in comparison with existing and related fault-tolerant algorithms. To be specific, the proposed algorithm can obtain the reliability of 89.37% whereas the two existing algorithms DB-FTSA and FTSA obtain the reliability of 47.05% and 84.75% for the benchmark of sixty tasks, respectively, to be detailed in Fig. 4 in experiment.

show abstract

Section: Methodsmentioning

confidence: 99%

“…However, DFTS is only used for independent tasks and identical processing cores. Wei et al [20] propose a faulttolerant algorithm to deal with the transient failures which allows at most one backup task and cannot make full use of deadline.…”

Section: B Related Workmentioning

confidence: 99%