A Comparative Evaluation of Latency-Aware Energy Optimization Approaches in Many-Core Systems (Invited Paper)

Khalil Esper, S. Wildermann, J. Teich
{"title":"A Comparative Evaluation of Latency-Aware Energy Optimization Approaches in Many-Core Systems (Invited Paper)","authors":"Khalil Esper, S. Wildermann, J. Teich","doi":"10.4230/OASIcs.NG-RES.2021.1","DOIUrl":null,"url":null,"abstract":"Many applications vary a lot in execution time depending on their workload. A prominent example is image processing applications, where the execution time is dependent on the content or the size of the processed input images. An interesting case is when these applications have quality-of-service requirements such as soft deadlines, that they should meet as good as possible. A further complicated case is when such applications have one or even multiple further objectives to optimize like, e.g., energy consumption. Approaches that dynamically adapt the processing resources to application needs under multiple optimization goals and constraints can be characterized into the application-specific and feedbackbased techniques. Whereas application-specific approaches typically statically use an offline stage to determine the best configuration for each known workload, feedback-based approaches, using, e.g., control theory, adapt the system without the need of knowing the effect of workload on these goals. In this paper, we evaluate a state-of-the-art approach of each of the two categories and compare them for image processing applications in terms of energy consumption and number of deadline misses on a given many-core architecture. In addition, we propose a second feedback-based approach that is based on finite state machines (FSMs). The obtained results suggest that whereas the state-of-the-art application-specific approach is able to meet a specified latency deadline whenever possible while consuming the least amount of energy, it requires a perfect characterization of the workload on a given many-core system. If such knowledge is not available, the feedback-based approaches have their strengths in achieving comparable energy savings, but missing deadlines more often. 2012 ACM Subject Classification Hardware→ Power and energy; Hardware→ Finite state machines; Computing methodologies → Computational control theory; Computer systems organization → Self-organizing autonomic computing","PeriodicalId":151755,"journal":{"name":"NG-RES@HiPEAC","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"NG-RES@HiPEAC","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/OASIcs.NG-RES.2021.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Many applications vary a lot in execution time depending on their workload. A prominent example is image processing applications, where the execution time is dependent on the content or the size of the processed input images. An interesting case is when these applications have quality-of-service requirements such as soft deadlines, that they should meet as good as possible. A further complicated case is when such applications have one or even multiple further objectives to optimize like, e.g., energy consumption. Approaches that dynamically adapt the processing resources to application needs under multiple optimization goals and constraints can be characterized into the application-specific and feedbackbased techniques. Whereas application-specific approaches typically statically use an offline stage to determine the best configuration for each known workload, feedback-based approaches, using, e.g., control theory, adapt the system without the need of knowing the effect of workload on these goals. In this paper, we evaluate a state-of-the-art approach of each of the two categories and compare them for image processing applications in terms of energy consumption and number of deadline misses on a given many-core architecture. In addition, we propose a second feedback-based approach that is based on finite state machines (FSMs). The obtained results suggest that whereas the state-of-the-art application-specific approach is able to meet a specified latency deadline whenever possible while consuming the least amount of energy, it requires a perfect characterization of the workload on a given many-core system. If such knowledge is not available, the feedback-based approaches have their strengths in achieving comparable energy savings, but missing deadlines more often. 2012 ACM Subject Classification Hardware→ Power and energy; Hardware→ Finite state machines; Computing methodologies → Computational control theory; Computer systems organization → Self-organizing autonomic computing
多核系统中延迟感知能量优化方法的比较评价(特邀论文)
根据工作负载的不同,许多应用程序的执行时间差异很大。一个突出的例子是图像处理应用程序,其中执行时间取决于处理的输入图像的内容或大小。一个有趣的情况是,当这些应用程序具有服务质量需求(如软截止日期)时,它们应该尽可能地满足这些需求。更复杂的情况是,当这样的应用程序有一个或甚至多个进一步的目标来优化,例如,能源消耗。在多个优化目标和约束条件下,动态调整处理资源以适应应用需求的方法可分为特定于应用的和基于反馈的技术。特定于应用程序的方法通常静态地使用离线阶段来确定每个已知工作负载的最佳配置,而基于反馈的方法(例如,使用控制理论)在不需要知道工作负载对这些目标的影响的情况下调整系统。在本文中,我们评估了这两种类型的最先进的方法,并在给定的多核架构上,从能耗和错过截止日期的数量方面比较了它们在图像处理应用中的应用。此外,我们提出了基于有限状态机(FSMs)的第二种基于反馈的方法。所获得的结果表明,尽管最先进的特定于应用程序的方法能够在尽可能消耗最少能量的情况下满足指定的延迟截止日期,但它需要对给定多核系统上的工作负载进行完美的表征。如果没有这样的知识,基于反馈的方法在实现类似的能源节约方面有其优势,但更容易错过截止日期。2012 ACM学科分类硬件→电源与能源;硬件→有限状态机;计算方法→计算控制理论;计算机系统组织→自组织自主计算
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信