Abstract
In this paper, we study the problem of partitioned scheduling of periodic real-time tasks with the capability of tolerating transient faults on multi-core platforms under Rate Monotonic Scheduling (RMS) policy. In our approach, we exploit the implicit relations among periods and recovery costs among tasks and develop a novel metric, called compatibility index, to quantify how compatible a task set is when they are allocated on the same core. We theoretically analyze its properties for improving the system schedulability. Based on this metric, we propose two task partitioning schemes to partition hard real-time tasks with fault-tolerance requirements on multi-core platforms. Simulation results demonstrate that our proposed approaches can significantly enhance the performance of existing techniques.
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.
