Search NASA⌕ Search

SEARCH · Search NASA

Results for “grid code”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,243 records · Page 69

Spectral Spherical Harmonics Discrete Ordinate Method

A new method for modeling the radiative transfer in inhomogeneous three-dimensional media illuminated by a Gaussian beam is described. This approach, called the Spectral Spherical Harmonics Discrete Ordinate Method (SSHDOM), uses the Fourier expansion method to transform the three-dimensional radiative transfer into an one-dimensional equation in the spectral domain, and the Spherical Harmonics Discrete Ordinate Method (SHDOM) for its solution. Specifically, (i) the source function is represented in the spectral domain through a spherical harmonic expansion, (ii) the spectral one-dimensional radiative transfer equation is integrated along discrete ordinates through a spatial grid, and (iii) the solution method is based on the Picard iteration. Both SSHDOM and SHDOM algorithms are implemented in a common computer code.

Gaussian beam↗

Recent Progress on Rans-Based Transition Model Verification

The current efforts to assess and improve the Reynolds-averaged Navier-Stokes (RANS)-coupled transition models in the NASA FUN3D and OVERFLOW codes are summarized in this study. The first AIAA Transition Modeling Workshop and the NATO AVT-313 Transition Workshop both emphasized the need for code verification for transport equations based transition models as a top priority. We discuss the methods used for the model verification, the resulting grid families, the flow solutions, and other supporting information collected with at least two established NASA flow solvers, namely, FUN3D and OVERFLOW. These results, which will be uploaded onto the NASA Turbulence Modeling Resource, should assist other members of the computational fluid dynamics (CFD) community in verifying their own implementations of various transition models, such as the Langtry-Menter (LM2009) model, the one-equation γ model, and Coder’s amplification factor transport (AFT) model. Grid convergence is assessed using both global and local flow metrics of interest such as lift and drag as well as local skin-friction coefficients. We also explore the anisotropic unstructured metric-based adaptive mesh refinement library known as refine with the NASA FUN3D solver to determine if this capability can achieve the same accuracy as handcrafted structured grids with a significantly smaller node count and to learn the characteristics of the resulting grid distribution, especially in the vicinity of the transition zone.

Transition↗

Recent Progress on RANS-Based Transition Model Verification

The current efforts to assess and improve the Reynolds-averaged Navier-Stokes (RANS)-coupled transition models in the NASA FUN3D and OVERFLOW codes are summarized in this study. The first AIAA Transition Modeling Workshop and the NATO AVT-313 Transition Workshop both emphasized the need for code verification for transport equations based transition models as a top priority. We discuss the methods used for the model verification, the resulting grid families, the flow solutions, and other supporting information collected with at least two established NASA flow solvers, namely, FUN3D and OVERFLOW. These results, which will be uploaded onto the NASA Turbulence Modeling Resource, should assist other members of the computational fluid dynamics (CFD) community in verifying their own implementations of various transition models, such as the Langtry-Menter (LM2009) model, the one-equation γ model, and Coder’s amplification factor transport (AFT) model. Grid convergence is assessed using both global and local flow metrics of interest such as lift and drag as well as local skin-friction coefficients. We also explore the anisotropic unstructured metric-based adaptive mesh refinement library known as refine with the NASA FUN3D solver to determine if this capability can achieve the same accuracy as handcrafted structured grids with a significantly smaller node count and to learn the characteristics of the resulting grid distribution, especially in the vicinity of the transition zone.

RANS↗

Grid Optimization Lawrence Livermore Nonlinear Programming

Modelling and solution library for security-constrained AC optimal power flow problems that uses nonlinear programming methods (interior-point methods) and solvers (Ipopt, HiOp). The code is written in C++ and provides parallel computing capabilities in the form of task parallelism (solving contingency problems in parallel). Code can run on a variety of commodity high-performance computing.

Petra, CosminG↗

DASSH-F: Subchannel Based Thermal Analysis

