Parallel Computing最新文献_第5页

A flexible sparse matrix data format and parallel algorithms for the assembly of finite element matrices on shared memory systems 一种灵活的稀疏矩阵数据格式及其在共享存储系统上有限元矩阵装配的并行算法

IF 1.4 4区计算机科学

Parallel Computing Pub Date : 2023-09-01 DOI: 10.1016/j.parco.2023.103039

Adam Sky , César Polindara , Ingo Muench , Carolin Birk

引用次数: 0

New YARN sharing GPU based on graphics memory granularity scheduling 基于图形内存粒度调度的新型YARN共享GPU

IF 1.4 4区计算机科学

Parallel Computing Pub Date : 2023-09-01 DOI: 10.1016/j.parco.2023.103038

Jinliang Shi , Dewu Chen , Jiabi Liang , Lin Li , Yue Lin , Jianjiang Li

{"title":"New YARN sharing GPU based on graphics memory granularity scheduling","authors":"Jinliang Shi , Dewu Chen , Jiabi Liang , Lin Li , Yue Lin , Jianjiang Li","doi":"10.1016/j.parco.2023.103038","DOIUrl":"https://doi.org/10.1016/j.parco.2023.103038","url":null,"abstract":"<div><p>As one of the most widely used cluster scheduling frameworks, Hadoop<span> YARN only supported CPU and memory scheduling in the past. Furthermore, due to the widespread use of AI<span>, the demand for GPU<span> is also increasing. So Hadoop YARN V3.0 adds GPU scheduling, but the granularity<span> is on the whole card yet, rather than finer-grained graphics memory scheduling. However, during daily training, although the graphics memory required by tasks may be much smaller than the whole GPU card, they will occupy the whole card, which results in wasted resources. To address this issue, Tensorflow provides the API for graphics memory control. Therefore, we propose to introduce this feature into Hadoop YARN so that it can support the heterogeneous scheduling: CPU, memory and graphics memory. Then we take HadoopV2.7 source code as the underlying architecture and design a new scheduler GSHARE. Compared with previous scheduling strategies, with 3 nodes, 3 GPU cards per node, and 12G graphics memory per card, GSHARE improves efficiency by up to 74% for Tensorflow tasks with 2G of graphics memory. Meanwhile, it minimizes the problem of wasted graphics memory caused by the inability to control graphics memory proportionally by the API of Tensorflow for multiple-card.</span></span></span></span></p></div>","PeriodicalId":54642,"journal":{"name":"Parallel Computing","volume":"117 ","pages":"Article 103038"},"PeriodicalIF":1.4,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49877862","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Using heterogeneous GPU nodes with a Cabana-based implementation of MPCD 使用异构GPU节点和基于cabana的MPCD实现

IF 1.4 4区计算机科学

Parallel Computing Pub Date : 2023-09-01 DOI: 10.1016/j.parco.2023.103033

Rene Halver , Christoph Junghans , Godehard Sutmann

引用次数: 1

Editorial on Advances in High Performance Programming 关于高性能编程进展的社论

IF 1.4 4区计算机科学

Parallel Computing Pub Date : 2023-09-01 DOI: 10.1016/j.parco.2023.103037

Ami Marowka , Przemysław Stpiczyński

引用次数: 0

Adaptively parallel runtime verification based on distributed network for temporal properties 基于分布式网络的时间属性自适应并行运行时验证

IF 1.4 4区计算机科学

Parallel Computing Pub Date : 2023-09-01 DOI: 10.1016/j.parco.2023.103034

Bin Yu , Xu Lu , Cong Tian , Meng Wang , Chu Chen , Ming Lei , Zhenhua Duan

引用次数: 0

Using heterogeneous GPU nodes with a Cabana-based implementation of MPCD 使用异构GPU节点和基于cabana的MPCD实现

IF 1.4 4区计算机科学

Parallel Computing Pub Date : 2023-09-01 DOI: 10.1016/j.parco.2023.103033

R. Halver, Christoph Junghans, G. Sutmann

引用次数: 0

Big data BPMN workflow resource optimization in the cloud 云中的大数据BPMN工作流资源优化

IF 1.4 4区计算机科学

Parallel Computing Pub Date : 2023-09-01 DOI: 10.1016/j.parco.2023.103025

Srđan Daniel Simić, Nikola Tanković, Darko Etinger

{"title":"Big data BPMN workflow resource optimization in the cloud","authors":"Srđan Daniel Simić, Nikola Tanković, Darko Etinger","doi":"10.1016/j.parco.2023.103025","DOIUrl":"https://doi.org/10.1016/j.parco.2023.103025","url":null,"abstract":"<div><p>Cloud computing is one of the critical technologies that meet the demand of various businesses for the high-capacity computational processing power needed to gain knowledge from their ever-growing business data. When utilizing cloud computing resources to deal with Big Data processing, companies face the challenge of determining the optimal use of resources within their business processes. The miscalculation of the necessary resources directly affects their budget and can cause delays in the cycle time of their key processes. This study investigates the simulation of cloud resource optimization for Big Data workflows modeled with the Business Process Modeling Notation (BPMN). To this end, a BPMN performance evaluation framework was developed. The framework’s capabilities were presented using real-world data science workflow and later evaluated on workflows consisting of 13, 52, and 104 tasks. The results show that the developed framework is adequate for estimating the overall run-time distribution and optimizing the cloud resource deployment and that the BPMN can be utilized for Big Data processing workflows. Therefore, this study contributes to BPMN practitioners by providing a tool to apply BPMN for their Big Data workflows and decision-makers by giving them critical insights into their key business processes. The framework source code is available at <span>https://github.com/ntankovic/python-bpmn-engine</span><svg><path></path></svg>.</p></div>","PeriodicalId":54642,"journal":{"name":"Parallel Computing","volume":"117 ","pages":"Article 103025"},"PeriodicalIF":1.4,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49877447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

ESA: An efficient sequence alignment algorithm for biological database search on Sunway TaihuLight ESA:一种用于神威太湖之光生物数据库检索的高效序列比对算法

IF 1.4 4区计算机科学

Parallel Computing Pub Date : 2023-08-01 DOI: 10.1016/j.parco.2023.103043

H. Zhang, Zhiyi Huang, Yawen Chen, Jianguo Liang, Xiran Gao

引用次数: 0

Finding inputs that trigger floating-point exceptions in heterogeneous computing via Bayesian optimization 通过贝叶斯优化查找异构计算中触发浮点异常的输入

IF 1.4 4区计算机科学

Parallel Computing Pub Date : 2023-08-01 DOI: 10.1016/j.parco.2023.103042

I. Laguna, Anh Tran, G. Gopalakrishnan

引用次数: 0

A flexible sparse matrix data format and parallel algorithms for the assembly of finite element matrices on shared memory systems 一种灵活的稀疏矩阵数据格式及其在共享存储系统上有限元矩阵装配的并行算法