Fine-grained runtime power budgeting for networks-on-chip
文献类型：会议论文
| 作者 | Wang, Xiaohang; Wang, Tengfei; Mak, Terrence; Yang, Mei; Jiang, Yingtao; Daneshtalab, Masoud |
| 出版日期 | 2014 |
| 会议名称 | 2015 20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015 |
| 会议地点 | Chiba,Japan |
| 英文摘要 | Power budgeting for NoC needs to be performed to meet limited power budget while assuring the best possible overall system performance. For simplicity and ease of implementation, existing NoC power budgeting schemes, irrespective of the fact that the packet arrival rates of different NoC routers may vary significantly, treat all the individual routers indiscriminately when allocating power to them. However, such homogeneous power allocation may provide excess power to routers with low packet arrival rates whereas insufficient power to those with high arrival rates. In this paper, we formulate the NoC power budgeting problem as to optimize the network performance over a power budget through per-router frequency scaling, taking into account of heterogeneous packet arrival rates across different routers as imposed by run time traffic dynamics. Correspondingly, we propose a fine-grained solution using an agile dynamic programming network with a linear time complexity. In essence, frequency of a router is set individually according to its contribution to the average network latency while meeting the power budget. Experimental results have confirmed that with fairly low runtime and hardware overhead, the proposed scheme can help save up to 50% application execution time when compared with the best existing methods. |
| 收录类别 | EI |
| 语种 | 英语 |
| 源URL | [http://ir.siat.ac.cn:8080/handle/172644/6293]  |
| 专题 | 深圳先进技术研究院_南沙所 |
| 作者单位 | 2014 |
| 推荐引用方式 GB/T 7714 | Wang, Xiaohang,Wang, Tengfei,Mak, Terrence,et al. Fine-grained runtime power budgeting for networks-on-chip[C]. 见:2015 20th Asia and South Pacific Design Automation Conference, ASP-DAC 2015. Chiba,Japan. |
入库方式： OAI收割
来源：深圳先进技术研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。