The DASSH thermal analysis code is designed to rapidly allow a reactor design engineer to obtain flow rates requirements that satisfy peak temperature constraints in the domain. The advantage of using DASSH over a hand calculation is that it has a more rigorous treatment of the pin power distribution and coolant heat transfer within an assembly and between assemblies. The advantage of using DASSH over a conventional 3D subchannel code or a computational fluid dynamics code (CFD) is that it can obtain the desired solution in a matter of minutes in serial with minor computer memory needs. The DASSH methodology is virtually identical to SUPERENERGY-2 with additional functionalities taken from follow on work to SUPERENERGY-2 done at ANL in the 1980s. DASSH today is an integral component of the Argonne Fast Reactor analysis suite for reactor design work. DASSH obtains the power distribution from a coupled neutron-gamma heating calculation in GAMSOR (including DIF3D) at each time point of a companion fuel cycle analysis calculation with REBUS. The domain in DASSH assumes a hexagonal grid typical for fast reactors with much of the geometry information taken from the DIF3D model. DASSH assumes the assemblies that are loaded into each grid position are ducted to control the coolant flow. Considerable detail is given on the subchannel formulation of DASSH in this document. Much of the formulation and design of the code builds upon research done by previous authors with little new investigation. Thus the decisions made in developing the subchannel model used in DASSH have their origins over 50 years ago. Much of the heat transfer methodology in DASSH is built upon correlations for both the coolant mixing and heat transfer coefficients for pins and ducts. DASSH is thus not a rigorous treatment of a given problem, but a rapid assessment of the temperature field that has known limitations with respect to an experimental measurement or CFD calculation. The DASSH input and output are detailed along with usage of the software. The DASSH output provides tables of evaluated material properties and key coolant and pin temperature results. DASSH can create Python scripts that generate domain summary pictures. DASSH can also generate assembly temperature maps and VTK output files which allow the DASSH solution to be visualized. As the primary purpose of the DASSH software is to compute the coolant and fuel pin temperature distribution for a given model of a reactor, much of the output focus is giving the user quick summary tables needed to assess the performance of a given orifice flow specification. The present version of DASSH has a crude orifice search capability and an efficient orifice flow search capability. The flow search tries to meet user specified constraints for 1) peak 2-sigma clad midwall temperature, 2) peak coolant temperature, and 3) desired bulk outlet temperature. There are many development shortcomings in DASSH detailed in this document, but this version is functional for modern analysis needs. This document serves as the manual for the Fortran based DASSH software that was developed to replace the Python version of DASSH developed as part of the VTR program.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Automated Instrumentation, Monitoring and Visualization of PVM Programs Using AIMS

We present views and analysis of the execution of several PVM (Parallel Virtual Machine) codes for Computational Fluid Dynamics on a networks of Sparcstations, including: (1) NAS Parallel Benchmarks CG and MG; (2) a multi-partitioning algorithm for NAS Parallel Benchmark SP; and (3) an overset grid flowsolver. These views and analysis were obtained using our Automated Instrumentation and Monitoring System (AIMS) version 3.0, a toolkit for debugging the performance of PVM programs. We will describe the architecture, operation and application of AIMS. The AIMS toolkit contains: (1) Xinstrument, which can automatically instrument various computational and communication constructs in message-passing parallel programs; (2) Monitor, a library of runtime trace-collection routines; (3) VK (Visual Kernel), an execution-animation tool with source-code clickback; and (4) Tally, a tool for statistical analysis of execution profiles. Currently, Xinstrument can handle C and Fortran 77 programs using PVM 3.2.x; Monitor has been implemented and tested on Sun 4 systems running SunOS 4.1.2; and VK uses XIIR5 and Motif 1.2. Data and views obtained using AIMS clearly illustrate several characteristic features of executing parallel programs on networked workstations: (1) the impact of long message latencies; (2) the impact of multiprogramming overheads and associated load imbalance; (3) cache and virtual-memory effects; and (4) significant skews between workstation clocks. Interestingly, AIMS can compensate for constant skew (zero drift) by calibrating the skew between a parent and its spawned children. In addition, AIMS' skew-compensation algorithm can adjust timestamps in a way that eliminates physically impossible communications (e.g., messages going backwards in time). Our current efforts are directed toward creating new views to explain the observed performance of PVM programs. Some of the features planned for the near future include: (1) ConfigView, showing the physical topology of the virtual machine, inferred using specially formatted IP (Internet Protocol) packets: and (2) LoadView, synchronous animation of PVM-program execution and resource-utilization patterns.

