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.

Highlights

  • Very Large Scale Integration (VLSI) is a process of forming an Integrated Circuit (IC) by incorporating thousands of transistors into a single chip [1]

  • Routing plays a key role in VLSI physical design as it determines the specific shape and layout of interconnect, impacting performance, power and manufacturability, which is traditionally divided into the two steps of global and detailed routing

  • This paper proposes a novel framework of Particle Swarm Optimization (PSO) to solve OARMST problem and extends the application of Swarm Intelligence (SI) algorithm in VLSI physical design

Read more

Summary

INTRODUCTION

Very Large Scale Integration (VLSI) is a process of forming an Integrated Circuit (IC) by incorporating thousands of transistors into a single chip [1]. The algorithm simulates the search and optimization processes into the attraction and movement of the firefly individuals, and measures the objective function of solving the problem as the position of the individual. A solution of global routing is a set of SMTs in a grid graph, and a net corresponds to a Steiner tree that satisfies constraints. The goal of this phase is to minimize the length of the Steiner trees. The primary goal is to make the routing area as small as possible, and second, to minimize the number of vias and the wirelength of each net At this stage, many other factors are considered like power consumption, delay, coupling of interconnects, and so on. This technology provides a better initial routing scheme for detailed routing by considering constraints such as local nets, congestion, and the location of vias

ROUTING PROBLEMS USING SWARM INTELLIGENCE
APPLICATION OF ACO
APPLICATION OF DE
APPLICATION OF ABC
APPLICATION OF FA
RELATED DISCUSSIONS
PROSPECTS OF FUTURE STUDY
CONCLUSION AND FUTURE WORK

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.