A Survey of Swarm Intelligence Techniques in VLSI Routing Problems

Abstract

Routing is a complex and critical stage in the physical design of Very Large Scale Integration (VLSI), minimizing interconnect length and delay to optimize overall chip performance. With the rapid development of modern technology, VLSI routing faces enormous challenges such as large delay, high congestion, and high-power consumption. As a rising optimization method, Swarm Intelligence (SI) inspired from collective intelligence behaviors through cooperation or interaction with the environment provides effectiveness and robustness for solving NP-hard problems. Many researchers have consequently used SI techniques to solve routing-related problems in VLSI. This paper reviews the application of several SI techniques to the VLSI routing filed. Firstly, five commonly used SI techniques and related models, and three classic routing problems are described: Steiner tree construction, global routing and detailed routing. Then an overview of the current state of this field is given according to the above categories, and the survey offers informative discussions from five aspects: 1) Steiner minimum tree construction; 2) wirelength-driven routing; 3) obstacle-avoiding routing; 4) timing-driven routing; 5) power-driven routing. Finally, under three new technology models: X-architecture, multiple dynamic supply voltage and via-pillar, the future development trends are pointed as follows: 1) suggesting suitable SI techniques to specific routing problems for advanced technology models; 2) exploring new and available SI techniques that have not yet been applied to VLSI routing.

X-architecture Steiner minimal tree algorithm based on multi-strategy optimization discrete differential evolution

“…In Tang et al (2020a) , three kinds of sub problems and three kinds of general routing methods in Steiner tree construction were analyzed, and the research progress in two new technology modes was analyzed ( Tang et al, 2020a ). Chen et al (2020a) introduced five commonly used swarm intelligence technologies and related models, as well as three classic routing problems: Steiner tree construction, global routing, and detailed routing. On this basis, the research status of Steiner minimum tree construction, wire length driven routing, obstacle avoidance routing, timing driven routing, and power driven routing were summarized ( Chen et al, 2020a ).…”

A Novel Community Detection Algorithm Based on Paring, Splitting and Aggregating in Internet of Things

“…The main idea of Particle Swarm Optimization(i.e., PSO) is study the clustering behavior of birds, using the characteristics of bird population attracted by habitat to guide human decision-making process [6]. Chen et al [7] add two genetic operators based on union-find into PSO process, namely crossover and mutation operations, which update the velocity and position of particles and further enhance the search ability. Liu et al [8]- [10] define the Global Routing problem as a multicommodity flow problem, and adopt the partitioning strategy and PSO to reduce the size of the Global Routing problem.…”

A Survey on Steiner Tree Construction and Global Routing for VLSI Design

“…Huang et al [67] proposed an OAXSMT construction algorithm based on PSO, which is the first to specifically solve the problem of single-layer X-architecture around the Steiner tree problem. PSO has the characteristics of simple execution, few parameters and fast convergence [100]- [102]. Two genetic operators based on union-find are added into Huang's PSO process, namely crossover and mutation operations, which update the velocity and position of particles and further enhance the search ability.…”