Mehra, Pankaj↗

Progress of High Efficiency Centrifugal Compressor Simulations Using TURBO

Three-dimensional, time-accurate, and phase-lagged computational fluid dynamics (CFD) simulations of the High Efficiency Centrifugal Compressor (HECC) stage were generated using the TURBO solver. Changes to the TURBO Parallel Version 4 source code were made in order to properly model the no-slip boundary condition along the spinning hub region for centrifugal impellers. A startup procedure was developed to generate a converged flow field in TURBO. This procedure initialized computations on a coarsened mesh generated by the Turbomachinery Gridding System (TGS) and relied on a method of systematically increasing wheel speed and backpressure. Baseline design-speed TURBO results generally overpredicted total pressure ratio, adiabatic efficiency, and the choking flow rate of the HECC stage as compared with the design-intent CFD results of Code Leo. Including diffuser fillet geometry in the TURBO computation resulted in a 0.6 percent reduction in the choking flow rate and led to a better match with design-intent CFD. Diffuser fillets reduced annulus cross-sectional area but also reduced corner separation, and thus blockage, in the diffuser passage. It was found that the TURBO computations are somewhat insensitive to inlet total pressure changing from the TURBO default inlet pressure of 14.7 pounds per square inch (101.35 kilopascals) down to 11.0 pounds per square inch (75.83 kilopascals), the inlet pressure of the component test. Off-design tip clearance was modeled in TURBO in two computations: one in which the blade tip geometry was trimmed by 12 mils (0.3048 millimeters), and another in which the hub flow path was moved to reflect a 12-mil axial shift in the impeller hub, creating a step at the hub. The one-dimensional results of these two computations indicate non-negligible differences between the two modeling approaches.

turbomachinery↗

Energy flexibility of residential buildings: A systematic review of characterization and quantification methods and applications

With building electric demand becoming increasingly dynamic, and a growing percentage of intermittent renewable power generation from solar photovoltaics and wind turbines, the power grid is facing increasing challenge to manage the real time balance between the supply and demand. With advancements in smart sensing and metering, smart appliances, electric vehicles, and energy storage technologies, demand side management of residential buildings can help the grid to improve stability by optimizing flexible loads. This paper reviews recent studies on residential building demand side management, with a focus on characterization and quantification of energy flexibility covering various types of flexible loads, metrics, methods, and applications. The reviewed studies showed four levels of applications: building level (45%), district or community level (29%), system level (19%), and building sector level (7%). Shifting loads is the dominant flexibility type in 60% of applications, followed by shedding (19%), generation (16%), and modulating (6%). Depending on the technology and application scope, flexible operations have a wide range of performance, with peak power reductions of 1%~65%, energy savings up to 60%, operational cost reduction of 1%~48%, and greenhouse gas emission reductions of up to29%. More than half (51%) of the studies employed control strategies to achieve flexibility; among those 72% used optimal controls, while 28% used rule-based controls. About 58% of the studies used mathematical formulation to quantify energy flexibility. Most studies were based on simulation, while less than 15% of the studies had measurements from experiments or field tests. The review reveals research opportunities to address significant gaps in the existing literature: (1) establishing a common definition and performance metrics for energy flexibility of buildings that are technology and application agnostic, (2) developing an ontology to standardize representation of flexibility resources for interoperability, (3) integrating occupant impacts into the quantification and optimization of energy flexibility, and (4) developing requirements and credits of energy flexibility in building energy codes and standards. Findings from the review can inform future research and development of energy flexible buildings which are essential to a reliable and resilient power grid.

