Exploiting the Extensibility of the FLASH Code Architecture for Unsplit Time Integration

Statistics – Computation

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

FLASH is a component-based massively parallel multiphysics simulation code with a wide user base. The time integration in FLASH was originally designed using Strang operator splitting for hydrodynamics. In version 3 of the FLASH release, we added an Unsplit Staggered Mesh Magnetohydrodynamics (USM-MHD) solver based on the constrained transport method of Lee and Deane. This method tested and exercised the modularity and extensibility of the FLASH code architecture, with abstraction of time integration and solution mesh from solvers being the focus. In this paper we present the relevant architectural details of the FLASH code that facilitated the incorporation of unsplit time integration into a primarily directionally split framework. Additionally, we discuss the challenges posed by adaptive mesh refinement to the USM-MHD solver and their solutions. Finally we present analysis of the relative computational performance split versus unsplit methods, and also the weak scaling performance of the unsplit USM-MHD solver in a parallel environment.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Exploiting the Extensibility of the FLASH Code Architecture for Unsplit Time Integration does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Exploiting the Extensibility of the FLASH Code Architecture for Unsplit Time Integration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Exploiting the Extensibility of the FLASH Code Architecture for Unsplit Time Integration will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-773544

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.