Welcome to the InfoSci Platform
Reference Hub4
A Fault-Tolerant Scheduling Algorithm Based on Checkpointing and Redundancy for Distributed Real-Time Systems

A Fault-Tolerant Scheduling Algorithm Based on Checkpointing and Redundancy for Distributed Real-Time Systems

Barkahoum Kada, Hamoudi Kalla
Copyright: © 2019 |Volume: 10 |Issue: 3 |Pages: 18
ISSN: 1947-3532|EISSN: 1947-3540|EISBN13: 9781522566861|DOI: 10.4018/IJDST.2019070104
Cite Article Cite Article

MLA

Kada, Barkahoum, and Hamoudi Kalla. "A Fault-Tolerant Scheduling Algorithm Based on Checkpointing and Redundancy for Distributed Real-Time Systems." IJDST vol.10, no.3 2019: pp.58-75. http://doi.org/10.4018/IJDST.2019070104

APA

Kada, B. & Kalla, H. (2019). A Fault-Tolerant Scheduling Algorithm Based on Checkpointing and Redundancy for Distributed Real-Time Systems. International Journal of Distributed Systems and Technologies (IJDST), 10(3), 58-75. http://doi.org/10.4018/IJDST.2019070104

Chicago

Kada, Barkahoum, and Hamoudi Kalla. "A Fault-Tolerant Scheduling Algorithm Based on Checkpointing and Redundancy for Distributed Real-Time Systems," International Journal of Distributed Systems and Technologies (IJDST) 10, no.3: 58-75. http://doi.org/10.4018/IJDST.2019070104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Real-time systems are becoming ever more widely used in life-critical applications, and the need for fault-tolerant scheduling can only grow in the years ahead. This article presents a novel fault tolerance approach for tolerating transient faults in hard real-time systems. The proposed approach combines both checkpointing with rollback and active replication to tolerate several transient faults. Based on this approach, a new static fault-tolerant scheduling algorithm SFTS is presented. It is based on a list of scheduling heuristics which satisfy the application time constraints even in the presence of faults by exploring the spare capacity of available processors in the architecture. Simulation results show the performance and effectiveness of the proposed approach compared to other fault-tolerant approaches. The results reveal that in the presence of multiple transient faults, the average timing overhead of this approach is lower than checkpointing technique. Moreover, the proposed algorithm SFTS achieves better feasibility rate in the presence of multiple transient faults.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.