宏细胞布局全局改进的遗传算法

[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors Pub Date : 1991-10-14 DOI:10.1109/ICCD.1991.139905

Klaus Glasmacher, A. Hess, G. Zimmermann

{"title":"宏细胞布局全局改进的遗传算法","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":"{\"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}","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

摘要

许多平面规划算法的结果是放置宏单元格。提出了一种改进给定位置的新技术，该技术是基于通过细化单元位置来优化通道密度的。作者为每个信道引入了表示信道宽度的距离函数。这个宽度可以通过相邻单元间的偏移量来改变。他们提出了一种优化方法，以找到相邻单元的偏移量，从而使总布局的面积需求最小。该方法是基于遗传算法，一个迭代改进的过程。给出了结果

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A genetic algorithm for global improvement of macrocell layouts

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.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[1991 Proceedings] IEEE International Conference on Computer Design: VLSI in Computers and Processors

自引率

0.00%

发文量