Multiprocessor Feasibility Analysis of Recurrent Task Systems with Specified Processor Affinities
Multiprocessor Feasibility Analysis of Recurrent Task Systems with Specified Processor Affinities
复制标题
具有指定处理器亲和力的循环任务系统的多处理器可行性分析
DOI：
10.1109/rtss.2013.24
复制
发表时间：
2013
期刊：
影响因子：
--
通讯作者：
Björn B. Brandenburg
中科院分区：
文献类型：
--
作者：
Sanjoy Baruah;Björn B. Brandenburg
在许多当前的多处理器实时操作系统中，程序员能够设置关联掩码，将进程固定到系统中指定的处理器子集。给定一个由一组隐式截止日期零星任务组成的实时任务系统，每个任务都指定一个亲和掩码，该亲和掩码将在同一多处理器平台上实现，本文解决了确定该任务系统是否可以在该平台上实现以始终满足所有截止日期，同时尊重亲和掩码限制的问题。导出了一种算法，可以在运行时有效地回答这个问题，该算法是任务系统表示的多项式。
In many current multiprocessor real-time operating systems, programmers have the ability to set affinity masks that pin a process to a specified subset of the processors in the system. Given a real-time task system consisting of a collection of implicit-deadline sporadic tasks with an affinity mask specified for each task that is to be implemented upon an identical multiprocessor platform, this paper addresses the question of determining whether the task system can be implemented upon the platform to always meet all deadlines, while respecting the affinity mask restrictions. An algorithm is derived that answers this question efficiently in run-time that is polynomial in the representation of the task system.
优秀论文奖：具有任意处理器亲和力的 Linux 推拉调度器的可调度性分析
DOI：
10.1109/ecrts.2013.18
发表时间：
2013
期刊：
2013 25th Euromicro Conference on Real-Time Systems
影响因子：
--
作者：
Arpan Gujarati;Felipe Cerqueira;Björn B. Brandenburg
通讯作者：
Björn B. Brandenburg