Skip to main content

Advertisement

Log in

Using evolutionary metaheuristics to solve the mapping and routing problem in networks on chip

  • Published:
Design Automation for Embedded Systems Aims and scope Submit manuscript

Abstract

Task mapping and routing are crucial steps in the Networks on Chip (NoC) based Multiprocessor System on Chip (MPSoC) design. While the mapping must ensure an optimized arrangement of the applications’ tasks on the system cores, the routing must ensure the tasks’ communication with the minimum possible delay. We observe that these two problems are highly dependent since finding a routing solution requires first finding a mapping solution. Based on that, this paper analyzes the mapping and routing problems in NoC-based MPSoC and defines a joint version as the Mapping and Routing Problem (MRP). We propose a mathematical model that generates mapping and routing solutions based on a specific bandwidth of NoC links. We also propose three evolutionary metaheuristic algorithms to find optimized solutions to the MRP: Genetic (GA), Memetic (MA), and Transgenetic Algorithms (TA). Experimental results evaluating communication latency demonstrate that the proposed algorithms suit well for the tackled problem, but the TA stands out among all the compared solutions. Overall, TA achieved up to 8% and 19% better performance than the compared algorithms in Global Average Delay and Maximum Delay. Also, it outperformed the other strategies in 55.76% and 51.58% of all the performed simulations in both respective metrics.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

