High-level synthesis of throughput-optimized and energy-efficient approximate designs

Marcos T. Leipnitz, G. Nazar
{"title":"High-level synthesis of throughput-optimized and energy-efficient approximate designs","authors":"Marcos T. Leipnitz, G. Nazar","doi":"10.1145/3387902.3394039","DOIUrl":null,"url":null,"abstract":"Approximate accelerators for throughput-demanding error-resilient kernels can be a solution to meet design requirements with acceptable deviation from the exact implementation. However, handcrafting approximate accelerators may impose prohibitive development time and cost overheads. In this scenario, approximate High-Level Synthesis (HLS) has been proposed to deal with the increased design complexity. Nevertheless, current tools are not suitable for exploring throughput optimizations, being instead constrained to perform specific improvements on area, power, and average performance. In this work, we propose the use of HLS to generate Pareto-optimal accelerators for applications facing throughput constraints. We present an approximate HLS tool able to improve the throughput of such accelerators by up to 80% with no additional area costs, while introducing manageable error for most applications.","PeriodicalId":155089,"journal":{"name":"Proceedings of the 17th ACM International Conference on Computing Frontiers","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 17th ACM International Conference on Computing Frontiers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3387902.3394039","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Approximate accelerators for throughput-demanding error-resilient kernels can be a solution to meet design requirements with acceptable deviation from the exact implementation. However, handcrafting approximate accelerators may impose prohibitive development time and cost overheads. In this scenario, approximate High-Level Synthesis (HLS) has been proposed to deal with the increased design complexity. Nevertheless, current tools are not suitable for exploring throughput optimizations, being instead constrained to perform specific improvements on area, power, and average performance. In this work, we propose the use of HLS to generate Pareto-optimal accelerators for applications facing throughput constraints. We present an approximate HLS tool able to improve the throughput of such accelerators by up to 80% with no additional area costs, while introducing manageable error for most applications.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
高水平综合吞吐量优化和节能近似设计
对于吞吐量要求高的容错核来说,近似加速器是一种解决方案,可以在与精确实现有可接受偏差的情况下满足设计要求。然而,手工制作近似加速器可能会带来令人望而却步的开发时间和成本开销。在这种情况下,提出了近似的高级综合(HLS)来处理增加的设计复杂性。然而,目前的工具并不适合探索吞吐量优化,而是被限制在面积、功率和平均性能上执行特定的改进。在这项工作中,我们建议使用HLS为面临吞吐量限制的应用程序生成帕累托最优加速器。我们提出了一种近似的HLS工具,能够在不增加额外面积成本的情况下将此类加速器的吞吐量提高80%,同时为大多数应用程序引入可管理的错误。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A critical view on moving target defense and its analogies Deffe Management of container-based genetic algorithm workloads over cloud infrastructure Automaton-based methodology for implementing optimization constraints for quantum annealing An efficient object detection framework with modified dense connections for small objects optimizations
×
引用
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