Benchmarks for cell-based layout systems
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Proud: a fast sea-of-gates placement algorithm
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
DAC '84 Proceedings of the 21st Design Automation Conference
A multi-layer channel router with new style of over-the-cell routing
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
A new generalized row-based global router
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
A new feed-through assignment algorithm based on a flow model
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
A Balanced-Mesh Clock Routing Technique Using Circuit Partitioning
EDTC '96 Proceedings of the 1996 European conference on Design and Test
| Hi-index | 0.00 |
New placement and global routing algorithms are proposed for standard cell layouts. The placement algorithm, called the hierarchical clustering with min-cut exchange (HCME), is effective to avoid being trapped in local optimum solutions. The global routing algorithm does not route the nets one by one and therefore, the results are independent of the net order and channel order. In this algorithm, channel width is minimized under a cost function, in which the trade-off between the minimization of net lengths and the minimization of the number of tracks is considered. These algorithms are simple and highly efficient. This is confirmed by computational experiments.