Li, H↗

Automatic Data Distribution for CFD Applications on Structured Grids

Development of HPF versions of NPB and ARC3D showed that HPF has potential to be a high level language for parallelization of CFD applications. The use of HPF requires an intimate knowledge of the applications and a detailed analysis of data affinity, data movement and data granularity. Since HPF hides data movement from the user even with this knowledge it is easy to overlook pieces of the code causing low performance of the application. In order to simplify and accelerate the task of developing HPF versions of existing CFD applications we have designed and partially implemented ADAPT (Automatic Data Distribution and Placement Tool). The ADAPT analyzes a CFD application working on a single structured grid and generates HPF TEMPLATE, (RE)DISTRIBUTION, ALIGNMENT and INDEPENDENT directives. The directives can be generated on the nest level, subroutine level, application level or inter application level. ADAPT is designed to annotate existing CFD FORTRAN application performing computations on single or multiple grids. On each grid the application can considered as a sequence of operators each applied to a set of variables defined in a particular grid domain. The operators can be classified as implicit, having data dependences, and explicit, without data dependences. In order to parallelize an explicit operator it is sufficient to create a template for the domain of the operator, align arrays used in the operator with the template, distribute the template, and declare the loops over the distributed dimensions as INDEPENDENT. In order to parallelize an implicit operator, the distribution of the operator's domain should be consistent with the operator's dependences. Any dependence between sections distributed on different processors would preclude parallelization if compiler does not have an ability to pipeline computations. If a data distribution is "orthogonal" to the dependences of an implicit operator then the loop which implements the operator can be declared as INDEPENDENT.

Frumkin, Michael↗

Incremental Parallelization of Non-Data-Parallel Programs Using the Charon Message-Passing Library

Message passing is among the most popular techniques for parallelizing scientific programs on distributed-memory architectures. The reasons for its success are wide availability (MPI), efficiency, and full tuning control provided to the programmer. A major drawback, however, is that incremental parallelization, as offered by compiler directives, is not generally possible, because all data structures have to be changed throughout the program simultaneously. Charon remedies this situation through mappings between distributed and non-distributed data. It allows breaking up the parallelization into small steps, guaranteeing correctness at every stage. Several tools are available to help convert legacy codes into high-performance message-passing programs. They usually target data-parallel applications, whose loops carrying most of the work can be distributed among all processors without much dependency analysis. Others do a full dependency analysis and then convert the code virtually automatically. Even more toolkits are available that aid construction from scratch of message passing programs. None, however, allows piecemeal translation of codes with complex data dependencies (i.e. non-data-parallel programs) into message passing codes. The Charon library (available in both C and Fortran) provides incremental parallelization capabilities by linking legacy code arrays with distributed arrays. During the conversion process, non-distributed and distributed arrays exist side by side, and simple mapping functions allow the programmer to switch between the two in any location in the program. Charon also provides wrapper functions that leave the structure of the legacy code intact, but that allow execution on truly distributed data. Finally, the library provides a rich set of communication functions that support virtually all patterns of remote data demands in realistic structured grid scientific programs, including transposition, nearest-neighbor communication, pipelining, gather/scatter, and redistribution. At the end of the conversion process most intermediate Charon function calls will have been removed, the non-distributed arrays will have been deleted, and virtually the only remaining Charon functions calls are the high-level, highly optimized communications. Distribution of the data is under complete control of the programmer, although a wide range of useful distributions is easily available through predefined functions. A crucial aspect of the library is that it does not allocate space for distributed arrays, but accepts programmer-specified memory. This has two major consequences. First, codes parallelized using Charon do not suffer from encapsulation; user data is always directly accessible. This provides high efficiency, and also retains the possibility of using message passing directly for highly irregular communications. Second, non-distributed arrays can be interpreted as (trivial) distributions in the Charon sense, which allows them to be mapped to truly distributed arrays, and vice versa. This is the mechanism that enables incremental parallelization. In this paper we provide a brief introduction of the library and then focus on the actual steps in the parallelization process, using some representative examples from, among others, the NAS Parallel Benchmarks. We show how a complicated two-dimensional pipeline-the prototypical non-data-parallel algorithm- can be constructed with ease. To demonstrate the flexibility of the library, we give examples of the stepwise, efficient parallel implementation of nonlocal boundary conditions common in aircraft simulations, as well as the construction of the sequence of grids required for multigrid.

