Fixed-priority scheduling on prioritized SMT processor
Fixed-priority scheduling on prioritized SMT processor
复制标题
DOI：
--
复制
发表时间：
2007-11
期刊：
影响因子：
--
通讯作者：
S. Kato;N. Yamasaki
中科院分区：
文献类型：
--
作者：
S. Kato;N. Yamasaki
优先级SMT是一种在硬件中为每个线程设置优先级的技术，并且处理器资源优先分配给具有高优先级的线程。本文描述了优先级SMT处理器上的实时任务调度。我们提出了两个算法，直接优先级映射（DM）和较短的周期上（SPU），确定线程的优先级。然后，著名的速率单调（RM）算法相结合的优先级SMT处理器上的实时任务调度算法。我们还考虑了每个算法的可行性分析。仿真研究评估的最后期限错过率与理想情况下的模拟和寄存器传输级（RTL）的模拟所提出的算法。
Prioritized SMT is a technique that placess a priority to each thread in hardware and the processor resources are preferentially allocated to threads with a high priority. This paper describes real-time task scheduling on Prioritized SMT processors. We propose two algorithms, Direct Priority Mapping (DM) and Shorter Period Upper (SPU), that determine the priorities of the threads. Then the well-known Rate Monotonic (RM) algorithm is combined with the proposed algorithms for scheduling real-time tasks on Prioritized SMT processors. Also we consider a schedula-bility analysis for each algorithm. The simulation study evaluates the deadline miss ratio of the proposed algorithms with ideal-case simulations and register transfer level (RTL) simulations.