Abstract
Multiprocessors have become prevalent in real-time systems owing to their higher throughput. Various types of scheduling algorithms have been proposed for parallel real-time tasks, which differ from traditional tasks in that their subtasks execute in parallel. A parallel task is frequently modelled as a directed acyclic graph (DAG) that expresses the precedence constraints between its subtasks. In this Letter, the authors propose a decomposition algorithm to improve the Earliest Deadline First schedulability for DAG tasks, based on convex optimisation theory. Their experimental results demonstrate that their algorithm outperforms the two most recently published algorithms.
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.
