论文部分内容阅读
多核处理器凭借着高性能上的优势逐步取代单核处理器.传统实时任务使用串行任务模型,不能充分发挥多核处理的优势,而基于有向无环图的并行实时任务周期内释放多个作业,这些作业同时运行.并行实时任务集的可调度性是研究的重点,针对该模型分析并证明了在某些条件下全局最早截止期优先算法和单调时限算法的可调度性判定,根据分析的结果提出了实时任务集可调度的判定流程,最后采用资源增值分析了两种判定条件的性能.
Multi-core processors gradually replace single-core processors because of their high performance.Traditional real-time tasks using serial task model can not give full play to the advantages of multi-core processing, while the release of multiple parallel real-time task cycles based on directed acyclic graph And the jobs are running at the same time.The schedulability of the parallel real-time task set is the research focus, the schedulability judgment of the global first cutoff priority algorithm and the monotone time limit algorithm under certain conditions is analyzed and proved. According to the analysis The result shows that the decision process of real-time task set scheduling can be analyzed. Finally, the performance of two kinds of decision conditions is analyzed by using the value-added of resources.