Accelerating Conjugate Gradient using OmpSs

Sandra Catalán, X. Martorell, Jesús Labarta, Tetsuzo Usui, Leonel Antonio Toledo Díaz, Pedro Valero-Lara
{"title":"Accelerating Conjugate Gradient using OmpSs","authors":"Sandra Catalán, X. Martorell, Jesús Labarta, Tetsuzo Usui, Leonel Antonio Toledo Díaz, Pedro Valero-Lara","doi":"10.1109/PDCAT46702.2019.00033","DOIUrl":null,"url":null,"abstract":"In this paper, we present the benefits of using the clause concurrent of OmpSs when performing reductions, more specifically, when applied to the dot product (DOT) operations. We analyze its benefits through the implementation of different versions of the Conjugate Gradient (CG) method. We start from a parallel version of the code based on tasks and dependencies; later, we introduce the use of the concurrent clause, which allows to overlap the execution of tasks that have data dependencies among them. In this way, we want to show the benefits of the concurrent clause, which might be included in OpenMP standard as previously done with other OmpSs features. Our tests, performed on a single node of the (Intel-based) Marenostrum 4 Supercomputer and a single socket of the (ARM-based) Dibona cluster, show that the use of the concurrent clause may improve performance with respect to the version where only tasks and dependencies are used around 37% and 23% respectively.","PeriodicalId":166126,"journal":{"name":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","volume":"56 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 20th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDCAT46702.2019.00033","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

In this paper, we present the benefits of using the clause concurrent of OmpSs when performing reductions, more specifically, when applied to the dot product (DOT) operations. We analyze its benefits through the implementation of different versions of the Conjugate Gradient (CG) method. We start from a parallel version of the code based on tasks and dependencies; later, we introduce the use of the concurrent clause, which allows to overlap the execution of tasks that have data dependencies among them. In this way, we want to show the benefits of the concurrent clause, which might be included in OpenMP standard as previously done with other OmpSs features. Our tests, performed on a single node of the (Intel-based) Marenostrum 4 Supercomputer and a single socket of the (ARM-based) Dibona cluster, show that the use of the concurrent clause may improve performance with respect to the version where only tasks and dependencies are used around 37% and 23% respectively.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用omps加速共轭梯度
在本文中,我们介绍了在执行缩减时,更具体地说,在应用于点积(dot)操作时,使用omps的并发子句的好处。我们通过不同版本的共轭梯度(CG)方法的实现来分析它的优点。我们从基于任务和依赖关系的代码并行版本开始;稍后,我们将介绍concurrent子句的使用,它允许在具有数据依赖性的任务之间重叠执行。通过这种方式,我们希望展示并发子句的好处,它可能包含在OpenMP标准中,就像以前使用其他omps特性一样。我们在(基于intel的)Marenostrum 4超级计算机的单个节点和(基于arm的)Dibona集群的单个套接字上进行的测试表明,相对于只使用任务和依赖项的版本,使用并发子句可以分别提高37%和23%的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
RNC: Reliable Network Property Classifier Based on Graph Embedding NFV Optimization Algorithm for Shortest Path and Service Function Assignment I/O Scheduling for Limited-Size Burst-Buffers Deployed High Performance Computing Efficient Fault-Tolerant Syndrome Measurement of Quantum Error-Correcting Codes Based on "Flag" Adaptive Clustering Strategy Based on Capacity Weight
×
引用
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