Two-Stage Competitive Particle Swarm Optimization Based Timing-Driven X-Routing for IC Design Under Smart Manufacturing

Abstract

As the timing delay becomes a critical issue of the chip performance, there comes a burning desire for IC design under smart manufacturing to optimize the delay. As the best connection model for multi-terminal nets, the wirelength and the maximum source-to-sink pathlength of the Steiner minimum tree are both the decisive factors of timing delay for routing. In addition, considering that X-routing can get the utmost out of routing resources, this paper proposes a Timing-Driven X-routing Steiner Minimum Tree (TD-XSMT) algorithm based on two-stage competitive particle swarm optimization. The paper utilizes the multi-objective particle swarm optimization algorithm and redesigns its framework, thus improving its performance. First, a two-stage learning strategy is presented, which balances the exploration and exploitation capabilities of the particle by learning edge structures and pseudo-Steiner point choices. Especially in the second stage, a hybrid crossover strategy is designed to guarantee convergence quality. Second, the competition mechanism is adopted to select particle learning objects and enhance diversity. Finally, according to the characteristics of the discrete TD-XSMT problem, the mutation and crossover operators of the genetic algorithm are used to effectively discretize the proposed algorithm. Experimental results reveal that TSCPSO-TD-XSMT can obtain a smooth trade-off between wirelength and maximum source-to-sink pathlength, and achieve distinguished timing delay optimization.

SLDPSO-TA: Track Assignment Based on Social Learning Discrete Particle Swarm Optimization

“…It has been widely used in various fields such as combinatorial optimization [10][11][12][13], image matching and enhancement [14,15], and data mining [16,17]. Besides, the PSO algorithm has been successfully applied to some routing problems with good results [18][19][20]. Therefore, the PSO technique is one of the effective methods to break the bottleneck of traditional routing algorithms.…”