Abstract
A real-time task scheduling system model was analyzed under a heterogeneous multiprocessor platform with task duplication. This analysis focused on the designs and performances of linear and dynamic programming algorithms for real-time task scheduling under a heterogeneous platform with task duplication. Moreover, experimental analyses were performed to evaluate the performances of different algorithms under different conditions. The advantages of the two proposed algorithms were compared under the same situations to discover which one achieves a higher task scheduling efficiency for a heterogeneous real-time system.
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.
