Benchmarks for cell-based layout systems
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
The time complexity of maximum matching by simulated annealing
Journal of the ACM (JACM)
ORCA a sea-of-gates place and route system
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Efficient final placement based on nets-as-points
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Proceedings of the decennial Caltech conference on VLSI on Advanced research in VLSI
A new placement level wirability estimate with measurements
ACM SIGDA Newsletter
Analysis of placement procedures for VLSI standard cell layout
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
CAD tool interchangeability through Net list translation
ACM SIGDA Newsletter
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
DAC '76 Proceedings of the 13th Design Automation Conference
DAC '82 Proceedings of the 19th Design Automation Conference
| Hi-index | 0.00 |
Since mathematically optimal layout algorithms seem unattainable, layout needs to become a more experimental science. This paper advocates the use of controlled experiments in layout. The physical design workshop bench mark layout environment, open problems solvable by experiment, and the relation of layout experiments to scientific methodology are discussed. The paper concludes by showing that layout synthesis of primitive cells by computer program is impossible since it is no easier than the general artificial intelligence problem.