Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors
Semi-partitioned Scheduling of Sporadic Task Systems on Multiprocessors
复制标题
DOI：
10.1109/ecrts.2009.22
复制
发表时间：
2009-07
期刊：
影响因子：
--
通讯作者：
S. Kato;N. Yamasaki;Y. Ishikawa
中科院分区：
文献类型：
--
作者：
S. Kato;N. Yamasaki;Y. Ishikawa
本文提出了一种在同构多处理器平台上对具有任意截止期限的偶发任务系统进行调度的新算法。该算法基于半分区调度的概念，即大多数任务固定在特定的处理器上，而少数任务在处理器之间迁移。特别地，我们对算法进行设计，使得只有当一个任务集无法再进行分区时，任务才有资格迁移，并且此类迁移任务在每个周期内仅从一个处理器迁移到另一个处理器一次。然后，调度策略遵循最早截止期限优先原则。仿真结果表明，与现有技术相比，该算法具有相当的调度性能，且上下文切换次数更少。
This paper presents a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across processors. Particularly, we design the algorithm so that tasks are qualified to migrate only if a task set cannot be partitioned any more, and such migratory tasks migrate from one processor to another processor only once in each period. The scheduling policy is then subject to Earliest Deadline First. Simulation results show that the algorithm delivers competitive scheduling performance to the state-of-the-art, with a smaller number of context switches.