{"title":"为时钟树合成中的遗传算法制定设计决策","authors":"Scott Lerner, B. Taskin","doi":"10.1109/IGCC.2018.8752170","DOIUrl":null,"url":null,"abstract":"Binary clock tree (BCT) synthesis fundamentally depends on the quality of the process of merging pairs. Selecting the optimal merging nodes is computationally expensive, even using heuristic methods. This paper presents an automated synthesis approach based on genetic algorithms (GA), that reduces the search effort for feasible node pair selection. Insights and best practices are presented for using GA processes for generating BCTs that evolve over time. BCTs synthesized with this GA approach are demonstrated experimentally with HSPICE simulations. Furthermore, the impact of utilizing a human-in-the-loop in this GA process for merging pair selection is analyzed methodically. The outcome is a best-practices approach towards automating the synthesis of BCTs based on the proposed GA approach.","PeriodicalId":388554,"journal":{"name":"2018 Ninth International Green and Sustainable Computing Conference (IGSC)","volume":"133 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Towards Design Decisions for Genetic Algorithms in Clock Tree Synthesis\",\"authors\":\"Scott Lerner, B. Taskin\",\"doi\":\"10.1109/IGCC.2018.8752170\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Binary clock tree (BCT) synthesis fundamentally depends on the quality of the process of merging pairs. Selecting the optimal merging nodes is computationally expensive, even using heuristic methods. This paper presents an automated synthesis approach based on genetic algorithms (GA), that reduces the search effort for feasible node pair selection. Insights and best practices are presented for using GA processes for generating BCTs that evolve over time. BCTs synthesized with this GA approach are demonstrated experimentally with HSPICE simulations. Furthermore, the impact of utilizing a human-in-the-loop in this GA process for merging pair selection is analyzed methodically. The outcome is a best-practices approach towards automating the synthesis of BCTs based on the proposed GA approach.\",\"PeriodicalId\":388554,\"journal\":{\"name\":\"2018 Ninth International Green and Sustainable Computing Conference (IGSC)\",\"volume\":\"133 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Ninth International Green and Sustainable Computing Conference (IGSC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IGCC.2018.8752170\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Ninth International Green and Sustainable Computing Conference (IGSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IGCC.2018.8752170","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
摘要
二进制时钟树(BCT)合成从根本上取决于合并节点对过程的质量。即使使用启发式方法,选择最佳合并节点的计算成本也很高。本文介绍了一种基于遗传算法(GA)的自动合成方法,它能减少可行节点对选择的搜索工作量。本文还介绍了使用遗传算法生成随时间演变的 BCT 的见解和最佳实践。通过 HSPICE 仿真实验演示了使用这种 GA 方法合成的 BCT。此外,还通过方法分析了在合并配对选择的 GA 过程中利用人工在环的影响。研究结果是基于所提出的 GA 方法实现 BCT 自动合成的最佳实践方法。
Towards Design Decisions for Genetic Algorithms in Clock Tree Synthesis
Binary clock tree (BCT) synthesis fundamentally depends on the quality of the process of merging pairs. Selecting the optimal merging nodes is computationally expensive, even using heuristic methods. This paper presents an automated synthesis approach based on genetic algorithms (GA), that reduces the search effort for feasible node pair selection. Insights and best practices are presented for using GA processes for generating BCTs that evolve over time. BCTs synthesized with this GA approach are demonstrated experimentally with HSPICE simulations. Furthermore, the impact of utilizing a human-in-the-loop in this GA process for merging pair selection is analyzed methodically. The outcome is a best-practices approach towards automating the synthesis of BCTs based on the proposed GA approach.