JCOGIN: a programming framework for particle transport on combinatorial geometry

• Published in: The Journal of supercomputing Vol. 77; no. 10; pp. 11270 - 11287
• Main Authors: Zhang, Baoyin, Mo, Zeyao, Wang, Xin, Wang, Wei, Li, Gang, Zhang, Aiqing, Cao, Xiaolin
• Format: Journal Article
• Language: English
• Published: New York Springer US 01-10-2021; Springer Nature B.V
• Subjects: Application programming interface; Combinatorial analysis; Compilers; Computer Science; Computing time; Domain decomposition methods; Geometry; Interpreters; Mathematical models; Parallel programming; Processor Architectures; Programming Languages; Supercomputers; Particle transport; Combinatorial geometry; Multilevel hybrid parallelism; Monte Carlo; Programming framework
• ISSN: 0920-8542; 1573-0484
• DOI: 10.1007/s11227-021-03711-w

Domain-specific programming frameworks are usually effective to simplify the development of large-scale applications on supercomputers. This paper introduces a parallel programming framework named JCOGIN for particle transport on combinatorial geometry. JCOGIN provides a combinatorial geometry data model and a patch-based parallel computing model to manage the data distribution in parallel computing and implements the hybrid parallelism of the domain decomposition and the particle parallelism on MPI/OpenMP to overcome the bottleneck of huge memory demand and long computational time. The application programming interface of JCOGIN can support users to quickly develop their parallel particle transport applications. Based on this framework,
users only need to write serial codes for large-scale numerical simulations on modern supercomputers
. The parallel efficiency of applications based on JCOGIN can reach up to 80% on hundreds of thousands of CPU cores.