Mumford, Christine Lesley ![]() |
Abstract
We present a genetic algorithm (GA) that uses a slicing tree construction process for the placement and area optimization of soft modules in very large scale integration floorplan design. We have overcome the serious representational problems usually associated with encoding slicing floorplans into GAs and have obtained excellent (often optimal) results for module sets with up to 100 rectangles. The slicing tree construction process used by our GA to generate the floorplans has a runtime scaling of O(n lg n). This compares very favorably with other recent approaches based on nonslicing floorplans that require much longer runtimes. We demonstrate that our GA outperforms a simulated annealing implementation with the same representation and mutation operators as the GA
Item Type: | Article |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Computer Science & Informatics |
Uncontrolled Keywords: | VLSI; circuit layout CAD; genetic algorithms; simulated annealing |
ISSN: | 1089778X |
Last Modified: | 17 Oct 2022 09:01 |
URI: | https://orca.cardiff.ac.uk/id/eprint/1834 |
Citation Data
Cited 62 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
![]() |
Edit Item |