Optimization Approaches for Core Mapping on Networks on Chip

ABSTRACT Network on Chip (NoC) has been suggested as an appropriate solution for the communication demands in Systems on Chip (SoCs). Due to the limitation of the resources in NoC, suitable load distribution over limited resources which is known as mapping problem is a challenging issue. This paper proposes a linearized model of quadratic assignment problem (QAP) to map the tasks to the cores not only to minimize the power consumption but also to improve the performance in NoCs. In addition to the proposed linearized model, two meta-heuristic algorithms such as genetic algorithm and simulated annealing are suggested to solve the considered mapping problem as QAP. The extensive computational study over the well-known benchmarks of the literature of NoCs proves that the proposed linearized formulation performs better than the meta-heuristic approaches in terms of power dissipation and performance of the NoCs.

[1]  Rasoul Haji,et al.  Determination of the economical policy of a three-echelon inventory system with (R, Q) ordering policy and information sharing , 2011 .

[2]  A. E. Eiben,et al.  Introduction to Evolutionary Computing , 2003, Natural Computing Series.

[3]  Luca Benini,et al.  NoC synthesis flow for customized domain specific multiprocessor systems-on-chip , 2005, IEEE Transactions on Parallel and Distributed Systems.

[4]  W. Art Chaovalitwongse,et al.  An improved linearization technique for a class of quadratic 0-1 programming problems , 2012, Optim. Lett..

[5]  Mostafa Hajiaghaei-Keshteli,et al.  The allocation of customers to potential distribution centers in supply chain networks: GA and AIA approaches , 2011, Appl. Soft Comput..

[6]  Glenn Leary,et al.  Design of Network-on-Chip Architectures With a Genetic Algorithm-Based Technique , 2009, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[7]  Adil Baykasoglu,et al.  A simulated annealing algorithm for dynamic layout problem , 2001, Comput. Oper. Res..

[8]  Marcello Braglia,et al.  Optimisation of a Simulated-Annealing-based Heuristic for Single Row Machine Layout Problem by Genetic Algorithm , 1996 .

[9]  Krishnan Srinivasan,et al.  Linear programming based techniques for synthesis of network-on-chip architectures , 2006, IEEE International Conference on Computer Design: VLSI in Computers and Processors, 2004. ICCD 2004. Proceedings..

[10]  Ali Fuat Alkaya,et al.  Combining and solving sequence dependent traveling salesman and quadratic assignment problems in PCB assembly , 2015, Discret. Appl. Math..

[11]  Orhan Türkbey,et al.  A simulated annealing heuristic for the dynamic layout problem with budget constraint , 2010, Comput. Ind. Eng..

[12]  Reza Tavakkoli-Moghaddam,et al.  Solving a capacitated fixed-charge transportation problem by artificial immune and genetic algorithms with a Prüfer number representation , 2011, Expert Syst. Appl..

[13]  Santanu Chattopadhyay,et al.  Application Mapping Onto Mesh-Based Network-on-Chip Using Discrete Particle Swarm Optimization , 2014, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  W. Art Chaovalitwongse,et al.  A new linearization technique for multi-quadratic 0-1 programming problems , 2004, Oper. Res. Lett..

[16]  Shoushui Wei,et al.  ECG quality assessment based on a kernel support vector machine and genetic algorithm with a feature matrix , 2014, Journal of Zhejiang University SCIENCE C.

[17]  Mostafa Hajiaghaei-Keshteli,et al.  Genetic algorithms for coordinated scheduling of production and air transportation , 2010, Expert Syst. Appl..

[18]  Krishnan Srinivasan,et al.  Automated Techniques for Synthesis of Application-Specific Network-on-Chip Architectures , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[19]  A. Alfa,et al.  Experimental analysis of simulated annealing based algorithms for the layout problem , 1992 .

[20]  David Z. Pan,et al.  UNISM: Unified Scheduling and Mapping for General Networks on Chip , 2012, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[21]  Luca Benini,et al.  Networks on Chips : A New SoC Paradigm , 2022 .

[22]  Warren P. Adams,et al.  Linear programming insights into solvable cases of the quadratic assignment problem , 2014, Discret. Optim..

[23]  Radu Marculescu,et al.  Energy-aware mapping for tile-based NoC architectures under performance constraints , 2003, ASP-DAC '03.

[24]  S. Molla‐Alizadeh‐Zavardehi,et al.  Genetic and differential evolution algorithms for the allocation of customers to potential distribution centers in a fuzzy environment , 2014 .

[25]  Béla Vizvári,et al.  Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry , 2015, Int. Trans. Oper. Res..

[26]  Lei Zhang,et al.  A hybrid genetic algorithm to optimize device allocation in industrial Ethernet networks with real-time constraints , 2011, Journal of Zhejiang University SCIENCE C.

[27]  Henri Pierreval,et al.  Handling qualitative aspects in Unequal Area Facility Layout Problem: An Interactive Genetic Algorithm , 2013, Appl. Soft Comput..

[28]  Srinivasan Murali,et al.  A Methodology for Mapping Multiple Use-Cases onto Networks on Chips , 2006, Proceedings of the Design Automation & Test in Europe Conference.

[29]  Mostafa Hajiaghaei-Keshteli,et al.  Solving the integrated scheduling of production and rail transportation problem by Keshtel algorithm , 2014, Appl. Soft Comput..

[30]  Michal Czapinski,et al.  An effective Parallel Multistart Tabu Search for Quadratic Assignment Problem on CUDA platform , 2013, J. Parallel Distributed Comput..

[31]  Radu Marculescu,et al.  Energy- and performance-aware mapping for regular NoC architectures , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[32]  Sharath Krishnamurthy,et al.  Data Encoding Techniques for Reducing Energy Consumption in Network-on-Chip , 2015 .

[33]  Radu Marculescu,et al.  Exploiting the Routing Flexibility for Energy/Performance Aware Mapping of Regular NoC Architectures , 2003, DATE.

[34]  Gerald Paul,et al.  Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem , 2010, Oper. Res. Lett..

[35]  Béla Vizvári,et al.  To lay out or not to lay out? , 2011, Ann. Oper. Res..

[36]  Abdollah Hadi-Vencheh,et al.  Modified migrating birds optimization algorithm for closed loop layout with exact distances in flexible manufacturing systems , 2015, Expert Syst. Appl..

[37]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[38]  Natalie D. Enright Jerger,et al.  Outstanding Research Problems in NoC Design: System, Microarchitecture, and Circuit Perspectives , 2009, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[39]  Krishnan Srinivasan,et al.  A technique for low energy mapping and routing in network-on-chip architectures , 2005, ISLPED '05. Proceedings of the 2005 International Symposium on Low Power Electronics and Design, 2005..

[40]  Borzou Rostami,et al.  A revised reformulation-linearization technique for the quadratic assignment problem , 2014, Discret. Optim..

[41]  Srinivasan Murali,et al.  Bandwidth-constrained mapping of cores onto NoC architectures , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.

[42]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[43]  Monique Laurent,et al.  The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure , 2014, Oper. Res. Lett..

[44]  G. Paul,et al.  An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems , 2010, Eur. J. Oper. Res..