{"title":"A genetic algorithm for global improvement of macrocell layouts","authors":"Klaus Glasmacher, A. Hess, G. Zimmermann","doi":"10.1109/ICCD.1991.139905","DOIUrl":null,"url":null,"abstract":"The result of many floorplanning algorithms is a placement of macrocells. A novel technique for the improvement of a given placement is presented which is based on the optimization of the channel densities by refining the cell positions. The authors introduce a distance function for each channel representing the channel width. This width can be altered by shifting adjacent cells along each other by an offset. They present an optimization to find offsets for adjacent cells which lead to a minimal area demand of the total layout. The method is based on a genetic algorithm, an iterative improvement procedure. Results are presented.<<ETX>>","PeriodicalId":239827,"journal":{"name":"[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors","volume":"122 19","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCD.1991.139905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
The result of many floorplanning algorithms is a placement of macrocells. A novel technique for the improvement of a given placement is presented which is based on the optimization of the channel densities by refining the cell positions. The authors introduce a distance function for each channel representing the channel width. This width can be altered by shifting adjacent cells along each other by an offset. They present an optimization to find offsets for adjacent cells which lead to a minimal area demand of the total layout. The method is based on a genetic algorithm, an iterative improvement procedure. Results are presented.<>