VanderWijngaart, Rob F.↗

Adoption of Plug-in Electric Vehicles: Local Fuel Use and Greenhouse Gas Emissions Reductions Across the U.S.

The dependence on gasoline-powered light-duty automobiles has made U.S. households vulnerable to the burden of fuel costs. Tailpipe emissions from these vehicles constitute 58% of greenhouse gas (GHG) emissions in the U.S., which are damaging to the environment (EPA, 2023). The adoption of plug-in electric vehicles (PEVs) has been shown to effectively reduce fuel costs and GHG emissions. However, local effects on these benefits are not well understood by American consumers, potentially limiting adoption and therefore the realization of PEV benefits at scale (MacInnis & Krosnick, 2020; EY Americas, 2023). To fill this research gap, this study estimates the fuel cost savings and GHG emission reductions at the state and ZIP code levels by considering local fuel prices, vehicle class preference, average vehicle model year, fuel efficiencies, and driving intensities. The study's findings reveal that the adoption of PEVs can yield substantial benefits in terms of fuel cost savings and GHG emission reductions nationwide. Specifically, driving a battery electric vehicle (BEV) is estimated to result in annual savings of up to $\$2,200$, while driving a plug-in hybrid electric vehicle (PHEV) can lead to savings up to $\$1,500$, when compared to an internal combustion engine vehicle (ICEV) of equivalent size. Moreover, using population-weighted averages by ZIP code, BEVs and PHEVs show the potential to save 400 and 200 grams of carbon dioxide equivalent per mile, respectively, compared to a representative ICEV of the same class. The magnitude of fuel cost savings and emissions reduction vary by region due to various factors. Generally, regions with high gasoline prices, low electricity prices, preferences for larger vehicles, and high driving intensities tend to see relatively large fuel savings. The emissions reductions are more pronounced in areas with clean grids where consumer preferences lie with large vehicles. This regional variability underscores the importance of considering local contextual factors when assessing the potential benefits of PEV adoption. In more than 99% of U.S. ZIP codes, PEVs result in overall savings in fuel use (and subsequent costs) and GHG emissions. While not a central focus of this analysis, reductions in GHG tailpipe emissions from PEV adoption would also come with reductions in criteria pollutant emissions, contributing to improved local air quality depending on the PEV penetration, population density, and electricity generation infrastructure in the locality.

33 ADVANCED PROPULSION SYSTEMS↗

Validation of Pin Span Superposition to Reconstruct Gridded Bundle Flows

This milestone shows a demonstration of the surface map model to map the surface temperature for single-phase computational fluid dynamics simulation data from STAR-CCM+ to the subchannel code CTF using a two-step process that captures global and local rod surface temperature behavior based on simulation boundary conditions and position. This model can be used to improve results from CTF by transforming surface temperatures obtained from CTF to model data that resembles data from STAR-CCM+. A summary of the current two-step model process and results of the initial investigations with a single subchannel and a 5 x 5 set of fuel rods are shown and discussed within, with suggestions for further improvements.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A comparative study of Navier-Stokes codes for high-speed flows

