arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1605.00124cs.DS
收藏

分段自悬挂系统精确可伸缩性分析的一个注记

A Note on the Exact Schedulability Analysis for Segmented Self-Suspending Systems

Jian-Jia Chen

摘要:

本文研究了一个单处理器平台上的具有$n$偶发任务的偶发实时任务系统,其中最低优先级的任务是分段自暂停任务,其它高优先级的任务是普通偶发实时任务.该报告证明了即使只有一个分段自挂起任务作为最低优先级任务,固定优先级抢占式调度的可执行性分析也是强意义上的$co{\cal NP}$ -困难。在固定优先级抢占式调度下,Nelissen等人在ECRTS 2015中提供了混合整数线性规划(MILP)公式来计算最低优先级自挂起任务的最坏情况响应时间的上限。该报告提供了全面的支持,以解释他们的论文中没有提供的几个隐藏属性。我们还提供了一个输入任务集来解释为什么他们的MILP公式的结果解决方案可以是相当远离确切的最坏情况下的响应时间。

英文摘要:

This report considers a sporadic real-time task system with $n$ sporadic tasks on a uniprocessor platform, in which the lowest-priority task is a segmented self-suspension task and the other higher-priority tasks are ordinary sporadic real-time tasks. This report proves that the schedulability analysis for fixed-priority preemptive scheduling even with only one segmented self-suspending task as the lowest-priority task is $co{\cal NP}$-hard in the strong sense. Under fixed-priority preemptive scheduling, Nelissen et al. in ECRTS 2015 provided a mixed-integer linear programming (MILP) formulation to calculate an upper bound on the worst-case response time of the lowest-priority self-suspending task. This report provides a comprehensive support to explain several hidden properties that were not provided in their paper. We also provide an input task set to explain why the resulting solution of their MILP formulation can be quite far from the exact worst-case response time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