DocumentCode :
3380374
Title :
A method of quadratic programming for mapping on NoC architecture
Author :
Sheng, Jiayi ; Zhong, Liulin ; Jing, Ming´e ; Yu, Zhiyi ; Zeng, Xiaoyang
Author_Institution :
State Key Lab. of ASIC & Syst., Fudan Univ., Shanghai, China
fYear :
2011
fDate :
25-28 Oct. 2011
Firstpage :
200
Lastpage :
203
Abstract :
Network-on-Chip (NoC) architecture is drawing intensive attention since it promises to maintain high performance in handling complex communication issues as the number of on-chip components increases. An effective method of mapping multitask applications on multicores is necessary to effectively use the NoC potential. In this paper, we propose an approach of quadratic programming (QP) formulation at the first time for the mapping problem, and it can overcome the unacceptable complexity of Integer Linear Programming (ILP) in dealing with problems with large size due to the decrease in the number of variables. Experimental results show that, QP method is at least 10 times faster than ILP method for 20 given benchmarks.
Keywords :
integer programming; linear programming; network-on-chip; quadratic programming; tree searching; NoC architecture; integer linear programming; network-on-chip architecture; quadratic programming; Irrigation; Runtime; Branch and Bound Algorithm; Integer Linear Programming Method; Mapping Algorithm; NoC; Quadratic Programming Method;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
ASIC (ASICON), 2011 IEEE 9th International Conference on
Conference_Location :
Xiamen
ISSN :
2162-7541
Print_ISBN :
978-1-61284-192-2
Electronic_ISBN :
2162-7541
Type :
conf
DOI :
10.1109/ASICON.2011.6157156
Filename :
6157156
Link To Document :
بازگشت