Integrated design space exploration based on power-performance trade-off using genetic algorithm

A. Sengupta, R. Sedaghat, Pallabi Sarkar
{"title":"Integrated design space exploration based on power-performance trade-off using genetic algorithm","authors":"A. Sengupta, R. Sedaghat, Pallabi Sarkar","doi":"10.1145/2007052.2007068","DOIUrl":null,"url":null,"abstract":"This paper presents a novel approach for Design Space Exploration (DSE) of integrated scheduling, allocation and binding in High Level Synthesis based on user specified power consumption and execution time constraints using multi structure Genetic Algorithm (GA). A pioneering effort has been made to explore the power-performance tradeoffs related to design of VLSI applications. The new cost function comprising of execution time is useful for data pipelined applications since it considers latency, cycle time (resulting from initiation interval) and number of sets of pipelined data. The GA based DSE initiates with a novel seeding process for parents as proposed in this paper which guarantees that the final solution will be optimal/near optimal. The proposed approach when verified for number of benchmarks yielded superior results in terms of power optimization and latency compared to a recent GA based approach. Moreover, the efficiency of the proposed approach was demonstrated by the fact that the experimental results also indicated the optimized performance (or execution time for pipelined data) as well as the optimal clock frequency for implementation which the current approach was unable to find.","PeriodicalId":348804,"journal":{"name":"International Conference on Advances in Computing and Artificial Intelligence","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Advances in Computing and Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2007052.2007068","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper presents a novel approach for Design Space Exploration (DSE) of integrated scheduling, allocation and binding in High Level Synthesis based on user specified power consumption and execution time constraints using multi structure Genetic Algorithm (GA). A pioneering effort has been made to explore the power-performance tradeoffs related to design of VLSI applications. The new cost function comprising of execution time is useful for data pipelined applications since it considers latency, cycle time (resulting from initiation interval) and number of sets of pipelined data. The GA based DSE initiates with a novel seeding process for parents as proposed in this paper which guarantees that the final solution will be optimal/near optimal. The proposed approach when verified for number of benchmarks yielded superior results in terms of power optimization and latency compared to a recent GA based approach. Moreover, the efficiency of the proposed approach was demonstrated by the fact that the experimental results also indicated the optimized performance (or execution time for pipelined data) as well as the optimal clock frequency for implementation which the current approach was unable to find.
基于功率-性能权衡的遗传算法集成设计空间探索
提出了一种基于用户指定功耗和执行时间约束的高阶综合设计空间探索(DSE)集成调度、分配和绑定方法。在探索与超大规模集成电路应用设计相关的功率性能权衡方面,已经做出了开创性的努力。包含执行时间的新成本函数对于数据流水线应用程序非常有用,因为它考虑了延迟、周期时间(由启动间隔引起)和流水线数据集的数量。本文提出了一种基于遗传算法的离散遗传算法,该算法采用了一种新颖的父类播种过程,保证了最终解是最优或接近最优的。与最近的基于遗传算法的方法相比,经过大量基准测试验证后,所提出的方法在功耗优化和延迟方面取得了更好的结果。此外,实验结果还显示了当前方法无法找到的最佳性能(或流水线数据的执行时间)和最佳实现时钟频率,从而证明了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信