Abstract
Abstract Parallel real-time scheduling on multi-core platforms is widely studied and focused in academic and industrial fields. DAG (directed acyclic graph) is a widely-used parallel model. But existing scheduling algorithms for DAG suffer schedulability analysis of significant inaccuracy and resource waste. In this paper, we propose a hierarchical scheduling framework for DAG tasks with constrained deadlines that it provides a much more efficient resource sharing solution without distinguishing the types of tasks. We have evaluated and implemented our proposed hierarchical scheduling and the results show that our proposed method has promising performance.
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.
