2013 3rd IEEE International Advance Computing Conference (IACC) 2013
DOI: 10.1109/iadcc.2013.6514231
|View full text |Cite
|
Sign up to set email alerts
|

A novel particle swarm optimization approach for VLSI routing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(6 citation statements)
references
References 5 publications
0
6
0
Order By: Relevance
“…Routing, both global and local, has a significant impact on the entire chip performance and efficient routing algorithms (with further modifications leading to improved performance) [8] are obviously the key to success in the future in the domain of VLSI physical design. In this work, our main objective has been to obtain the minimum possible wire length with the help of a global routing algorithm.…”
Section: Discussionmentioning
confidence: 99%
“…Routing, both global and local, has a significant impact on the entire chip performance and efficient routing algorithms (with further modifications leading to improved performance) [8] are obviously the key to success in the future in the domain of VLSI physical design. In this work, our main objective has been to obtain the minimum possible wire length with the help of a global routing algorithm.…”
Section: Discussionmentioning
confidence: 99%
“…Even though this paradigm can be applied to very different problems, the main applications are in robotics [Kube 1997;Sahin et al 2002;Ducatelle et al 2011;Brambilla et al 2013], up to the most recent achievements with large swarms of more than 1,000 robots [Rubenstein et al 2014]. Other interesting application fields are communication networks [Schoonderwoerd et al 1996;Di Caro et al 2004;Zhang et al 2014] and optimization metaheuristics [Dorigo and Stützle 2004;Kennedy et al 2001] (even applied to integrated architectures but only to solve problems such as partitioning [Kuntz and Layzell 1997], placement [Rout et al 2010], and routing [Khan et al 2013] at design time). The interested reader can find several application fields in Bonabeau et al [1999].…”
Section: Rationalementioning
confidence: 99%
“…Dong et al [6] proposed a routing algorithm based on improved Discrete PSO in which a novel encoding for DPSO and update functions are performed to find the RSMT. The results of these methods [6][7][8] were compared with conventional methods and proved to give a better routing optimization.…”
Section: Related Workmentioning
confidence: 99%
“…A heuristic approach to find the optimal routing path and buffer location simultaneously for minimal interconnect delay was presented in [8] and in [7], Prim's Algorithm was modified and implemented as a principle of finding the cost of the RSMT. Dong et al [6] proposed a routing algorithm based on improved Discrete PSO in which a novel encoding for DPSO and update functions are performed to find the RSMT.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation