A genetic algorithm for the routing of VLSI circuits

Geraci, M.; Orlando, P.; Sorbello, Filippo; Vassallo, Giorgio

doi:10.1109/euasic.1991.212864

Cited by 13 publications

(4 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several papers have been published in which geneticalgorithm-derived strategies are applied to the routing problem of VLSI circuits [16], [17], [24]- [26], [29]- [32].…”

Section: B Genetic Algorithms For the Routing Problemmentioning

confidence: 99%

See 1 more Smart Citation

A parallel genetic algorithm for performance-driven VLSI routing

Lienig

1997

IEEE Trans. Evol. Computat.

View full text Add to dashboard Cite

This paper presents a novel approach to solve the VLSI (very large scale integration) channel and switchbox routing problems. The approach is based on a parallel genetic algorithm (PGA) that runs on a distributed network of workstations. The algorithm optimizes both physical constraints (length of nets, number of vias) and crosstalk (delay due to coupled capacitance). The parallel approach is shown to consistently perform better than a sequential genetic algorithm when applied to these routing problems. An extensive investigation of the parameters of the algorithm yields routing results that are qualitatively better or as good as the best published results. In addition, the algorithm is able to significantly reduce the occurrence of crosstalk.

show abstract

“…Several papers have been published in which geneticalgorithm-derived strategies are applied to the routing problem of VLSI circuits [16], [17], [24]- [26], [29]- [32].…”

Section: B Genetic Algorithms For the Routing Problemmentioning

confidence: 99%

“…The router in [16] combines the steepest-descent method with features of genetic algorithms. The crossover operator is restricted to the exchange of entire nets and the mutation procedure performs only the creation of new individuals.…”

Section: B Genetic Algorithms For the Routing Problemmentioning

confidence: 99%

A parallel genetic algorithm for performance-driven VLSI routing

Lienig

1997

IEEE Trans. Evol. Computat.

View full text Add to dashboard Cite

show abstract

“…3;4 The approach of Geraci et al combines the steepest descent method with features of GAs. 3 Their crossover operator is restricted to the exchanging of entire nets and the mutation procedure performs only the creation of new initial individuals. Lin et al present a rip-up-and-rerouter that is based on a probabilistic rerouting of nets of one routing structure.…”

Section: Introductionmentioning

confidence: 99%

Gasbor: A Genetic Algorithm Approach for Solving the Switchbox Routing Problem

Lienig

Thulasiraman

1996

J CIRCUIT SYST COMP

View full text Add to dashboard Cite

A new genetic algorithm for switchbox routing in the physical design process of integrated circuits is presented. Our algorithm, called GASBOR (Genetic Algorithm for SwitchBOx Routing), is based on a three-dimensional representation of the switchbox and problem-specific genetic operators. The performance of the algorithm is tested on different benchmarks and it is shown that the results obtained using the proposed algorithm are either qualitatively similar to or better than the best published results.

show abstract

“…In many areas they are superior to other classical optimization techniques. GA has been widely and successfully used in various routing problems, e.g., VLSI channel routing [14], [16]- [20]. In this paper, we apply GA to solve the FSCRP and show that solutions with significantly better qualities can be obtained.…”

Section: Previous Workmentioning

confidence: 95%

FPGA Segmented Channel Routing Using Genetic Algorithms

Wang

Zhou²,

Li³

2005 IEEE Congress on Evolutionary Computation

View full text Add to dashboard Cite

A genetic algorithm approach for segmented channel routing in field programmable gate arrays (FPGA's) is presented in this paper. The FPGA segmented channel routing problem (FSCRP) is formulated as a special case of a matrix row matching problem which is known to be NP-complete. The goal of FSCRPS is to find a conflict-free net assignment in the tracks within the channel with the minimum routing cost. Simulations on 30 benchmark instances show that GA is able to obtain better solutions compared to the gradual neural network (GNN) approach.

show abstract

A genetic algorithm for the routing of VLSI circuits

Cited by 13 publications

References 3 publications

A parallel genetic algorithm for performance-driven VLSI routing

A parallel genetic algorithm for performance-driven VLSI routing

Gasbor: A Genetic Algorithm Approach for Solving the Switchbox Routing Problem

FPGA Segmented Channel Routing Using Genetic Algorithms

Contact Info

Product

Resources

About