{"title":"Parallel and bias-free RSA algorithm for maximal Poisson-sphere sampling","authors":"Marc Josien, Raphaël Prat","doi":"10.1016/j.cpc.2024.109354","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper we propose and benchmark an innovative implementation of the Random Sequential Addition (or adsorption) (<span>Rsa</span>) algorithm. It provides <span>Mpi</span> parallelization and is designed to generate a high number of spheres aiming for maximal compactness, without introducing any bias. Although parallelization of such an algorithm has been successfully undertaken with shared memory (and in particular with <span>Gpu</span>), this is seemingly the first available implementation with distributed memory (<span>Mpi</span>). Our implementation successfully generated more than 12 billions of spheres over 131,072 <span>Mpi</span> processes in 16 seconds in dimension <span><math><mi>d</mi><mo>=</mo><mn>3</mn></math></span>.</p></div>","PeriodicalId":285,"journal":{"name":"Computer Physics Communications","volume":"305 ","pages":"Article 109354"},"PeriodicalIF":7.2000,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Physics Communications","FirstCategoryId":"101","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0010465524002777","RegionNum":2,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper we propose and benchmark an innovative implementation of the Random Sequential Addition (or adsorption) (Rsa) algorithm. It provides Mpi parallelization and is designed to generate a high number of spheres aiming for maximal compactness, without introducing any bias. Although parallelization of such an algorithm has been successfully undertaken with shared memory (and in particular with Gpu), this is seemingly the first available implementation with distributed memory (Mpi). Our implementation successfully generated more than 12 billions of spheres over 131,072 Mpi processes in 16 seconds in dimension .
期刊介绍：
The focus of CPC is on contemporary computational methods and techniques and their implementation, the effectiveness of which will normally be evidenced by the author(s) within the context of a substantive problem in physics. Within this setting CPC publishes two types of paper.
Computer Programs in Physics (CPiP)
These papers describe significant computer programs to be archived in the CPC Program Library which is held in the Mendeley Data repository. The submitted software must be covered by an approved open source licence. Papers and associated computer programs that address a problem of contemporary interest in physics that cannot be solved by current software are particularly encouraged.
Computational Physics Papers (CP)
These are research papers in, but are not limited to, the following themes across computational physics and related disciplines.
mathematical and numerical methods and algorithms;
computational models including those associated with the design, control and analysis of experiments; and
algebraic computation.
Each will normally include software implementation and performance details. The software implementation should, ideally, be available via GitHub, Zenodo or an institutional repository.In addition, research papers on the impact of advanced computer architecture and special purpose computers on computing in the physical sciences and software topics related to, and of importance in, the physical sciences may be considered.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
