A heuristic method for constructing hexagonal Steiner minimal trees for routing in VLSI

Samanta, Tuhina; Ghosal, Prasun; Rahaman, Hafizur; Dasgupta, Parthasarathi

doi:10.1109/iscas.2006.1692953

Cited by 15 publications

(13 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work in [3] gives an in-depth analysis of Y -architecture, and highlights the potential advantages of the use of Y -architectures vis-a-vis the X-architectures. Algorithms for construction of Y -routing trees appear in [11,10].…”

Section: Literature Surveymentioning

confidence: 99%

“…Figure 2 illustrates a partially grown Y -routing tree in an underlying Hanan grid for a net. We refer the readers to [10] for the details of the algorithm.…”

Section: Find the Maximum Of All The Euclidean Distances Obtained In mentioning

confidence: 99%

“…Time complexity of constructing a Y -routed Steiner Minimal Tree for the i th net is O(N 3 i log N i ) [10]. Total time complexity for constructing Steiner trees for all the nets is then O(κ × N 3 log N ).…”

Section: Time Complexitymentioning

confidence: 99%

See 2 more Smart Citations

A Method for the Multi-Net Multi-Pin Routing Problem with Layer Assignment

Samantam¹,

Rahaman²,

Ghosal³

et al. 2009

2009 22nd International Conference on VLSI Design

View full text Add to dashboard Cite

Interconnects are vital in deep sub-micron VLSI design, as they impose constraints, such as delay, congestion, crosstalk, power dissipation and others, and consume resources. These parameters affect the efforts for obtaining a feasible solution for the global routing of multiple nets. In addition, efforts are on for exploration and use of non-Manhattan routing architectures. In this work, we focus on the specific problem of multi-net multi-pin global Y -routing for custombuilt design styles with several available routing layers. The problem is formulated as a minimum crossing Y -Steiner Minimal tree problem with multi-layer assignment. Experimental results are quite encouraging.

show abstract

Section: Literature Surveymentioning

confidence: 99%

“…Figure 2 illustrates a partially grown Y -routing tree in an underlying Hanan grid for a net. We refer the readers to [10] for the details of the algorithm.…”

Section: Find the Maximum Of All The Euclidean Distances Obtained In mentioning

confidence: 99%

See 1 more Smart Citation

A Method for the Multi-Net Multi-Pin Routing Problem with Layer Assignment

Samantam¹,

Rahaman²,

Ghosal³

et al. 2009

2009 22nd International Conference on VLSI Design

View full text Add to dashboard Cite

show abstract

“…The spanning graph-based Octilinear Steiner tree algorithms were presented by Zhu et al (2005). Samanta et al (2006) proposed a heuristic method to constructing Hexagonal Steiner minimal tree. Since the SMT problem is an NPhard problem (Garey and Johnson 1997), some evolutionary algorithms, which have been shown to have good application prospects in solving NP-hard problems, were presented for solving RSMT problem (Arora and Mose 2009;Liu et al 2011) and OSMT problem (Arora and Mose 2009;Liu et al 2012).…”

Section: Introductionmentioning

confidence: 99%

A PSO-based timing-driven Octilinear Steiner tree algorithm for VLSI routing considering bend reduction

et al. 2014

View full text Add to dashboard Cite

Constructing a timing-driven Steiner tree is very important in VLSI performance-driven routing stage. Meanwhile, non-Manhattan architecture is supported by several manufacturing technologies and now well appreciated in the chip manufacturing circle. However, limited progress has been reported on the non-Manhattan performance-driven routing problem. In this paper, an efficient algorithm, namely, TOST_BR_MOPSO, is presented to construct the minimumcost spanning tree with a minimum radius for performancedriven routing in Octilinear architecture (one type of the non-Manhattan architecture) based on multi-objective particle swarm optimization (MOPSO) and Elmore delay model. Edge transformation is employed in our algorithm to make the particles have the ability to achieve the optimal solution while Union-Find partition is used to prevent the generation of invalid solution. For the purpose of reducing the number of bends which is one of the key factors of chip manuCommunicated by V. Loia. facturability, we also present an edge-vertex encoding strategy combined with edge transformation. To our best knowledge, no approach has been proposed to optimize the number of bends in the process of constructing the non-Manhattan timing-driven Steiner tree. Moreover, the theorem of Markov chain is used to prove the global convergence of our proposed algorithm. Experimental results indicate that the proposed MOPSO is worthy of being studied in the field of multiobjective optimization problems, and our algorithm has a better tradeoff between the wire length and radius of the routing tree and has achieved a better delay value. Meanwhile, combining edge transformation with the encoding strategy, the proposed algorithm can significantly reduce nearly 20 % in the number of bends.

show abstract

“…The spanning This graph-based Octagonal Steiner tree algorithms were presented in [3]. For constructing Hexagonal Steiner minimal tree, Samanta et al proposed a heuristic method [4]. Because the SMT problem is an NP-hard problem, some evolutionary algorithms, which had been shown to have good application prospects in solving NP-hard problems, were presented for solving Rectilinear Steiner Minimal Tree (RSMT) problem [5], [6] and OSMT problem [6].…”

Section: Introductionmentioning

confidence: 99%

DPSO based Octagonal Steiner Tree algorithm for VLSI routing

Liu

Chen

Guo

2012

2012 IEEE Fifth International Conference on Advanced Computational Intelligence (ICACI)

View full text Add to dashboard Cite

The Octagonal Steiner Minimal Tree (OSMT) problem is an NP-hard problem, which is one of the key problems in non-Manhattan routing. Particle Swarm Optimization (PSO) has been proved to be an efficient intelligent algorithm for optimization designs. This paper presents an OSMT algorithm based on discrete PSO (DPSO), namely OSMT_DPSO, to optimize the wire length. In order to solve the problem of the slow convergence rate of PSO used for a high-dimensional space optimization, a self-adapting strategy that can adjust the learning factors, and combine with the crossover and mutation operators of Genetic Algorithm (GA) is proposed. The experimental results show that the proposed algorithm can efficiently provide the solution of OSMT problem with good quality. Moreover, the algorithm can obtain several topologies of OSMTs which is beneficial for optimizing congestion in VLSI global routing stage.

show abstract

A heuristic method for constructing hexagonal Steiner minimal trees for routing in VLSI

Cited by 15 publications

References 8 publications

A Method for the Multi-Net Multi-Pin Routing Problem with Layer Assignment

A Method for the Multi-Net Multi-Pin Routing Problem with Layer Assignment

A PSO-based timing-driven Octilinear Steiner tree algorithm for VLSI routing considering bend reduction

DPSO based Octagonal Steiner Tree algorithm for VLSI routing

Contact Info

Product

Resources

About