Partitioned Scheduling for Dependency Graphs in Multiprocessor Real-Time Systems
2019 IEEE 25th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)(2019)
摘要
Effectively handling precedence constraints and resource synchronization is a challenging problem in the era of multiprocessor systems even with massively parallel computation power. One common approach is to apply list scheduling to a given task graph with precedence constraints. However, in some application scenarios, such as the OpenMP task model and multiprocessor partitioned scheduling for resource synchronization using binary semaphores, several operations can be forced to be tied to the same processor, which invalidates the list scheduling. This paper studies a special case of this challenging scheduling problem, where a task comprised of (at most) three subtasks is executed sequentially on the same processor and the second subtasks of the tasks may have sequential dependencies, e.g., due to synchronization. We demonstrate the limits of existing algorithms and provide effective heuristics considering preemptive execution. The evaluation results show a significant improvement, compared to the existing multiprocessor partitioned scheduling strategies.
更多查看译文
关键词
dependency graphs,multiprocessor real-time systems,precedence constraints,resource synchronization,multiprocessor systems,massively parallel computation power,list scheduling,task graph,binary semaphores,scheduling problem,subtasks,effective heuristics,preemptive execution,multiprocessor partitioned scheduling strategies
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络