Towards the development of hierarchical data motion power cost models

T. Mintz, Oluwatosin O. Alabi
{"title":"Towards the development of hierarchical data motion power cost models","authors":"T. Mintz, Oluwatosin O. Alabi","doi":"10.1145/2834800.2834804","DOIUrl":null,"url":null,"abstract":"Data intensive applications comprise a considerable portion of HPC center workloads. Whether large amounts of data transfer occur before, during or after an application is executed, this cost must be considered. Not just in terms of performance (e.g. time to completion), but also in terms of power consumed to complete these necessary tasks. At the system level, scheduling and resource management tools are capable of recording performance metrics and other constraints, and making performance aware decisions. These tools are a natural choice for making power aware decisions, as well. More specifically, power aware decisions about data transfer costs for the entire application workflow. This research focuses on developing data motion power cost models and integrating these models into a task scheduler framework to enable complete power aware scheduling of an entire HPC workflow. We have taken an incremental approach to developing a hierarchical, system wide power model for data motion that starts with core data motion and will eventually encompass data motion across facilities. In this paper, we discuss our current research which addresses multicore data motion and data motion between nodes.","PeriodicalId":285336,"journal":{"name":"International Workshop on Energy Efficient Supercomputing","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Energy Efficient Supercomputing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2834800.2834804","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Data intensive applications comprise a considerable portion of HPC center workloads. Whether large amounts of data transfer occur before, during or after an application is executed, this cost must be considered. Not just in terms of performance (e.g. time to completion), but also in terms of power consumed to complete these necessary tasks. At the system level, scheduling and resource management tools are capable of recording performance metrics and other constraints, and making performance aware decisions. These tools are a natural choice for making power aware decisions, as well. More specifically, power aware decisions about data transfer costs for the entire application workflow. This research focuses on developing data motion power cost models and integrating these models into a task scheduler framework to enable complete power aware scheduling of an entire HPC workflow. We have taken an incremental approach to developing a hierarchical, system wide power model for data motion that starts with core data motion and will eventually encompass data motion across facilities. In this paper, we discuss our current research which addresses multicore data motion and data motion between nodes.
面向分层数据运动功耗模型的发展
数据密集型应用程序占HPC中心工作负载的很大一部分。无论在执行应用程序之前、期间还是之后发生大量数据传输,都必须考虑此成本。不仅在性能方面(如完成时间),而且在完成这些必要任务所消耗的功率方面。在系统级别,调度和资源管理工具能够记录性能指标和其他约束,并做出性能敏感的决策。这些工具也是做出权力意识决策的自然选择。更具体地说,是关于整个应用程序工作流的数据传输成本的功耗感知决策。本研究的重点是开发数据运动功耗成本模型,并将这些模型集成到任务调度器框架中,以实现整个HPC工作流的完整功耗感知调度。我们采取了一种渐进的方法,为数据移动开发一个分层的、系统范围的功率模型,该模型从核心数据移动开始,最终将包括跨设施的数据移动。本文讨论了目前在多核数据移动和节点间数据移动方面的研究进展。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信