References

  1. Beck ACS, Lisbôa CAL, Carro L (2012) Adaptable embedded systems. Springer Science & Business Media, New York

    Google Scholar 

  2. Wolf W, Jerraya AA, Martin G (2008) Multiprocessor system-on-chip (mpsoc) technology. IEEE Trans Comput Aided Des Integr Circuits Syst 27(10):1701–1713

    Article  Google Scholar 

  3. Jerger NE, Krishna T, Peh LS (2017) On-chip networks. Synth Lect Comput Archit 12(3):1–210

    Google Scholar 

  4. Benini L, De Micheli G (2002) Networks on chips: a new soc paradigm. Comput IEEE Comput Soc 35(EPFL–ARTICLE–165542):70–78

    Article  Google Scholar 

  5. Agarwal A, Iskander C, Shankar R (2009) Survey of network on chip (noc) architectures & contributions. J Eng Comput Archit 3(1):21–27

    Google Scholar 

  6. 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

    Article  Google Scholar 

  7. Garey MR, Johnson DS (2002) Computers and intractability, vol 29. W. H. Freeman, New York

    Google Scholar 

  8. Wang X, Liu H, Yu Z, Shen K (2016) A novel two-phase heuristic for application mapping onto mesh-based network-on-chip. IEICE Electron Express

  9. Zhang W, Hou L, Wang J, Geng S, Wu W (2009) Comparison research between xy and odd-even routing algorithm of a 2-dimension 3x3 mesh topology network-on-chip. In: Global congress on intelligent systems, IEEE, pp 329–333

  10. Catania V, Mineo A, Monteleone S, Palesi M, Patti D (2015) Noxim: An open, extensible and cycle-accurate network on chip simulator. In: Application-specific systems, architectures and processors (ASAP), 2015 IEEE 26th international conference on, IEEE, pp 162–163

  11. Sahu PK, Chattopadhyay S (2013) A survey on application mapping strategies for network-on-chip design. J Syst Archit 59(1):60–76

    Article  Google Scholar 

  12. Singh AK, Shafique M, Kumar A, Henkel J (2013) Mapping on multi/many-core systems: survey of current and emerging trends. In: 2013 50th ACM/EDAC/IEEE design automation conference (DAC), IEEE, pp 1–10

  13. Tornero R, Sterrantino V, Palesi M, Orduna JM (2009) A multi-objective strategy for concurrent mapping and routing in networks on chip. In: Parallel & distributed processing, 2009. IPDPS 2009. IEEE international symposium on, IEEE, pp 1–8

  14. Derin O, Kabakci D, Fiorin L (2011) Online task remapping strategies for fault-tolerant network-on-chip multiprocessors. In: Proceedings of the Fifth ACM/IEEE international symposium on networks-on-chip, ACM, pp 129–136

  15. Carpov S (2015) Task mapping and communication routing model for minimizing power consumption in multi-cores. In: Proceedings of the 8th international workshop on network on chip architectures, ACM, pp 27–32

  16. Wang X, Liu H, Yu Z (2016) A novel heuristic algorithm for IP block mapping onto mesh-based networks-on-chip. J Supercomput 72(5):2035–2058

    Article  Google Scholar 

  17. Wang X, Liu H, Yu Z, Shen K (2016) A novel two-phase heuristic for application mapping onto mesh-based network-on-chip. IEICE Electron Express 13(3):20151097–20151097

    Article  Google Scholar 

  18. Cheng CH, Chen WM (2016) Application mapping onto mesh-based network-on-chip using constructive heuristic algorithms. J Supercomput 72(11):4365–4378

    Article  Google Scholar 

  19. Liu T, Yin S, Liu J, Teng L (2017) Hybrid quantum genetic algorithm used for low-power mapping in network-on-chip. J Softw Eng 11(2):194–201

    Article  Google Scholar 

  20. Wang X, Sun Y, Gu H, Liu Z (2018) Woaga: a new metaheuristic mapping algorithm for large-scale mesh-based noc. IEICE Electron Express 15(17):20180738–20180738

    Article  Google Scholar 

  21. Maqsood Tahir, Tziritas Nikos, Loukopoulos Thanasis, Madani Sajjad A, Khan Samee U, Xu Cheng-Zhong, Zomaya Albert Y (2018) Energy and communication aware task mapping for MPSoCs. J Parallel and Distrib Comput 121:71–89

    Article  Google Scholar 

  22. Benlic U, Hao JK (2013) Breakout local search for the quadratic assignment problem. Appl Math Comput 219(9):4800–4815

    MathSciNet  MATH  Google Scholar 

  23. Meindl B, Templ M (2012) Analysis of commercial and free and open source solvers for linear optimization problems. Eurostat and Statistics Netherlands within the project ESSnet on common tools and harmonised methodology for SDC in the ESS 20

  24. Holland J (1975) Adaptation in natural and artificial systems. 2a ediçao

  25. Reeves CR (2010) Genetic algorithms. In: Handbook of metaheuristics, Springer, pp 109–139

  26. Dao SD, Abhary K, Marian R (2017) A bibliometric analysis of genetic algorithms throughout the history. Comput Ind Eng 110:395–403

    Article  Google Scholar 

  27. Palesi M, Tornero R, Orduna JM, Catania V, Panno D (2012) Designing robust routing algorithms and mapping cores in networks-on-chip: a multi-objective evolutionary-based approach. J UCS 18(7):937–969

    Google Scholar 

  28. Çelik C, Bazlamaçcı CF (2013) Energy and buffer aware application mapping for networks-on-chip with self similar traffic. J Syst Archit 59(10):1364–1374

    Article  Google Scholar 

  29. Strum M, Chau WJ et al (2015) Using genetic algorithms for hardware core placement and mapping in noc-based reconfigurable systems. Int J Reconfigurable Comput 2015:1

    Article  Google Scholar 

  30. Las Heras U, Alvarez-Rodriguez U, Solano E, Sanz M (2016) Genetic algorithms for digital quantum simulations. Phys Rev Lett 116(23):230504

    Article  Google Scholar 

  31. Oztekin A, Al-Ebbini L, Sevkli Z, Delen D (2018) A decision analytic approach to predicting quality of life for lung transplant recipients: a hybrid genetic algorithms-based methodology. Eur J Oper Res 266(2):639–651

    Article  MathSciNet  MATH  Google Scholar 

  32. Lee C (2018) A review of applications of genetic algorithms in operations management. Eng Appl Artif Intell 76:1–12

    Article  Google Scholar 

  33. Rocha HMGDA, Beck ACS, Maia SM, Kreutz ME, Pereira MM (2020) A routing based genetic algorithm for task mapping on MPSoC. In 2020 X Brazilian Symposium on Computing Systems Engineering (SBESC). IEEE, pp. 1–8

  34. Rocha HMGDA, Schwarzrock J, Lorenzon AF, Beck ACS (2021) Boosting graph analytics by tuning threads and data affinity on numa systems. In 2021 29th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). IEEE, pp. 161–168

  35. Whitley D (1994) A genetic algorithm tutorial. Stat Comput 4(2):65–85

    Article  Google Scholar 

  36. Bussieck MR, Vigerske S (2010) Minlp solver software

  37. Moscato P, et al. (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Caltech concurrent computation program, C3P Report 826:1989

  38. Moscato P, Cotta C (2002) Memetic algorithms. In: Handbook of Applied Optimization, vol. 157. p. 168

  39. Moscato P, Cotta C (2010) A modern introduction to memetic algorithms. In: Handbook of metaheuristics, Springer, pp 141–183

  40. Hart WE, Krasnogor N, Smith JE (2005) Memetic evolutionary algorithms. In: Recent advances in memetic algorithms, Springer, pp 3–27

  41. Le MN, Ong YS, Jin Y, Sendhoff B (2009) Lamarckian memetic algorithms: local optimum and connectivity structure analysis. Memetic Comput 1(3):175

    Article  Google Scholar 

  42. Cattaruzza D, Absi N, Feillet D, Vidal T (2014) A memetic algorithm for the multi trip vehicle routing problem. Eur J Oper Res 236(3):833–848

    Article  MathSciNet  MATH  Google Scholar 

  43. Divsalar A, Vansteenwegen P, Sörensen K, Cattrysse D (2014) A memetic algorithm for the orienteering problem with hotel selection. Eur J Oper Res 237(1):29–49

    Article  MATH  Google Scholar 

  44. Lu Y, Benlic U, Wu Q (2018) A memetic algorithm for the orienteering problem with mandatory visits and exclusionary constraints. Eur J Oper Res 268(1):54–69

    Article  MathSciNet  MATH  Google Scholar 

  45. Goldbarg EFG, Goldbarg MC (2009) Transgenetic algorithm: a new endosymbiotic approach for evolutionary algorithms. In: Foundations of computational intelligence, vol 3. Springer, pp 425–460

  46. Gouvêa E, Goldbarg MC (2001) Protog: a computational transgenetic algorithm. In: Proceedings of MIC 2001–4th metaheuristics international conference, pp 625–631

  47. Goldbarg EFG, Goldbarg MC, Costa W (2004) A transgenetic algorithm for the permutation flow-shop sequencing problem. WSEAS Trans Syst 1(3):40–45

    Google Scholar 

  48. Goldbarg EFG, Goldbarg MC, Schmidt CC (2008) A hybrid transgenetic algorithm for the prize collecting Steiner tree problem. J UCS 14(15):2491–2511

    Google Scholar 

  49. Goldbarg MC, Bagi LB, Goldbarg EFG (2009) Transgenetic algorithm for the traveling purchaser problem. Eur J Oper Res 199(1):36–45

    Article  MATH  Google Scholar 

  50. Almeida CP, Gonçalves RA, Delgado MR, Goldbarg EF, Goldbarg MC (2010) (2010) A transgenetic algorithm for the bi-objective traveling purchaser problem. In: Evolutionary Computation (CEC). IEEE Congress on, IEEE, pp 1–8

  51. Goldbarg MC, Goldbarg EF, Asconavieta PH, Menezes MdS, Luna HP (2013) A transgenetic algorithm applied to the traveling car renter problem. Expert Syst Appl 40(16):6298–6310

    Article  Google Scholar 

  52. Maia SMDM, Goldbarg EFG, Goldbarg MC (2014) Evolutionary algorithms for the bi-objective adjacent only quadratic spanning tree. Int J Innov Comput Appl 6(2):63–72

    Article  Google Scholar 

  53. Van Der Tol EB, Jaspers EG (2001) Mapping of mpeg-4 decoding on a flexible architecture platform. In: Media Processors 2002, International Society for Optics and Photonics, vol 4674, pp 1–13

  54. Murali S, De Micheli G (2004) Bandwidth-constrained mapping of cores onto noc architectures. In: Proceedings design, automation and test in Europe conference and exhibition, vol 2. IEEE, pp 896–901

  55. Bertozzi D, Jalabert A, Murali S, Tamhankar R, Stergiou S, Benini L, De Micheli G (2005) Noc synthesis flow for customized domain specific multiprocessor systems-on-chip. IEEE Trans Parallel Distrib Syst 16(2):113–129

    Article  Google Scholar 

  56. Marcon CA, Palma JC, Calazans NL, Moraes FG, Susin AA, Reis R (2007) Modeling the traffic effect for the application cores mapping problem onto nocs. In: Vlsi-Soc: from systems to silicon, Springer, pp 179–194

  57. Jalabert A, Murali S, Benini L, De Micheli G (2008) xpipescompiler: A tool for instantiating application-specific networks on chip. In: Design, automation, and test in Europe, Springer, pp 157–171

  58. Chawade SD, Gaikwad MA, Patrikar RM (2012) Review of XY routing algorithm for network-on-chip architecture. Int J Comput Appl 43(21):975–8887

    Google Scholar 

  59. López-Ibánez M, Dubois-Lacoste J, Stützle T, Birattari M (2011) The irace package, iterated race for automatic algorithm configuration. Tech. rep., Technical Report TR/IRIDIA/2011-004, IRIDIA, Université Libre de Bruxelles

  60. Breslow N (1970) A generalized Kruskal-Wallis test for comparing k samples subject to unequal patterns of censorship. Biometrika 57(3):579–594

    Article  MATH  Google Scholar 

  61. Ruxton GD (2006) The unequal variance t-test is an underused alternative to student’s t-test and the Mann–Whitney u test. Behav Ecol 17(4):688–690

    Article  Google Scholar 

Download references

Funding

This study was financed in part by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - Brasil (CAPES) - Finance Code 001, the Fundação de Amparo à Pesquisa do Estado do RS (FAPERGS) and the Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq). Some experiments in this work used the High-Performance Computing Center (NPAD)/UFRN infrastructure.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hiago Mayk Gomes de Araujo Rocha.

Ethics declarations

Conflict of interest

The authors have no conflicts of interest to declare that are relevant to the content of this article.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gomes de Araujo Rocha, H.M., Schneider Beck, A.C., Eduardo Kreutz, M. et al. Using evolutionary metaheuristics to solve the mapping and routing problem in networks on chip. Des Autom Embed Syst 27, 51–83 (2023). https://doi.org/10.1007/s10617-023-09269-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10617-023-09269-5

Keywords

Navigation