Abstract

This paper studies a fault-tolerant real-time scheduling algorithm for hybrid task sets, which contain periodic tasks and aperiodic tasks. A previously proposed fault-tolerant periodic scheduling was extended to hybrid scheduling based on time redundancy and space redundancy. Periodic tasks are assigned to processors using fast and simple heuristic scheme and joint scheduling is used for periodic and aperiodic tasks. A simulation study shows the effectiveness of the proposed approach.

Full Text
Published version (Free)

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 call