An improved parallelism scheme for deterministic discrete ordinates transport. (July 2018)

• Record Type: Journal Article
• Authors: Deakin, Tom; McIntosh-Smith, Simon; Martineau, Matt; Gaudin, Wayne
• Other Names: Wyrzykowski Roman guest-editor.; Deelman Ewa guest-editor.; Scogland Tom guest-editor.; Beckingsale David guest-editor.
• Is Part Of: International journal of high performance computing applications. Volume 32:Number 4(2018)
• Page Start: 555
• Page End: 569
• Publication Date: 2018-07
• Subjects: High performance computing -- Periodicals; Supercomputers -- Periodicals; 004.1105
• DOI: 10.1177/1094342016668978
• Languages: English
• ISSNs: 1094-3420

Abstract

In this paper we demonstrate techniques for increasing the node-level parallelism of a deterministic discrete ordinates neutral particle transport algorithm on a structured mesh to exploit many-core technologies. Transport calculations form a large part of the computational workload of physical simulations and so good performance is vital for the simulations to complete in reasonable time. We will demonstrate our approach utilizing the SNAP mini-app, which gives a simplified implementation of the full transport algorithm but remains similar enough to the real algorithm to act as a useful proxy for research purposes. We present an OpenCL implementation of our improved algorithm which achieves a speedup of up to 2.5 × on a many-core GPGPU device compared to a state-of-the-art multi-core node for the transport sweep, and up to 4 × compared to the multi-core CPUs in the largest GPU enabled supercomputer; the first time this scale of speedup has been achieved for algorithms of this class. We then discuss ways to express our scheme in OpenMP 4.0 and demonstrate the performance on an Intel Knights Corner Xeon Phi compared to the original scheme.