Regional ACO-based routing for load-balancing in NoC systems

Ant Colony Optimization (ACO) is a problem-solving technique that was inspired by the related research on the behavior of real-world ant colony. In the domain of Network-on-chip (NoC), ACO-based adaptive routing has been applied to achieve load-balancing effectively with historical information. However, the cost of the ACO network pheromone table is too high, and this overhead grows fast with the scaling of NoC. In order to fix this problem, it is essential to model the ACO algorithm in more careful consideration of the system architecture, available hardware resource, and appropriate transformation from the ant colony metaphor. In this paper, we analyzed the NoC network characteristic and bring about the corresponding issues of implementing ACO on NoC. We proposed a Regional ACO-based routing (RACO) with static and dynamic regional table forming technique to reduce the cost of table, share pheromone information, and adopt look-ahead model for further load-balancing. The experimental results show that RACO can be implemented with less memory, less cost increase on scaling, and better performance of load-balancing compared to traditional ACO-based routing.

[1]  Ge-Ming Chiu,et al.  The Odd-Even Turn Model for Adaptive Routing , 2000, IEEE Trans. Parallel Distributed Syst..

[2]  Loren Schwiebert,et al.  Performance Tuning of Adaptive Wormhole Routing through Selection Function Choice , 2002, J. Parallel Distributed Comput..

[3]  Li Shang,et al.  PowerHerd: a distributed scheme for dynamically satisfying peak-power constraints in interconnection networks , 2006, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Vincenzo Catania,et al.  Implementation and Analysis of a New Selection Strategy for Adaptive Routing in Networks-on-Chip , 2008, IEEE Transactions on Computers.

[5]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[6]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[7]  W. Dally,et al.  Route packets, not wires: on-chip interconnection networks , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[8]  Pedro López,et al.  On the Influence of the Selection Function on the Performance of Networks of Workstations , 2000, ISHPC.

[9]  Luca Benini,et al.  Networks on chip: a new paradigm for systems on chip design , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[10]  En-Jui Chang,et al.  ACO-based Cascaded Adaptive Routing for traffic balancing in NoC systems , 2010, The 2010 International Conference on Green Circuits and Systems.

[11]  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.

[12]  Masoud Daneshtalab,et al.  NoC Hot Spot minimization Using AntNet Dynamic Routing Algorithm , 2006, IEEE 17th International Conference on Application-specific Systems, Architectures and Processors (ASAP'06).

[13]  Kwang Mong Sim,et al.  Ant colony optimization for routing and load-balancing: survey and new directions , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[14]  Radu Marculescu,et al.  Key research problems in NoC design: a holistic perspective , 2005, 2005 Third IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis (CODES+ISSS'05).

[15]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

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

[17]  Lionel M. Ni,et al.  The Turn Model for Adaptive Routing , 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.