A comparative study was made with four different codes for solving the compressible Navier-Stokes equations using three different test problems. The first of these cases was hypersonic flow through the P8 inlet, which represents inlet configurations typical of a hypersonic airbreathing vehicle. The free-stream Mach number in this case was 7.4. This 2-D inlet was designed to provide an internal compression ratio of 8. Initial calculations were made using two state-of-the-art finite-volume upwind codes, CFL3D and USA-PG2, as well as NASCRIN, a code which uses the unsplit finite-difference technique of MacCormack. All of these codes used the same algebraic eddy-viscosity turbulence model. In the experiment, the cowl lip was slightly blunted; however, for the computations, a sharp cowl leading edge was used to simplify the construction of the grid. The second test problem was the supersonic (Mach 3.0) flow in a three-dimensional corner formed by the intersection of two wedges with equal wedge angles of 9.48 degrees. The flow in such a corner is representative of the flow in the corners of a scramjet inlet. Calculations were made for both laminar and turbulent flow and compared with experimental data. The three-dimensional versions of the three codes used for the inlet study (CFL3D, USA-PG3, and SCRAMIN, respectively) were used for this case. For the laminar corner flow, a fourth code, LAURA, which also uses recently-developed upwind technology, was also utilized. The final test case is the two-dimensional hypersonic flow over a compression ramp. The flow is laminar with a free-stream Mach number of 14.1. In the experiment, the ramp angle was varied to change the strength of the ramp shock and the extent of the viscous-inviscid interaction. Calculations were made for the 24-degree ramp configuration which produces a large separated-flow region that extends upstream of the corner.

Rudy, David H.↗

Preservation of kinetics parameters generated by Monte Carlo calculations in two-step deterministic calculations

The generation of accurate kinetic parameters such as mean generation time Λ and effective delayed neutron fraction β eff via Monte Carlo codes is established. Employing these in downstream deterministic codes warrants another step to ensure no additional error is introduced by the low-order transport operator when computing forward and adjoint fluxes for bilinear weighting of these parameters. Another complexity stems from applying superhomogenization (SPH) equivalence in non-fundamental mode approximations, where reference and low-order calculations rely on a 3D full core model. In these cases, SPH factors can optionally be computed for only part of the geometry while preserving reaction rates and K-effective, but the impact of such approximations on kinetics parameters has not been thoroughly studied. This paper aims at studying the preservation of bilinearly-weighted quantities in the Serpent–Griffin calculation procedure. Diffusion and transport evaluations of IPEN/MB-01, Godiva, and Flattop were carried out with the Griffin reactor physics code, testing available modeling options using Serpent-generated multigroup cross sections and equivalence data. Verifying Griffin against Serpent indicates sensitivities to multigroup energy grid selection and regional application of SPH equivalence, introducing significant errors; these were demonstrated to be reduced through the use of a transport method together with a finer energy grid.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

PyFLOSIC: Python-based Fermi–Löwdin orbital self-interaction correction

We present pyflosic, an open-source, general-purpose python implementation of the Fermi–Löwdin orbital self-interaction correction (FLO-SIC), which is based on the python simulation of chemistry framework (pyscf) electronic structure and quantum chemistry code. Thanks to pyscf, pyflosic can be used with any kind of Gaussian-type basis set, various kinds of radial and angular quadrature grids, and all exchange-correlation functionals within the local density approximation, generalized-gradient approximation (GGA), and meta-GGA provided in the libxc and xcfun libraries. A central aspect of FLO-SIC is the Fermi-orbital descriptors, which are used to estimate the self-interaction correction. Importantly, they can be initialized automatically within pyflosic; they can also be optimized within pyflosic with an interface to the atomic simulation environment, a python library that provides a variety of powerful gradient-based algorithms for geometry optimization. Although pyflosic has already facilitated applications of FLO-SIC to chemical studies, it offers an excellent starting point for further developments in FLO-SIC approaches, thanks to its use of a high-level programming language and pronounced modularity.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A fast, matrix-based method to perform omnidirectional pressure integration

