SearcharxivSearch

arXiv subjects

Jason Burmark

Publications and source records attributed to Jason Burmark.

2 recordsLinked to original sources

Tensor Train Representation of High-Dimensional Unsteady Flamelet Manifolds

This study, for the first time, investigates the use of tensor trains (TTs) to represent high-dimensional unsteady flamelet progress variable (UFPV) manifolds in chemically reacting computational fluid dynamics (CFD). The UFPV framework captures the thermochemical state of reacting flows using a reduced set of parameters and pre-computed manifolds, avoiding the need to transport all species or solve large stiff reaction systems. High-dimensional manifolds enhance accuracy by resolving coupled thermochemical effects critical in high-speed reacting flows but impose substantial memory demands. Here, a five-dimensional UFPV manifold is constructed and stored in the TT format to address this limitation. Several chemical mechanisms and table sizes are examined to evaluate TT compression performance and accuracy. The TT representation achieves significant memory reduction while preserving manifold fidelity and combustion behavior. A one-dimensional reacting-flow case using the discontinuous Galerkin (DG)-based JENRE Multiphysics Framework confirms that TT-compressed manifolds are interchangeable with standard UFPV tables. In addition to memory reduction, benchmark tests show that TT-based manifold sampling can achieve up to 2.4X speedup relative to dense tensor evaluation. Although demonstrated for UFPV combustion models, the proposed TT framework is broadly applicable to other tabulation-based combustion methodologies and provides a scalable alternative to machine learning (ML)-based approaches for representing high-dimensional combustion manifolds.

physics.comp-ph

Persistent and Partitioned MPI for Stencil Communication

Many parallel applications rely on iterative stencil operations, whose performance are dominated by communication costs at large scales. Several MPI optimizations, such as persistent and partitioned communication, reduce overheads and improve communication efficiency through amortized setup costs and reduced synchronization of threaded sends. This paper presents the performance of stencil communication in the Comb benchmarking suite when using non blocking, persistent, and partitioned communication routines. The impact of each optimization is analyzed at various scales. Further, the paper presents an analysis of the impact of process count, thread count, and message size on partitioned communication routines. Measured timings show that persistent MPI communication can provide a speedup of up to 37% over the baseline MPI communication, and partitioned MPI communication can provide a speedup of up to 68%.

cs.DC