Energy Efficient Run-Time Incremental Mapping for 3-D Networks-on-Chip

作     者：Xiao-Hang Wang Peng Liu Mei Yang Maurizio Palesi Ying-Tao Jiang Michael C Huang 

作者机构：Intelligent Chips and Systems Research Centre Guangzhou Institute of Advanced Technology Chinese Academy of Sciences Guangzhou 511458 China Department of Information Science and Electronic Engineering Zhejiang University Hangzhou 310027 China Department of Electrical and Computer Engineering University of Nevada Las Vegas Nevada U.S.A. Faculty of Engineering Kore University Catania Italy Department of Electrical and Computer Engineering University of Rochester Rochester New York U.S.A. 

出 版 物：《Journal of Computer Science & Technology》 (计算机科学技术学报（英文版）)

年 卷 期：2013年第28卷第1期

页      面：54-71页

核心收录：

学科分类：08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：This work is supported by the National Natural Science Foundation of China under Grant Nos. 60873112 and 61028004  the National Natural Science Foundation of USA under Grant No. CNS-1126688 

主　　题：energy efficiency Networks-on-Chip multiprocessor System-on-Chips run-time incrementa] mapping 

摘      要：3-D Networks-on-Chip （NoC） emerge as a potent solution to address both the interconnection and design complexity problems facing future Multiprocessor System-on-Chips （MPSoCs）. Effective run-time mapping on such 3-D NoC-based MPSoCs can be quite challenging, as the arrival order and task graphs of the target applications are typically not known a priori, which can be further complicated by stringent energy requirements for NoC systems. This paper thus presents an energy-aware run-time incremental mapping algorithm （ERIM） for 3-D NoC which can minimize the energy consumption due to the data communications among processor cores, while reducing the fragmentation effect on the incoming applications to be mapped, and simultaneously satisfying the thermal constraints imposed on each incoming application. Specifically, incoming applications are mapped to cuboid tile regions for lower energy consumption of communication and the minimal routing. Fragment tiles due to system fragmentation can be gleaned for better resource utilization. Extensive experiments have been conducted to evaluate the performance of the proposed algorithm ERIM, and the results are compared against the optimal mapping algorithm （branch-and-bound） and two heuristic algorithms （TB and TL）. The experiments show that ERIM outperforms TB and TL methods with significant energy saving （more than 10%）, much reduced average response time, and improved system utilization.