{"title":"A fast placement approach for large scale modules based on less flexibility first principles","authors":"Shaojun Wei, Sheqin Dong, Xianlong Hong, Youliang Wu","doi":"10.1109/ICASIC.2005.1611443","DOIUrl":null,"url":null,"abstract":"Conventional simulated annealing (SA) based placement could be very time consuming as the design complexity increases. In this paper, we present a new approach for large scale building blocks based on less flexibility first (LFF) principles. Since the resource constraints at the beginning, middle, or end of the packing process varies a lot, we divide the packing process into several continuous stages and apply different heuristic packing strategies which implies the LFF principles. Experiment results show that our approach could generate an optimized placement much quicker than SA based approaches. Also, the placement result could be used as an initial solution for SA-based algorithms. In another experiment, we start such a SA process with lower temperature and get similar solution quality but shorter execution time than SA begins with random initial solutions","PeriodicalId":431034,"journal":{"name":"2005 6th International Conference on ASIC","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 6th International Conference on ASIC","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASIC.2005.1611443","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Conventional simulated annealing (SA) based placement could be very time consuming as the design complexity increases. In this paper, we present a new approach for large scale building blocks based on less flexibility first (LFF) principles. Since the resource constraints at the beginning, middle, or end of the packing process varies a lot, we divide the packing process into several continuous stages and apply different heuristic packing strategies which implies the LFF principles. Experiment results show that our approach could generate an optimized placement much quicker than SA based approaches. Also, the placement result could be used as an initial solution for SA-based algorithms. In another experiment, we start such a SA process with lower temperature and get similar solution quality but shorter execution time than SA begins with random initial solutions