Abstract Experimentally-measured pressure fields play an important role in understanding many fluid dynamics problems. Unfortunately, pressure fields are difficult to measure directly with non-invasive, spatially resolved diagnostics, and calculations of pressure from velocity have proven sensitive to error in the data. Omnidirectional line integration methods are usually more accurate and robust to these effects as compared to implicit Poisson equations, but have seen slower uptake due to the higher computational and memory costs, particularly in 3D domains. This paper demonstrates how omnidirectional line integration approaches can be converted to a matrix inversion problem. This novel formulation uses an iterative approach so that the boundary conditions are updated each step, preserving the convergence behavior of omnidirectional schemes while also keeping the computational efficiency of Poisson solvers. This method is implemented in Matlab and also as a GPU-accelerated code in CUDA-C++. The behavior of the new method is demonstrated on 2D and 3D synthetic and experimental data. Three-dimensional grid sizes of up to 125 million grid points are tractable with this method, opening exciting opportunities to perform volumetric pressure field estimation from 3D PIV measurements.

42 ENGINEERING↗

The essential character of the neutrino mechanism of core-collapse supernova explosions

Abstract Calibrating with detailed 2D core-collapse supernova (CCSN) simulations, we derive a simple CCSN explosion condition based solely upon the terminal density profiles of state-of-the-art stellar evolution calculations of the progenitor massive stars. This condition captures the vast majority of the behaviour of the one hundred 2D state-of-the-art models we performed to gauge its usefulness. The goal is to predict, without resort to detailed simulation, the explodability of a given massive star. We find that the simple maximum fractional ram pressure jump discriminant we define works well ∼90 per cent of the time and we speculate on the origin of the few false positives and false negatives we witness. The maximum ram pressure jump generally occurs at the time of accretion of the silicon/oxygen interface, but not always. Our results depend upon the fidelity with which the current implementation of our code F ornax adheres to Nature and issues concerning the neutrino–matter interaction, the nuclear equation of state, the possible effects of neutrino oscillations, grid resolution, the possible role of rotation and magnetic fields, and the accuracy of the numerical algorithms employed remain to be resolved. Nevertheless, the explodability condition we obtain is simple to implement, shows promise that it might be further generalized while still employing data from only the unstable Chandrasekhar progenitors, and is a more credible and robust simple explosion predictor than can currently be found in the literature.

Astronomy & Astrophysics↗

Refactoring the elastic–viscous–plastic solver from the sea ice model CICE v6.5.1 for improved performance

This study focuses on the performance of the elastic–viscous–plastic (EVP) dynamical solver within the sea ice model, CICE v6.5.1. The study has been conducted in two steps. First, the standard EVP solver was extracted from CICE for experiments with refactored versions, which are used for performance testing. Second, one refactored version was integrated and tested in the full CICE model to demonstrate that the new algorithms do not significantly impact the physical results. The study reveals two dominant bottlenecks, namely (1) the number of Message Parsing Interface (MPI) and Open Multi-Processing (OpenMP) synchronization points required for halo exchanges during each time step combined with the irregular domain of active sea ice points and (2) the lack of single-instruction, multiple-data (SIMD) code generation. The standard EVP solver has been refactored based on two generic patterns. The first pattern exposes how general finite differences on masked multi-dimensional arrays can be expressed in order to produce significantly better code generation by changing the memory access pattern from random access to direct access. The second pattern takes an alternative approach to handle static grid properties. The measured single-core performance improvement is more than a factor of 5 compared to the standard implementation. The refactored implementation of strong scales on the Intel® Xeon® Scalable Processors series node until the available bandwidth of the node is used. For the Intel® Xeon® CPU Max series, there is sufficient bandwidth to allow the strong scaling to continue for all the cores on the node, resulting in a single-node improvement factor of 35 over the standard implementation. This study also demonstrates improved performance on GPU processors.

58 GEOSCIENCES↗