Topology-Aware Strategy for MPI-IO Operations in Clusters

IF 1 Q3 ENGINEERING, MULTIDISCIPLINARY Journal of Optimization Pub Date : 2018-11-19 DOI:10.1155/2018/2068490
Weifeng Liu, Jie Zhou, Meng Guo
{"title":"Topology-Aware Strategy for MPI-IO Operations in Clusters","authors":"Weifeng Liu, Jie Zhou, Meng Guo","doi":"10.1155/2018/2068490","DOIUrl":null,"url":null,"abstract":"This paper presents the topology-aware two-phase I/O (TATP), which optimizes the most popular collective MPI-IO implementation of ROMIO. In order to improve the hop-bytes metric during the file access, topology-aware two-phase I/O employs the Linear Assignment Problem (LAP) for finding an optimal assignment of file domain to aggregators, an aspect which is not considered in most two-phase I/O implementations. The distribution is based on the local data stored by each process, and its main purpose is to reduce the total hop-bytes of the I/O collective operation. Therefore, the global execution time can be improved. In most of the considered scenarios, topology-aware two-phase I/O obtains important improvements when compared with the original two-phase I/O implementations.","PeriodicalId":42964,"journal":{"name":"Journal of Optimization","volume":"5 1","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2018-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2018/2068490","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 4

Abstract

This paper presents the topology-aware two-phase I/O (TATP), which optimizes the most popular collective MPI-IO implementation of ROMIO. In order to improve the hop-bytes metric during the file access, topology-aware two-phase I/O employs the Linear Assignment Problem (LAP) for finding an optimal assignment of file domain to aggregators, an aspect which is not considered in most two-phase I/O implementations. The distribution is based on the local data stored by each process, and its main purpose is to reduce the total hop-bytes of the I/O collective operation. Therefore, the global execution time can be improved. In most of the considered scenarios, topology-aware two-phase I/O obtains important improvements when compared with the original two-phase I/O implementations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
集群中MPI-IO操作的拓扑感知策略
本文提出了拓扑感知的两阶段I/O (TATP),它优化了最流行的ROMIO集体MPI-IO实现。为了改善文件访问期间的跳字节度量,拓扑感知两阶段I/O采用线性分配问题(LAP)来寻找文件域到聚合器的最佳分配,这是大多数两阶段I/O实现中没有考虑的一个方面。该分布基于每个进程存储的本地数据,其主要目的是减少I/O集体操作的总跳字节数。因此,可以提高全局执行时间。在大多数考虑的场景中,与最初的两阶段I/O实现相比,拓扑感知的两阶段I/O获得了重要的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Optimization
Journal of Optimization ENGINEERING, MULTIDISCIPLINARY-
自引率
0.00%
发文量
4
期刊最新文献
A Systematic Review of Linear Programming Techniques as Applied to Diet Optimisation and Opportunities for Improvement Optimization of Deformation Behaviors during Continuous Forming Extrusion of C18150 Copper Alloy through Response Surface Methodology Performance Optimization of Chemical and Green Coagulants in Tannery Wastewater Treatment: A Response Surface Methodology Approach An Optimization Model for the Student-to-Project Supervisor Assignment Problem-The Case of an Engineering Department Optimal Control Analysis of Treatment Strategies of the Dynamics of Cholera
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1