.png){kind=icon}
返回
Dynamic thermal management by greedy scheduling algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s11771-012-0991-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Chip multiprocessors (CMPs) allow thread level parallelism, thus increasing performance. However, this comes with the cost of temperature problem. CMPs require more power, creating non uniform power map and hotspots. Aiming at this problem, a thread scheduling algorithm, the greedy scheduling algorithm, was proposed to reduce the thermal emergencies and to improve the throughput. The greedy scheduling algorithm was implemented in the Linux kernel on Intel's Quad-Core system. The experimental results show that the greedy scheduling algorithm can reduce 9.6%-78.5% of the hardware dynamic thermal management (DTM) in various combinations of workloads, and has an average of 5.2% and up to 9.7% throughput higher than the Linux standard scheduler.
Keyword:
greedy scheduling algorithm
chip multiprocessor
thermal-aware
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
5.2K
被引数:
1.0W
机构
引用论文
.png){kind=icon}
分享收藏Intramolecular binding site organization by Pd(II) complexation with a resorcin[4]arene derivative
PREAI
分享收藏Possible Bio-Medical Applications of Antiprotons I. In-Vivo Direct Density Measurements: Radiography
PREAI
分享收藏
查看更多内容