Paper Info
Title
An Effective Optimization Algorithm for Application Mapping in Network-on-Chip Designs
Abstract
The application mapping problem is an NP-hard combinatorial optimization problem in network-on-chip (NoC) design. Applications of size ( <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$n$</tex-math></inline-formula> <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$ &gt;$</tex-math></inline-formula> 30) cannot be solved optimally by an exact algorithm in reasonable time, and the evolutionary algorithms have drawn the attention of NoC researchers. In this paper, we propose a new effective optimization method based on the discrete particle swarm optimization framework, which includes the novel principles for representation, velocity computing, and position-updating of the particles. In our proposed method, particles are allowed to swing between elite and regular pools, and a simple local search procedure is applied on elite particles to exploit the promising solutions. Extensive computational studies using standard benchmark instances and task graphs for free (TGFF) random instances reveal that the proposed optimization algorithm is able to attain the best results, and thus competes very favorably with the previously proposed heuristic approaches. A stability analysis and the two-sided Wilcoxon rank sum tests are also presented to shed light on the robust behavior of the algorithm.
Year
DOI
Venue
2020
10.1109/TIE.2019.2926043
IEEE Transactions on Industrial Electronics
Keywords
DocType
Volume
Jacobian matrices,MIMO communication,Antennas,Convex functions,Iterative methods,Uplink,Closed-form solutions
Journal
67
Issue
ISSN
Citations 
7
0278-0046
1
PageRank 
References 
Authors
0.36
0
5
Name
Order
Citations
PageRank
Xinyu Wang126021.36
Tsan-Ming Choi2104075.03
Xiaohang Yue39812.03
Mengji Zhang410.36
Wanyu Du510.36