Abstract
With advancement in the nanometer era, more and more intellectual property (IP) blocks can be integrated on a single die. Network-on-chip (NoC) has emerged as a viable alternative to unplug the communication bottleneck in system-on-chip. In the NoC synthesis flow, IP block mapping problem is one of the holistic research problems, which aims to minimize the overall communication cost or power consumption of the network. Since mesh is a well-accepted topology, we focus on IP mapping problem onto mesh-based NoCs in this paper. The IP mapping problem is proven to be NP-hard. No exact algorithm is expected to solve it in the polynomial time, and considerable computation time is required for even small-scale instances. In this paper, we analyze the symmetry character in mesh and propose an adaptive memetic algorithm (AMA) to solve the application mapping problem. The novel AMA method integrates both global and local optimization techniques, which contributes to the effectiveness and efficiency of the algorithm. Experiments have been carried out under both real application and synthetic benchmarks. Experimental results indicate that the proposed AMA outperforms the existing heuristics (CastNet and genetic algorithm) in the aspects of solution quality and power consumption. Within acceptable time limit, AMA could obtain optimal or suboptimal solutions when compared with the exact algorithm.
Similar content being viewed by others
References
Flich J, Bertozzi D (2010) Designing network-on-chip architectures in the nanoscale era. Chapman and Hall/CRC, London
Furhad M, Kim J (2014) A shortly connected mesh topology for high performance and energy efficient network-on-chip architectures. J Supercomput 69(2):766–792
Killian C, Tanougast C, Monteiro F, Monteiro A (2014) Smart reliable network-on-chip. IEEE Trans Very Large Scale Integr Syst 22(2):242–255
Marculescu R, Hu J, Ogras U (2005) Key research problems in NoC design: a holistic perspective. In: International conference on hardware/software codesign and system synthesis, pp 69–74
Wang C, Hu W, Lee S, Bagherzadeh N (2011) Area and power-efficient innovative congestion-aware network-on-chip architecture. J Syst Archit 57(1):24–38
Fan J, Lin X, Jia X (2005) Optimal path embedding in crossed cubes. IEEE Trans Parallel Distrib Syst 16(12):1190–1200
Dong Q, Zhou J, Fu Y, Yang X (2012) Embedding a mesh of trees in the crossed cube. Inf Process Lett 14–15:599–603
Rottger M, Schroeder U (2011) Embedding 2-dimensional grids into optimal hypercubes with edge-congestion 1 or 2. Parallel Process Lett 8(2):231–242
Wang X, Xiang D, Yu Z (2013) TM: a new and simple topology for interconnection networks. J Supercomput 66(1):514–538
Zhang Z, Greiner A, Greiner S (2008) A reconfigurable routing algorithm for a fault-tolerant 2D-mesh network-on-chip. In: ACM/IEEE design automation conference, pp 441–446
Pang K, Fresse V, Yao S, De Lima OA (2015) Task mapping and mesh topology exploration for an FPGA-based network on chip. Microprocess Microsyst 39(3):189–199
http://www.intel.com/pressroom/kits/teraflops/. Accessed 1 Nov 2015
Sahu P, Chattopadhyay S (2013) A survey on application mapping strategies for network-on-chip design. J Syst Archit 59(1):60–76
Rhee C, Jeong H, Ha S (2004) Many-to-many core-switch mapping in 2-D mesh noc architectures. In: IEEE international conference on computer design, pp 438–443
Tosun S (2011) Cluster-based application mapping method for network-on-chip. Adv Eng Softw 42(10):868–874
Hu J, Marculescu R (2005) Energy- and performance-aware mapping for regular NoC architectures. IEEE Trans Comput-Aided Des Integr Circuits Syst 24(4):551–562
Erbas C, Cerav-Erbas S, Pimentel A (2006) Multiobjective optimization and evolutionary algorithms for the application mapping problem in multiprocessor system-on-chip design. IEEE Trans Evol Comput 10(3):358–374
Nedjah N, Mourelle L (2012) Preference-based multi-objective evolutionary algorithms for power-aware application mapping on NoC platforms. Expert Syst Appl 39:2771–2782
Tosun S, Ozturk O, Ozkan E, Ozen M (2015) Application mapping algorithms for mesh-based network-on-chip architectures. J Supercomput 71(3):995–1017
Lu Z, Xia L, Jantsch A (2008) Cluster-based smulated annealing for mapping cores onto 2D mesh networks on chip. In: IEEE international workshop on design and diagnostics of electronic circuits and systems, pp 1–6
Fekr A, Khademzadeh A, Janidarmian M, Bokharaei V (2010) Bandwidth/fault tolerance/contention aware application-specific NoC using PSO as a mapping generator. In: Proceedings of the world congress on engineering, pp 247–252
Sahu PK, Shah T, Manna K, Chattopadhyay S (2014) Application mapping onto mesh-based network-on-chip using discrete particle swarm optimization. IEEE Trans Very Large Scale Integr Syst 22(2):300–312
Farias M, Barros E, Filho A, Araujo A, Silva A, Melo J (2013) An ant colony metaheuristic for energy aware application mapping on NoCs. In: IEEE international conference on electronics, circuits, and systems, pp 365–368
Wu N, Mu Y, Ge F (2012) GA-MMAS: an energy- and latency-aware mapping algorithm for 2D network-on-chip. IAENG Int J Comput Sci 2194(1):1–6
Weichslgartner A, Wildermann S, Teich J (2011) Dynamic decentralized mapping of tree-structured applications on NoC architectures. In: IEEE/ACM international symposium on networks on chip, pp 201–208
Murali S, Micheli GD (2004) Bandwidth constrained mapping of cores onto NoC architectures. In: Proceedings of design, automation, and test in Europe, pp 896–901
Shen W, Chao C, Lien Y, Wu A (2007) A new binomial mapping and optimization algorithm for reduced-complexity mesh-based on-chip network. In: International symposium on networks-on-chips, pp 317–322
Soumya J, Tiwary S, Chattopadhyay S (2015) Area-performance trade-off in floorplan generation of application-specific network-on-chip with soft cores. J Syst Archit 61:1–11
Vakil-Baghmisheh M, Ahandani M (2014) A differential memetic algorithm. Artif Intell Rev 41(1):129–146
Xu J, Yin Y, Cheng TCE, Wu CC, Gu S (2014) An improved memetic algorithm based on a dynamic neighbourhood for the permutation flowshop scheduling problem. Int J Prod Res 52(4):1188–1199
Liu T, Jiang Z, Geng N (2013) A memetic algorithm with iterated local search for the capacitated arc routing problem. Int J Prod Res 51(10):3075–3084
Benlic U, Hao JK (2015) Memetic search for the quadratic assignment problem. Expert Syst Appl 42(1):584–595
Beyki M, Yaghoobi M (2015) Chaotic logic gate: a new approach in set and design by genetic algorithm. Chaos Solitons Fractals 77:247–252
Koduru P, Dong Z, Das S, Welch SM, Roe JL, Charbit E (2008) A multiobjective evolutionary-simplex hybrid approach for the optimization of differential equation models of gene networks. IEEE Trans Evol Comput 12(5):572–590
Benlic U, Hao J (2013) Breakout local search for the quadratic assignment problem. Appl Math Comput 219(9):4800–4815
http://ziyang.eecs.umich.edu/~dickrp/tgff/. Accessed 1 Nov 2015
Tosun S, Ozturk O, Ozen M (2009) An ILP formulation for application mapping onto network-on-chips. In: International conference on application of information and communication technologies, pp 1–5
Koziris N, Romesis M, Tsanakas P, Papakonstantinou G (2000) An efficient algorithm for the physical mapping of clustered task graphs onto multiprocessor architectures. In: Euromicro workshop on parallel and distributed processing, pp 406–413
Tavanpour M, Khademzadeh A, Janidarmian M (2009) chain-mapping for mesh based network-on-chip architecture. IEICE Electron Express 6(22):1535–1541
Janidarmian M, Khademzadeh A, Tavanpour M (2009) Onyx: a new heuristic bandwidth-constrained mapping of cores onto tile-based network on chip. IEICE Electron Express 6(1):1–7
Srinivasan K, Chatha KS, Konjevod G (2004) Linear programming based techniques for synthesis of network-on-chip architectures. IEEE Trans Very Large Scale Integr Syst 14(4):407–420
Acknowledgments
This work is supported by the National Nature Science Foundation of China (Nos. 61402086, 71472029), Scientific Research Foundation of Liaoning Provincial Education Department (Nos. L2015165, L14DGL045) and DUFE Excellent Talents Project (No. DUFE2015R06). Here, we also would like to specially thank Professor Suleyman Tosun for his constructive suggestions on the experiments.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wang, X., Liu, H. & Yu, Z. A novel heuristic algorithm for IP block mapping onto mesh-based networks-on-chip. J Supercomput 72, 2035–2058 (2016). https://doi.org/10.1007/s11227-016-1719-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-016-1719-6