Abstract
Scheduling of real-time tasks in embedded real-time systems with quantitative reliability requirements, such as failure rate, is one of the important issues in system design. In this paper, we present a real-time scheduling heuristic that minimise makespan and satisfy reliability requirements for systems that are subject to processor and communication faults. The heuristic is based on a cost function to minimise makespan and on task redundancy to meet reliability requirements. Our approach is dedicated to heterogeneous architectures with multiple processors linked by several shared buses. It is based on active redundancy and data fragmentation strategies, which allow fast error detection and error handling. Thanks to the above-mentioned strategies, we are able to show with simulation results that our approach can generally reduce the run-time overhead.
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 callMore From: International Journal of Industrial and Systems Engineering
Disclaimer: 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.
