Parallel Computing最新文献

筛选
英文 中文
Editorial on Advances in High Performance Programming 关于高性能编程进展的社论
IF 1.4 4区 计算机科学
Parallel Computing Pub Date : 2023-09-01 Epub Date: 2023-07-14 DOI: 10.1016/j.parco.2023.103037
Ami Marowka , Przemysław Stpiczyński
{"title":"Editorial on Advances in High Performance Programming","authors":"Ami Marowka , Przemysław Stpiczyński","doi":"10.1016/j.parco.2023.103037","DOIUrl":"https://doi.org/10.1016/j.parco.2023.103037","url":null,"abstract":"","PeriodicalId":54642,"journal":{"name":"Parallel Computing","volume":"117 ","pages":"Article 103037"},"PeriodicalIF":1.4,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49877858","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
Adaptively parallel runtime verification based on distributed network for temporal properties 基于分布式网络的时间属性自适应并行运行时验证
IF 1.4 4区 计算机科学
Parallel Computing Pub Date : 2023-09-01 Epub Date: 2023-06-14 DOI: 10.1016/j.parco.2023.103034
Bin Yu , Xu Lu , Cong Tian , Meng Wang , Chu Chen , Ming Lei , Zhenhua Duan
{"title":"Adaptively parallel runtime verification based on distributed network for temporal properties","authors":"Bin Yu ,&nbsp;Xu Lu ,&nbsp;Cong Tian ,&nbsp;Meng Wang ,&nbsp;Chu Chen ,&nbsp;Ming Lei ,&nbsp;Zhenhua Duan","doi":"10.1016/j.parco.2023.103034","DOIUrl":"https://doi.org/10.1016/j.parco.2023.103034","url":null,"abstract":"<div><p>Runtime verification<span><span> is a lightweight verification technique that verifies whether a monitored program execution satisfies a desired property. Online runtime verification faces challenges regarding efficiency and property expressiveness, which limit its widespread adoption. However, there is a lack of research that addresses both of these issues. With the basis of a distributed network, we propose an adaptively parallel approach to verify full regular temporal properties of C programs in an online manner. During program execution, segments of the generated state sequence are verified by distributed machines concurrently, while each segment is also verified in each multi-core machine with an adaptive number of </span>threads. Experimental results demonstrate that, with supporting more expressive properties, our approach has a speedup of 2.5X–5.0X compared with other runtime verification approaches.</span></p></div>","PeriodicalId":54642,"journal":{"name":"Parallel Computing","volume":"117 ","pages":"Article 103034"},"PeriodicalIF":1.4,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49877448","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
R. Halver, Christoph Junghans, G. Sutmann
{"title":"Using heterogeneous GPU nodes with a Cabana-based implementation of MPCD","authors":"R. Halver, Christoph Junghans, G. Sutmann","doi":"10.1016/j.parco.2023.103033","DOIUrl":"https://doi.org/10.1016/j.parco.2023.103033","url":null,"abstract":"","PeriodicalId":54642,"journal":{"name":"Parallel Computing","volume":"117 1","pages":"103033"},"PeriodicalIF":1.4,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"55107193","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
Big data BPMN workflow resource optimization in the cloud 云中的大数据BPMN工作流资源优化
IF 1.4 4区 计算机科学
Parallel Computing Pub Date : 2023-09-01 Epub Date: 2023-06-02 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ć,&nbsp;Nikola Tanković,&nbsp;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
{"title":"ESA: An efficient sequence alignment algorithm for biological database search on Sunway TaihuLight","authors":"H. Zhang, Zhiyi Huang, Yawen Chen, Jianguo Liang, Xiran Gao","doi":"10.1016/j.parco.2023.103043","DOIUrl":"https://doi.org/10.1016/j.parco.2023.103043","url":null,"abstract":"","PeriodicalId":54642,"journal":{"name":"Parallel Computing","volume":"117 1","pages":"103043"},"PeriodicalIF":1.4,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"55107483","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
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
{"title":"Finding inputs that trigger floating-point exceptions in heterogeneous computing via Bayesian optimization","authors":"I. Laguna, Anh Tran, G. Gopalakrishnan","doi":"10.1016/j.parco.2023.103042","DOIUrl":"https://doi.org/10.1016/j.parco.2023.103042","url":null,"abstract":"","PeriodicalId":54642,"journal":{"name":"Parallel Computing","volume":"62 1","pages":"103042"},"PeriodicalIF":1.4,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"55107870","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
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-07-01 DOI: 10.1016/j.parco.2023.103039
A. Sky, César Polindara, I. Muench, C. Birk
{"title":"A flexible sparse matrix data format and parallel algorithms for the assembly of finite element matrices on shared memory systems","authors":"A. Sky, César Polindara, I. Muench, C. Birk","doi":"10.1016/j.parco.2023.103039","DOIUrl":"https://doi.org/10.1016/j.parco.2023.103039","url":null,"abstract":"","PeriodicalId":54642,"journal":{"name":"Parallel Computing","volume":"117 1","pages":"103039"},"PeriodicalIF":1.4,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"55107767","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
Characterizing the performance of node-aware strategies for irregular point-to-point communication on heterogeneous architectures 异构体系结构中不规则点对点通信节点感知策略的性能表征
IF 1.4 4区 计算机科学
Parallel Computing Pub Date : 2023-07-01 Epub Date: 2023-04-14 DOI: 10.1016/j.parco.2023.103021
Shelby Lockhart , Amanda Bienz , William D. Gropp , Luke N. Olson
{"title":"Characterizing the performance of node-aware strategies for irregular point-to-point communication on heterogeneous architectures","authors":"Shelby Lockhart ,&nbsp;Amanda Bienz ,&nbsp;William D. Gropp ,&nbsp;Luke N. Olson","doi":"10.1016/j.parco.2023.103021","DOIUrl":"https://doi.org/10.1016/j.parco.2023.103021","url":null,"abstract":"<div><p>Supercomputer architectures are trending toward higher computational throughput due to the inclusion of heterogeneous compute nodes. These multi-GPU nodes increase on-node computational efficiency, while also increasing the amount of data to be communicated and the number of potential data flow paths. In this work, we characterize the performance of irregular point-to-point communication with MPI on heterogeneous compute environments through performance modeling, demonstrating the limitations of standard communication strategies for both device-aware and staging-through-host communication techniques. Presented models suggest staging communicated data through host processes then using node-aware communication strategies for high inter-node message counts. Notably, the models also predict that node-aware communication utilizing all available CPU cores to communicate inter-node data leads to the most performant strategy when communicating with a high number of nodes. Model validation is provided via a case study of irregular point-to-point communication patterns in distributed sparse matrix–vector products. Importantly, we include a discussion on the implications model predictions have on communication strategy design for emerging supercomputer architectures.</p></div>","PeriodicalId":54642,"journal":{"name":"Parallel Computing","volume":"116 ","pages":"Article 103021"},"PeriodicalIF":1.4,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49728377","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
Efficient checkpoint/Restart of CUDA applications 有效的检查点/重新启动CUDA应用程序
IF 1.4 4区 计算机科学
Parallel Computing Pub Date : 2023-07-01 Epub Date: 2023-03-09 DOI: 10.1016/j.parco.2023.103018
Akira Nukada , Taichiro Suzuki , Satoshi Matsuoka
{"title":"Efficient checkpoint/Restart of CUDA applications","authors":"Akira Nukada ,&nbsp;Taichiro Suzuki ,&nbsp;Satoshi Matsuoka","doi":"10.1016/j.parco.2023.103018","DOIUrl":"https://doi.org/10.1016/j.parco.2023.103018","url":null,"abstract":"<div><p>We present NVCR<span> which enables transparent checkpoint and restart of CUDA applications. NVCR, works as an extension of major system-level checkpoint software such as BLCR and DMTCP, employs proxy-process and application accesses GPU devices via the proxy-process to improve the compatibility with latest CUDA runtime software. To reduce the overhead of inter-process communications, NVCR efficiently uses SYSV IPC shared memory as CUDA pinned memory. Performance evaluations using micro benchmarks and Amber as a real application show that NVCR’ overhead is acceptably low.</span></p></div>","PeriodicalId":54642,"journal":{"name":"Parallel Computing","volume":"116 ","pages":"Article 103018"},"PeriodicalIF":1.4,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49728437","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
NPDP benchmark suite for the evaluation of the effectiveness of automatic optimizing compilers NPDP基准套件,用于评估自动优化编译器的有效性
IF 1.4 4区 计算机科学
Parallel Computing Pub Date : 2023-07-01 Epub Date: 2023-02-23 DOI: 10.1016/j.parco.2023.103016
Marek Palkowski, Wlodzimierz Bielecki
{"title":"NPDP benchmark suite for the evaluation of the effectiveness of automatic optimizing compilers","authors":"Marek Palkowski,&nbsp;Wlodzimierz Bielecki","doi":"10.1016/j.parco.2023.103016","DOIUrl":"https://doi.org/10.1016/j.parco.2023.103016","url":null,"abstract":"<div><p><span>The paper presents a benchmark suite of ten non-serial polyadic dynamic programming<span> (NPDP) kernels, which are designed to test the efficiency of tiled code generated by polyhedral optimization compilers. These kernels are mainly derived from bioinformatics algorithms, which pose a significant challenge for automatic loop nest tiling transformations. The paper describes algorithms implemented with examined kernels and unifies them in the form of loop nests presented in the C language. The purpose is to reconsider the execution and monitoring of codes, typically used in past and current publications. For carrying out experiments with introduced benchmarks, we applied the two source-to-source compilers, PLuTo and TRACO, to generate cache-efficient codes and analyzed their performance on four multi-core machines. We discuss the limitations of well-known tiling approaches and outline future tiling strategies to generate effective tiled code by means of </span></span>optimizing compilers for introduced benchmarks.</p></div>","PeriodicalId":54642,"journal":{"name":"Parallel Computing","volume":"116 ","pages":"Article 103016"},"PeriodicalIF":1.4,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49728698","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}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书