Towards Design Decisions for Genetic Algorithms in Clock Tree Synthesis

Scott Lerner, B. Taskin
{"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}
引用次数: 0

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
为时钟树合成中的遗传算法制定设计决策
二进制时钟树(BCT)合成从根本上取决于合并节点对过程的质量。即使使用启发式方法,选择最佳合并节点的计算成本也很高。本文介绍了一种基于遗传算法(GA)的自动合成方法,它能减少可行节点对选择的搜索工作量。本文还介绍了使用遗传算法生成随时间演变的 BCT 的见解和最佳实践。通过 HSPICE 仿真实验演示了使用这种 GA 方法合成的 BCT。此外,还通过方法分析了在合并配对选择的 GA 过程中利用人工在环的影响。研究结果是基于所提出的 GA 方法实现 BCT 自动合成的最佳实践方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Dynamic Programming Technique for Energy-Efficient Multicore Systems Holistic Approaches to HPC Power and Workflow Management* IGSC 2018 PhD Workshop on Power/Energy Management at Extreme Scale [Copyright notice] DiRP: Distributed Intelligent Rendezvous Point for Multicast Control Plane
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1