高阶DFG综合中功率、面积和时延的多目标优化——A遗传算法方法

S. M. Logesh, D. Ram, M. Bhuvaneswari
{"title":"高阶DFG综合中功率、面积和时延的多目标优化——A遗传算法方法","authors":"S. M. Logesh, D. Ram, M. Bhuvaneswari","doi":"10.1109/ICECTECH.2011.5941570","DOIUrl":null,"url":null,"abstract":"High-level synthesis (HLS) involves the translation of behavioural algorithmic descriptions into an RTL implementation. The parameters to be optimized in high-level synthesis such as power, area and delay are mutually conflicting necessitating trade-offs during the implementation. For complex designs, the design space to be explored is vast. This paper proposes a weighted sum genetic algorithm for optimization of datapaths during high-level synthesis using graded penalty cost function to perform simultaneous scheduling and allocation. GAs being population based, are ideal for searching the large solution space involved. The proposed technique has been evaluated on HLS DSP benchmark circuits like IIR filter and DCT filter and has been found to yield better power aware solutions than a single objective GA, simultaneously optimizing area and delay. The framework provides a large number of alternative datapath designs, all of which meet user design specifications but differ in module, register and interconnect configurations. An average of about 15.7% power reduction on DCT filter and 13% power reduction on IIR filter were obtained.","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Multi-objective optimization of power, area and delay during high-level synthesis of DFG's — A genetic algorithm approach\",\"authors\":\"S. M. Logesh, D. Ram, M. Bhuvaneswari\",\"doi\":\"10.1109/ICECTECH.2011.5941570\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"High-level synthesis (HLS) involves the translation of behavioural algorithmic descriptions into an RTL implementation. The parameters to be optimized in high-level synthesis such as power, area and delay are mutually conflicting necessitating trade-offs during the implementation. For complex designs, the design space to be explored is vast. This paper proposes a weighted sum genetic algorithm for optimization of datapaths during high-level synthesis using graded penalty cost function to perform simultaneous scheduling and allocation. GAs being population based, are ideal for searching the large solution space involved. The proposed technique has been evaluated on HLS DSP benchmark circuits like IIR filter and DCT filter and has been found to yield better power aware solutions than a single objective GA, simultaneously optimizing area and delay. The framework provides a large number of alternative datapath designs, all of which meet user design specifications but differ in module, register and interconnect configurations. An average of about 15.7% power reduction on DCT filter and 13% power reduction on IIR filter were obtained.\",\"PeriodicalId\":184011,\"journal\":{\"name\":\"2011 3rd International Conference on Electronics Computer Technology\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 3rd International Conference on Electronics Computer Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECTECH.2011.5941570\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 3rd International Conference on Electronics Computer Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECTECH.2011.5941570","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

高级综合(HLS)涉及将行为算法描述转换为RTL实现。在高级综合中需要优化的参数如功率、面积和延迟是相互冲突的,需要在实施过程中进行权衡。对于复杂的设计,需要探索的设计空间是巨大的。提出了一种加权和遗传算法,利用分级惩罚代价函数对高级综合过程中的数据路径进行优化,实现同步调度和分配。GAs是基于种群的,非常适合搜索涉及的大型解决方案空间。该技术已在HLS DSP基准电路(如IIR滤波器和DCT滤波器)上进行了评估,并发现比单目标遗传算法产生更好的功率感知解决方案,同时优化了面积和延迟。该框架提供了大量可供选择的数据路径设计,所有这些设计都符合用户设计规范,但在模块、寄存器和互连配置方面有所不同。DCT滤波器和IIR滤波器的平均功耗分别降低了15.7%和13%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-objective optimization of power, area and delay during high-level synthesis of DFG's — A genetic algorithm approach
High-level synthesis (HLS) involves the translation of behavioural algorithmic descriptions into an RTL implementation. The parameters to be optimized in high-level synthesis such as power, area and delay are mutually conflicting necessitating trade-offs during the implementation. For complex designs, the design space to be explored is vast. This paper proposes a weighted sum genetic algorithm for optimization of datapaths during high-level synthesis using graded penalty cost function to perform simultaneous scheduling and allocation. GAs being population based, are ideal for searching the large solution space involved. The proposed technique has been evaluated on HLS DSP benchmark circuits like IIR filter and DCT filter and has been found to yield better power aware solutions than a single objective GA, simultaneously optimizing area and delay. The framework provides a large number of alternative datapath designs, all of which meet user design specifications but differ in module, register and interconnect configurations. An average of about 15.7% power reduction on DCT filter and 13% power reduction on IIR filter were obtained.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信