Soft real-time scheduling on simultaneous multithreaded processors
Soft real-time scheduling on simultaneous multithreaded processors
复制标题
同步多线程处理器上的软实时调度
DOI：
10.1109/real.2002.1181569
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
S. Adve
中科院分区：
文献类型：
--
作者：
R. Jain;C. Hughes;S. Adve
同时多线程（SMT）通过在每个周期处理来自多个线程的指令来提高处理器吞吐量。这是第一个工作，探索软实时调度的SMT处理器。使用SMT进行调度需要两个决策：（1）哪些线程同时运行（协同调度），以及（2）如何在协同调度的线程之间共享处理器资源。我们探索软实时多媒体应用的决策算法，更侧重于合作时间表的选择。我们研究以前的多处理器协同调度算法，包括分区和全局调度。我们提出了新的变化，考虑资源共享，并试图利用SMT更有效地利用应用共生。我们发现（使用模拟），最好的算法使用全局调度，利用共生，优先考虑高利用率的任务，并使用动态资源共享。然而，该算法施加显著的剖析开销，并且不提供准入控制。我们提出的替代方案，以克服这些限制，但在成本的可扩展性。
Simultaneous multithreading (SMT) improves processor throughput by processing instructions from multiple threads each cycle. This is the first work to explore soft real-time scheduling on an SMT processor. Scheduling with SMT requires two decisions: (1) which threads to run simultaneously (the co-schedule), and (2) how to share processor resources among co-scheduled threads. We explore algorithms for both decisions for soft-real time multimedia applications, focusing more on co-schedule selection. We examine previous multiprocessor co-scheduling algorithms, including partitioning and global scheduling. We propose new variations that consider resource sharing and try to utilize SMT more effectively by exploiting application symbiosis. We find (using simulation) that the best algorithm uses global scheduling, exploits symbiosis, prioritizes high utilization tasks, and uses dynamic resource sharing. This algorithm, however, imposes significant profiling overhead and does not provide admission control. We propose alternatives to overcome these limitations, but at the cost of schedulability.