Geometry Independent Wirelength Estimation Method in VLSI Routing

Sardar, R.; Mondal, Reetam; Samanta, Tuhina

doi:10.1109/vlsid.2013.197

Cited by 2 publications

(3 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed hybrid algorithm is compared with some standard benchmark ISPD’98 (Alpert, 1998) for VLSI global routing, and the wire length obtained is measured against Sardar et al (2013) as arranged in Table 7. The results clearly exhibit the comparable efficiency of the proposed algorithm, which deviates around 7% from the benchmark, and in some cases, the proposed algorithm establishes its supremacy.…”

Section: Resultsmentioning

confidence: 99%

“…EIWO-PSO hybrid generates minimum wire length cost of 18,014 shown in Figure 12 as compared to 18,405 of EIWO-PSO hybrid for 500 terminal nodes. Figure 13 shows the MRST generated by EIWO algorithm on 1,000 terminal nodes The proposed hybrid algorithm is compared with some standard benchmark ISPD'98 (Alpert, 1998) for VLSI global routing, and the wire length obtained is measured against Sardar et al (2013) as arranged in Table 7. The results clearly exhibit the comparable efficiency of the proposed algorithm, which deviates around 7% from the benchmark, and in some cases, the proposed algorithm establishes its supremacy.…”

Section: Test On Big Instancesmentioning

confidence: 99%

“…of EIWO-PSO with result in(Sardar et al, 2013) against ISPD'98 benchmark Benchmark Wire length in(Sardar et al, 2013) …”

mentioning

confidence: 99%

See 2 more Smart Citations

Wire length optimization of VLSI circuits using IWO algorithm and its hybrid

Nath

Sing

Sarkar

2021

View full text Add to dashboard Cite

Purpose Advancement in optimization of VLSI circuits involves reduction in chip size from micrometer to nanometer level as well as fabrication of a billions of transistors in a single die where global routing problem remains significant with a trade-off of power dissipation and interconnect delay. This paper aims to solve the increased complexity in VLSI chip by minimization of the wire length in VLSI circuits using a new approach based on nature-inspired meta-heuristic, invasive weed optimization (IWO). Further, this paper aims to achieve maximum circuit optimization using IWO hybridized with particle swarm optimization (PSO). Design/methodology/approach This paper projects the complexities of global routing process of VLSI circuit design in mapping it with a well-known NP-complete problem, the minimum rectilinear Steiner tree (MRST) problem. IWO meta-heuristic algorithm is proposed to meet the MRST problem more efficiently and thereby reducing the overall wire-length of interconnected nodes. Further, the proposed approach is hybridized with PSO, and a comparative analysis is performed with geosteiner 5.0.1 and existing PSO technique over minimization, consistency and convergence against available benchmark. Findings This paper provides high performance–enhanced IWO algorithm, which keeps in generating low MRST value, thereby successful wire length reduction of VLSI circuits is significantly achieved as evident from the experimental results as compared to PSO algorithm and also generates value nearer to geosteiner 5.0.1 benchmark. Even with big VLSI instances, hybrid IWO with PSO establishes its robustness over achieving improved optimization of overall wire length of VLSI circuits. Practical implications This paper includes implications in the areas of optimization of VLSI circuit design specifically in the arena of VLSI routing and the recent developments in routing optimization using meta-heuristic algorithms. Originality/value This paper fulfills an identified need to study optimization of VLSI circuits where minimization of overall interconnected wire length in global routing plays a significant role. Use of nature-based meta-heuristics in solving the global routing problem is projected to be an alternative approach other than conventional method.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Test On Big Instancesmentioning

confidence: 99%

See 1 more Smart Citation

Wire length optimization of VLSI circuits using IWO algorithm and its hybrid

Nath

Sing

Sarkar

2021

View full text Add to dashboard Cite

show abstract

A Very Large-Scale Integration Global Routing Optimization Model for Hybrid Physarum Bionetworks

Nath,

Majumdar

2023

RJET

View full text Add to dashboard Cite

Interconnection of billion transistors in a single layer of a die with the advent of the nanometer regime imposes a great challenge to handle the increased complexity, particularly in the global routing of the Very Large-Scale Integration (VLSI) physical design phase which involves distinct optimization in the computation of overall interconnect wire-length. In classical graph theory, the VLSI global routing problem can be mapped as a Rectilinear Steiner Minimal Tree (RSMT) Problem, which in itself is an NP-complete problem. The use of metaheuristics in solving this problem plays a major role where Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) proved to be efficient algorithms. Both algorithms face certain limitations and inconsistencies in determining maximum optimization. A new optimization algorithm with insight from the biological activity of microorganisms has been proposed in this paper which is based on the behavior of the unicellular organism Physarum Polycephalum aiming at minimizing the wire length of VLSI interconnects. The paper further explores a new hybridization technique employing the use of Physarum BioNetwork and Particle Swarm Optimization together where PSO generate better possible Steiner’s in the initial stage for the final process using Physarum BioNetwork to ensure better convergence. Complexity analysis of the proposed algorithm has been performed and the simulation results achieved greater efficiency when compared with the conventional PSO algorithm and available industry benchmark over-optimizing Global Routing problem in VLSI design.

show abstract

Geometry Independent Wirelength Estimation Method in VLSI Routing

Cited by 2 publications

References 21 publications

Wire length optimization of VLSI circuits using IWO algorithm and its hybrid

Wire length optimization of VLSI circuits using IWO algorithm and its hybrid

A Very Large-Scale Integration Global Routing Optimization Model for Hybrid Physarum Bionetworks

Contact Info

Product

Resources

About