Name
Abstract | ||
|---|---|---|
Two major issues which must be addressed in the VLSI layout methodology are placement and routing. Traditionally, these two issues are handled separately to reduce the computational complexity. But these two issues are interrelated as routability must be guaranteed for placement in addition to the geometrical constraints. The authors propose a distributed processing approach for solving this integrated routing-placement problem. The distributed processing network is roughly based on the Hopfield model and is designed to minimize an objective function similar to that used for the traveling salesman problem. Minimization of the objective function provides cell placements such that the total net span is minimized. The idea is based on the notion of slicing the slice sequencing in a hierarchical fashion. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1109/SPDP.1990.143549 | Dallas, TX |
Keywords | Field | DocType |
distributed processing,parallel distributed processing,very large scale integration,traveling salesman problem,vlsi,computational complexity,neural nets,network topology,routing,algorithm design and analysis,ic layout,parallel algorithms,objective function | Integrated circuit layout,Algorithm design,Computer science,Parallel algorithm,Parallel computing,Network topology,Travelling salesman problem,Artificial neural network,Very-large-scale integration,Distributed computing,Computational complexity theory | Conference |
ISBN | Citations | PageRank |
0-8186-2087-0 | 0 | 0.34 |
References | Authors | |
2 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| John D. Provence | 1 | 2 | 1.25 |
| S. Naganathan | 2 | 13 | 4.33 |