The Via Minimization Problem is NP-Complete
IEEE Transactions on Computers
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Integration, the VLSI Journal
A graph-partitioning-based approach for multi-layer constrained via minimization
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Discrete Applied Mathematics - Special volume on VLSI
Artificial Intelligence Techniques: A Comprehensive Catalogue
Artificial Intelligence Techniques: A Comprehensive Catalogue
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
An efficient approach to multilayer layer assignment with an application to via minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A novel genetic algorithm based on cure mechanism of traditional chinese medicine
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
| Hi-index | 0.01 |
Layer assignment is an important post-layout optimization technique in Very Large Scale Integrated-circuit (VLSI) layout automation. It re-assigns wire segments in a routing solution to appropriate layers to achieve certain optimization objectives. This paper focuses on investigating the layer assignment problem with application to via minimization, which is known to be NP-complete. In this paper a knowledge-based genetic algorithm for the layer assignment problem is proposed, with the aim of utilizing domain-specific knowledge to speedup the process of evolution and to improve the quality of solutions. Experimental results show that this knowledge-based genetic algorithm can consistently produce the same or better results than a heuristic algorithm and a traditional genetic algorithm.