Tardigrade-examples V0.2.0
Tardigrade-examples (LANL code O4735) is a repository of computational workflows that exercise the Tardigrade software package.
Allard, Thomas [Los Alamos National Laboratory]↗
SEARCH · Search NASA
Results for “Computer codes”
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.
ARCS: Agentic Retrieval-Augmented Code Synthesis with Iterative Refinement
Agentic Retrieval-Augmented Code Synthesis with Iterative RefinementIn supercomputing, efficient and optimized code generation is essential to leverage high-performance systems effectively. We have developed Agentic Retrieval-Augmented Code Synthesis (ARCS), an advanced framework for accurate, robust, and efficient code generation, completion, and translation. ARCS integrates Retrieval-Augmented Generation (RAG) with Chain-of-Thought (CoT) reasoning to systematically break down and iteratively refine complex programming tasks. An agent-based RAG mechanism retrieves relevant code snippets, while real-time execution feedback drives the synthesis of candidate solutions. This process is formalized as a state-action search tree optimization, balancing code correctness with editing efficiency. Evaluations on the Geeks4Geeks and HumanEval benchmarks demonstrate that ARCS significantly outperforms traditional prompting methods in translation and generation quality. By enabling scalable and precise code synthesis, ARCS offers transformative potential for automating and optimizing code development in supercomputing applications, enhancing computational resource utilization
Bhattarai, Manish [Los Alamos National Labs]↗
FY24: Progress Report on the MELCOR Modeling of the Liquid Salt Test Loop
This report outlines the activities conducted in FY24 focused on updating the liquid salt test loop (LSTL) model through the integration of a new test section featuring 16 radial tubes coupled to a filter section. Some comparative analyses of the updated model with existing experimental data for the LSTL was made and benchmarked against other computational tools, such as the ORNL code, SAM. These actions are part of a comprehensive validation effort and promote collaboration among laboratories participating in the Molten Salt Reactor (MSR) campaign.
22 GENERAL STUDIES OF NUCLEAR REACTORS↗
Investigation of Frozen Chemistry for Molten Salt Reactors (MSRs)
Understanding accident progression and the potential/conditions for fission product release from fuel is necessary to evaluate safety for any nuclear reactor system. Molten Salt Reactors (MSRs) under development need such analysis to support safety evaluations. Fission product chemistry specific to MSR concepts is a critical area that introduces distinct considerations relative to the current state-of-knowledge in reactor safety, primarily developed for water-moderated nuclear reactor systems. In Light Water Reactor (LWR) systems, it is necessary to capture the chemical interaction of fission products with the reactor evironment, containment and confinement systems. The overall effects at this point are relatively well understood for the purposes of performing safety evaluations. A key insight from LWR studies is that fission product chemical behavior can be reasonably captured by modeling approaches where the chemistry is "frozen". These modeling approaches assume that radionuclide reaction and speciation can be represented by chemical classes, each with characteristic transport behavior that is invariant under a broad range of thermochemical conditions. However, radionuclides can exhibit a range of behavior in the liquid salt-melt phase of the coolant used in MSRs. Radionuclides, salt, and the metal containment surfaces (i.e. pipes) can co-exist in dynamic equilibrium that could evolve with small system mass changes. A detailed investigation to the degree the equilibrium state can dynamically evolve with changes in the conditions of the molten salt mixture has not been previously conducted. It is currently not well understood where frozen chemistry assumptions are valid. Expanding the state-of-knowledge in this regard is relevant to better assessing the range of chemical effects that should be incorporated as part of MSR safety assessments. This investigation used the Oak Ridge Isotope GENeration (ORIGEN) module of the Standardized Computer-Analysis for Licensing Evaluation (SCALE) code to generate simulated radionuclide inventories for the MSR Experiment (MSRE) and then modeled reactor chemical speciation using the Molten Salt Thermodynamic Database – Thermochemical (MSTDB-TC) coupled with Thermochimica. The effect of composition variation during decay of fission product inventory in a molten salt over a period of 500 days prolonged post- at multiple temperatures was studied. Mass fractions for fluorine and berilium were varied in order to probe the effects of free fluorine control. Finally, speciation of fluoride reactors were showed by comparing MSRE readionuclide inventories with a FLiBe based molten salt breeder reactor (MSBR). The results showed that fission product mass change has little effect on phase mass changes and vapor pressures for fluoride species, but differ with varying carrier and fuel salt compositions. However, iodine species were found to have a vapor pressure not only dependent on temperature, but also the free fluorine potential, releasing iodine when the free fluorine potential is equal to the iodine inventory. This observation, however, arose under free fluorine potentials that are very unlikely to be realized in typical molten salt mixtures. Despite this observation, temperature was found to be the dominant parameter that drove phase change and fission product species vapor pressure. The results indicate that the current frozen chemistry approach is adequate for MSR analysis.
22 GENERAL STUDIES OF NUCLEAR REACTORS↗
Highlight of IC project: w25_dreamxd
(left) The Earth’s radiation belts are donut-shaped regions containing MeV electrons (color contour for density) trapped by the magnetic field (white curves). We use DREAMxD code to model their dynamics. (right) We develop a new method to accelerate a key piece of the code – diffusion coefficient calculation. Comparing the compute time in node hours required by the standard approach to the compute time required for the fast method, it shows that the new method can be 100x faster for a large problem size.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
A Picture is Worth a Thousand Data Points: Introduction to Visualization
They say a picture is worth a thousand words. My response to that? A picture is also worth a thousand data points! However, not all pictures are created equal: a good visualization tells a story and helps the viewer to understand the data. A polished visualization can help you In the first half of this workshop, I will discuss the seven sins of visualization, and how to avoid them. I will introduce guidelines on how to make excellent visualization choices. In the second half of the workshop, I will guide the participants in an interactive session on creating meaningful visualizations with just a few lines of code.
code↗
Accelerating detector simulations with Celeritas: profiling and performance optimizations
Celeritas is a GPU-optimized MC particle transport code designed to meet the growing computational demands of next-generation HEP experiments. It provides efficient simulation of EM physics processes in complex geometries with magnetic fields, detector hit scoring, and seamless integration into Geant4-driven applications to offload EM physics to GPUs. Recent efforts have focused on performance optimizations and expanding profiling capabilities. This paper presents some key advancements, including the integration of the Perfetto system profiling tool for detailed performance analysis and the development of track-sorting methods to improve computational efficiency.
46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
Reimagining Disassembly Interfaces With Visualization: Combining Instruction Tracing and Control Flow With DisViz
In applications where efficiency is critical, developers may examine their compiled binaries, seeking to understand how the compiler transformed their source code and what performance implications that transformation may have. This analysis is challenging due to the vast number of disassembled binary instructions and the many-to-many mappings between them and the source code. These problems are exacerbated as source code size increases, giving the compiler more freedom to map and disperse binary instructions across the disassembly space. Interfaces for disassembly typically display instructions as an unstructured listing or sacrifice the order of execution. Here, we design a new visual interface for disassembly code that combines execution order with control flow structure, enabling analysts to both trace through code and identify familiar aspects of the computation. Central to our approach is a novel layout of instructions grouped into basic blocks that displays a looping structure in an intuitive way. We add to this disassembly representation a unique block-based mini-map that leverages our layout and shows context across thousands of disassembly instructions. Finally, we embed our disassembly visualization in a web-based tool, DisViz, which adds dynamic linking with source code across the entire application. DizViz was developed in collaboration with program analysis experts following design study methodology and was validated through evaluation sessions with ten participants from four institutions. Participants successfully completed the evaluation tasks, hypothesized about compiler optimizations, and noted the utility of our new disassembly view. Our evaluation suggests that our new integrated view helps application developers in understanding and navigating disassembly code.
Computer science↗
SIMD Programming for the SMASH Shock Physics Code
Many modern CPUs that are available to the NNSA as mission computing resources support vector instruction sets. Making good use of vector instructions, referred to as “vectorization”, is often critical to getting the best performance from these CPUs. While other codes choose to rely on compiler auto-vectorization, the SMASH shock physics code chooses to leverage APIs for explicit vectorization. These APIs are similar to directly calling the CPU vendor’s vector intrinsics, with the additional benefit of being vendor-agnostic. This document explains what the SIMD APIs are and how to use them in developing SMASH.
97 MATHEMATICS AND COMPUTING↗
Multi-GPU porting of a phase-change cascaded lattice Boltzmann method for three-dimensional pool boiling simulations
The Lattice Boltzmann method (LBM) has proven effective in simulating phase-change phenomena, such as melting, solidification, evaporation, and boiling. In this work, we develop a highly parallelized multi-GPU implementation of LBM for three-dimensional pool boiling simulations. The code is based on the OpenACC programming model, which enables the code to be deployed efficiently on multi-core CPUs, GPUs, and potentially other accelerators, without the need for architecture-specific rewrites. To support large-scale simulations, the domain is decomposed and distributed across multiple compute nodes using MPI. We demonstrate that the code exhibits excellent scaling properties, with ideal strong-scaling running with up to 256 GPUs on the MareNostrum5 cluster.
97 MATHEMATICS AND COMPUTING↗
Gamma Source Verification for GAMSRC and GAMSOR
Nuclear reactors that rely upon the fission reaction have two modes of thermal energy deposition in the reactor system: neutron absorption and gamma absorption. The gamma rays are typically generated by neutron capture reactions or during the fission process which means the primary driver of energy production is of course the neutron interactions. The GAMSOR program was first built in the mid 1980s to properly account for the gamma heating in an operating reactor core on core internals. The GAMSOR code is sequence of DIF3D calculations to compute the neutron and gamma flux and combine them to define both the neutron and gamma heating throughout the modeled domain. The goal of this manuscript is to present the software verification of GAMSOR. The first step of the GAMSOR sequence of calculations involves of a modified version of DIF3D (called DIF3D-GAMSOR) which generates a gamma source distribution for the follow-on DIF3D gamma transport calculation (step 2). This modified version of DIF3D increases the burden of maintenance and verification work on GAMSOR as one must reverify the DIF3D capabilities which is undesirable. Because the calculation of the gamma source is the only unique aspect of GAMSOR beyond the regular DIF3D capabilities, that part was put in a standalone code called GAMSRC such that one can use the verified DIF3D code in step 1 followed by GAMSRC to carry out the same GAMSOR calculation step. As a consequence, this manuscript is focused on verification of the gamma source files generated by GAMSRC. The verification of the modified version of DIF3D (DIF3D-GAMSOR) will be done less rigorously in that it will be verified that it produces the same output that GAMSRC does and thus GAMSRC is equivalent to GAMSOR on the problems studied here. Hand calculations and independent numerical calculations of the gamma source generation are used for the verification work. This work follows the same methodology of GAMSRC. As expected, the results agree well with those calculated by GAMSRC as will be shown.
22 GENERAL STUDIES OF NUCLEAR REACTORS↗
Fault Tolerant Decoding of QLDPC-GKP Codes with Circuit Level Soft Information
Concatenated bosonic-stabilizer codes have recently gained prominence as promising candidates for achieving low-overhead fault-tolerant quantum computing in the long term. In such systems, analog information obtained from the syndrome measurements of an inner bosonic code is used to inform decoding for an outer code layer consisting of a discrete-variable stabilizer code such as a surface code. The use of Quantum Low-Density Parity Check (QLDPC) codes as an outer code is of particular interest due to the significantly higher encoding rates offered by these code families, leading to a further reduction in overhead for large-scale quantum computing. Recent works have investigated the performance of QLDPC-GKP codes in detail, and the use of analog information from the inner code significantly boosts decoder performance. However, the noise models assumed in these works are typically limited to depolarizing or phenomenological noise. In this paper, we investigate the performance of QLDPC-GKP concatenated codes under circuit-level noise, based on a model introduced by Noh et al. in the context of the surface-GKP code. To demonstrate the performance boost from analog information, we investigate three scenarios: (a) decoding without soft information, (b) decoding with precomputed error probabilities but without real-time soft information, and (c) decoding with real-time soft information obtained from round-to-round decoding of the inner GKP code. Results show minimal improvement between (a) and (b), but a significant boost in (c), indicating that real-time soft information is critical for concatenated decoding under circuit-level noise. We also study the effect of measurement schedules with varying depths and show that using a schedule with minimum depth is essential for obtaining reliable soft information from the inner code.
Borah, Shantom K. [Arizona U. (main)]↗
ORCHA: A performance portability system for extreme heterogeneity
Heterogeneity is the prevalent trend in the rapidly evolving high-performance computing (HPC) landscape in both hardware and application software. The diversity in hardware platforms, currently comprising various accelerators and a future possibility of specializable chiplets, poses a significant challenge for scientific software developers aiming to harness optimal performance across different computing platforms while maintaining the quality of solutions when their applications are simultaneously growing more complex. Code synthesis and code generation can provide mechanisms to mitigate this challenge. We have developed a divide and conquer approach where different aspects of performance are handled by different stand-alone tools that are interfaced with the application through generated code. This portability system, ORCHA, enables users to configure and orchestrate their computations among available resources on a platform by specifying a high-level recipe, thereby permitting a many-to-many paradigm where each recipe results in a different variant of the application. The core design goal is to let users decide the application’s hardware mapping and orchestration by editing only the high-level recipe—without modifying the maintained source code or binding the application to a particular runtime system. Tools in ORCHA distribution are: CG-Kit for translating the recipe into an execution graph; Milhoja to execute the graph by orchestrating data and task movement among hardware resources; and Macroprocessor that enables users to define their own code-shorthand for higher composability and easier management of code variants. Additionally, the design of ORCHA permits tools to work in a plug-and-play mode where the application can build and run without CG-Kit and Milhoja, and either tool can be swapped out for other tools with similar capabilities by modifying the code generation portion of ORCHA. In this paper, we describe the design of ORCHA and the role that code-generation plays in isolating applications from tools. We demonstrate the breadth of configurations ORCHA enables with a case study in which an application configuration is realized on three distinct hardware mappings—a GPU-centric, a CPU/GPU balanced, and a CPU/GPU concurrent layouts by using different recipes.
Lee, Youngjun↗
Binder-benchmarking
SAND2025-07593O Binder-benchmarking evaluates the speed and memory impacts of C++, Python, and Matlab code binders. As a repository, it provides a way to locally run computation-based and memory-based benchmark suites on pybind11 and nanobind-based code in a Docker image. The software runs simple-speed and memory benchmarks on primitive navigation and integration exemplar algorithms. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.
Walker II, Michael [Sandia National Lab. (SNL-CA),↗
Subject-specific modeling framework for particle deposition using computational fluid dynamics
Quantifying particle deposition and dose in the respiratory tract requires a physiologically realistic representation and reproducible computational workflows. However, existing modeling frameworks, such as the International Commission on Radiological Protection (ICRP) compartmental models and the Multiple Path Particle Dosimetry (MPPD) tool, lack detailed deposition profiles and subject-specific capabilities. The combination of advances in computer vision algorithms applied to the respiratory tract and Computational Fluid and Particle Dynamics (CFPD) allows high-fidelity simulations of particle behavior in anatomically accurate geometries derived from individual CT scans. The segmentation, preprocessing, and file preparation task for a CFPD simulation was often time-consuming, and no prior studies to-date have yet presented a fully automated framework. This work presents a fully automated workflow to obtain individualized particle deposition profiles in the human respiratory tract. The pipeline starts with segmenting upper and lower airway geometries using morphological and deep learning-based methods, generating three-dimensional (3D) models from CT imaging data. Next, a series of algorithms are presented to quality check and prepare the 3D geometry for a CFD or CFPD simulation. The preprocessing step includes correcting geometric artifacts, enforcing a physically consistent mesh, and automatically identifying and capping multiple outlets, which is required for CFD/CFPD simulations. These processed models are then input into open-source (OpenFOAM) or commercial (StarCCM+) CFD solvers, where flow and transient particle transport equations — including turbulence and particle–wall interactions are solved under realistic breathing conditions. Finally, the resulting particle deposition profiles can be integrated with Monte Carlo radiation transport codes and state-of-the-art computational phantoms to assess organ-specific absorbed doses in scenarios of radioactive aerosol inhalation. The presented work streamlines respiratory tract segmentation, preprocessing for CFD/CFPD simulations, and integration with dose assessment workflows, reducing manual intervention and improving access to high-fidelity, subject-specific modeling. The high precision in predicted particle deposition and dose distributions can improve personalized treatment strategies in respiratory medicine and refine dose estimates for radiation protection.
AI↗
Characterization and Optimization of the Fitting of Quantum Correlation Functions
This case study presents a characterization and optimization of an application code for extracting parton distribution functions from high energy electron-proton scattering data. Profiling this application code reveals that the phase-space density computation accounts for 93% of the overall execution time for a single iteration on a single core. When executing multiple iterations in parallel on a multicore system, the application spends 78% of its overall execution time idling due to load imbalance. We address these issues by first transforming the application code from Python to C++ and then tackling the application load imbalance via a hybrid scheduling strategy that combines dynamic and static scheduling. These techniques result in a 62% reduction in CPU idle time and a 2.46x speedup in overall execution time per node. In addition, the typically enabled power-management mechanisms in supercomputers (e.g., AMD Turbo Core, Intel Turbo Boost, and RAPL) can significantly impact intra-node scalability when more than 50% of the CPU cores are used. This finding underscores the importance of understanding system interactions with power management, as they can adversely impact application performance, and highlights the necessity of intra-node scaling tests to identify performance degradation that inter-node scaling tests might otherwise overlook.
Chuang, Pi-Yueh [Virginia Tech,Dept. of Computer S↗
Flag Gadgets Based on Classical Codes
Fault-tolerant syndrome extraction is a key ingredient in implementing fault-tolerant quantum computation. While conventional methods use a number of extra qubits that are linear in the weight of the syndrome, several improvements have been introduced using flag gadgets. In this work, we develop a framework to design flag gadgets using classical codes. Using this framework, we show how to perform fault-tolerant syndrome extraction for any stabilizer code with arbitrary distance using exponentially fewer qubits than conventional methods when qubit measurement and reset are relatively slow compared to a round of error correction. In particular, our method requires only ( 2 t + 1 ) t ⌈ log 2 ( w ) ⌉ flag qubits to fault-tolerantly measure a weight- w stabilizer. We further take advantage of the saving provided by our construction to fault-tolerantly measure multiple stabilizers using a single gadget and show that it maintains the same exponential advantage when it is used to fault-tolerantly extract the syndromes of quantum low-density parity-check codes. Using the developed framework, we perform computer-assisted search to find several small examples where our constructions reduce the number of qubits required. These small examples may be relevant to near-term experiments on small-scale quantum computers. Published by the American Physical Society 2024
Anker, Benjamin↗
Strong Scalability Analysis of the Albany Land Ice code on HPC Architectures
Scalability is a critical factor in High-Performance Computing (HPC), where optimizing resource usage has a direct impact on cost-effectiveness and time-efficiency. This report presents a strong scaling performance study of the Albany Land Ice (ALI) code across different HPC architectures, towards determining the best configuration to use when running large-scale simulation ensembles.
97 MATHEMATICS AND COMPUTING↗