Productivity and performance through components: the ASCI Sweep3D application

Yoon, Young; Browne, James C.; Crocker, Mathew; Jain, Samit; Mahmood, Nasim

doi:10.1002/cpe.1149

Cited by 9 publications

(2 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…BT (block tridiagonal), CG (conjugate gradient), MG (multi-grid), SP (scalar pentadiagonal), and IS (integer sorting) are kernels or from the NAS Parallel proxy-app (NPB) [4]. SWEEP3D [40] addresses the neutron transport problem in discrete coordinate 3D Cartesian geometry. FLASH [12] is a production software package for handling general compressible flow problems found in many plasma physics experiments and astrophysical environments.…”

Section: Setupmentioning

confidence: 99%

Synthesizing Proxy Applications for MPI Programs

Yan¹,

Xu²,

Luo³

et al. 2023

Preprint

View full text Add to dashboard Cite

Proxy applications (proxy-apps) are fundamental tools for evaluating the performance of specific workloads on high-performance computing (HPC) systems. Since the development of high-fidelity proxy-apps, which exhibit similar performance characteristics as corresponding production applications, is labor-intensive, synthetic proxy-apps are created as a useful supplement to manually-developed proxy-apps. Existing proxyapp synthesis methods for HPC applications mainly focus on either communications patterns or computation kernels. To thoroughly resemble performance characteristics of HPC applications represented by Message Passing Interface (MPI) programs, we propose Siesta, a novel framework to automatically synthesize proxyapps based on communication-computation traces. Given an MPI program, Siesta synthesizes parameterized code proxies to mimic computation behaviors in different execution periods, and combines the code snippets and MPI function records into an event trace. It then extracts program behavior patterns from the trace using context-free grammars, and finally transforms the grammars into executable code as a synthetic proxy-app of the given MPI program. We evaluate the proposed methods on representative MPI programs with different parallel scales. The results show that our synthetic proxy-apps can precisely approximate the performance characteristics of MPI programs.

show abstract

Section: Setupmentioning

confidence: 99%

Synthesizing Proxy Applications for MPI Programs

Yan¹,

Xu²,

Luo³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Sweep3D [8] is a 3D Cartesian geometry neutron transport code benchmark from the DOE's Accelerated Strategic Computing Initiative. As a procurement benchmark, this code has been extensively studied and tuned already [7], [10], [18], [20], [22]. The Gyrokinetic Toroidal Code (GTC) [11] is a particle-in-cell code that simulates turbulent transport of particles and energy.…”

Section: Case Studiesmentioning

confidence: 99%

Pinpointing and Exploiting Opportunities for Enhancing Data Reuse

Marin

Mellor-Crummey

2008

ISPASS 2008 - IEEE International Symposium on Performance Analysis of Systems and Software

View full text Add to dashboard Cite

Abstract-The potential for improving the performance of data-intensive scientific programs by enhancing data reuse in cache is substantial because CPUs are significantly faster than memory. Traditional performance tools typically collect or simulate cache miss counts or rates and attribute them at the function level. While such information identifies program scopes that exhibit a large cache miss rate, it is often insufficient to diagnose the causes for poor data locality and to identify what program transformations would improve memory hierarchy utilization. This paper describes an approach that uses memory reuse distance to identify an application's most significant memory access patterns causing cache misses and provide insight into ways of improving data reuse. Unlike previous approaches, our tool combines (1) analysis and instrumentation of fully optimized binaries, (2) online analysis of reuse patterns, (3) fine-grain attribution of measurements and models to statements, loops and variables, and (4) static analysis of access patterns to quantify spatial reuse. We demonstrate the effectiveness of our approach for understanding reuse patterns in two scientific codes: one for simulating neutron transport and a second for simulating turbulent transport in burning plasmas. Our tools pinpointed opportunities for enhancing data reuse. Using this feedback as a guide, we transformed the codes, reducing their misses at various levels of the memory hierarchy by integer factors and reducing their execution time by as much as 60% and 33%, respectively.

show abstract