Scalable Global Power Management Policy Based on Combinatorial Optimization for Multiprocessors

檔案

本條目沒有附加檔案。

至出版者網站查看(DOI) ›

日期

2015-12-01

類型

期刊名稱

ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS

卷期與頁次

第 14 卷

ISSN

1539-9087

語言

英文

摘要

Multiprocessors have become the main architecture trend in modern systems due to the superior performance; nevertheless, the power consumption remains a critical challenge. Global power management (GPM) aims at dynamically finding the power state combination that satisfies the power budget constraint while maximizing the overall performance (or vice versa). Due to the increasing number of cores in a multiprocessor system, the scalability of GPM policies has become critical when searching satisfactory state combinations within acceptable time. This article proposes a highly scalable policy based on combinatorial optimization with theoretical proofs, whereas previous works take exhaustive search or heuristic methods. The proposed policy first applies an optimum algorithm to construct a state combination table in pseudo polynomial time using dynamic programming. Then, the state combination is assigned to cores with minimum transition cost in linear time by mapping to the network flow problem. Simulation results show that the proposed policy achieves better system performance for any given power budget when compared to the state-of-the-art heuristic. Furthermore, the proposed policy demonstrates its prominent scalability with 125 times faster policy runtime for 512 cores.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Pan, G.-Y., Yang, J., Jou, J.-Y., & Lai, B.-C. C. (2015). Scalable Global Power Management Policy Based on Combinatorial Optimization for Multiprocessors. ACM TRANSACTIONS ON EMBEDDED COMPUTING SYSTEMS, 14. https://doi.org/10.1145/2811404

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/129551