Abstract
Fault-tolerance is very important in hard real-time heterogeneous systems, especially in safety-critical systems, since faults can result in a disaster. Such systems require that an application can operate normally even when a processor is subject to failures under a given time constraint. In this paper, we tackle the problem of scheduling tasks on heterogeneous systems with the constraint of time and the ability of fault-tolerance, while considering communication overhead. The problem is NP-hard and we propose a heuristic algorithm DB-FTSA to solve it. The heuristic algorithm is based on an active replication scheme, capable of supporting several transient failures. It incorporates the reliability calculation into the active replication scheme, and can dynamically find out fault-tolerant tasks. Experimental results demonstrate that our proposed algorithm can effectively improve the system reliability under the given time constraint.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
