Search NASA⌕ Search

SEARCH · Search NASA

Results for “Edge computing”

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.

384 records · Page 22

Development of a Griffin model of the advanced test reactor

In the pursuit of a higher fidelity deterministic simulation capability of the Advanced Test Reactor, it is important to have a fast yet accurate deterministic neutronics model. Here, to achieve this, we employed an advanced two-step method. The first step involves generating homogenized cross sections using OpenMC, a cutting-edge Monte Carlo neutron transport code. OpenMC offers excellent modular capabilities, allowing for easy component integration and flexibility in incorporating new designs into the model. The second step involves deterministic transport calculations, which are performed using Griffin, a reactor physics application based on the Multiphysics Object-Oriented Simulation Environment (MOOSE). To ensure the accurate spatial resolution and assignment of material cross sections, a Cubit-generated mesh for the Advanced Test Reactor is utilized as an intermediate step between the OpenMC and Griffin models; Griffin utilizes the mesh for its finite element solution, while OpenMC material identifications are written to the mesh file to be used in Griffin material assignments. Additionally, a Python-based script converts the cross sections generated by OpenMC into the ISOXML format required by Griffin. Initial comparisons using the Griffin diffusion solver indicated good agreement between the neutron multiplication factors obtained from the standalone OpenMC model and the Griffin model, with differences of less than 10 pcm in the 2D geometry configuration; it was later determined that this agreement was likely due to compensating effect and was more likely on the order of –700 pcm relative to the OpenMC solution. However, in three-dimensional calculations, an unacceptably large error (almost 8,000 pcm) was found in the Griffin solution with the diffusion solver. Subsequent calculations using Griffin’s discrete ordinates solver demonstrated substantially improved agreement, within 116 pcm of the OpenMC solution used to generate the cross sections for Griffin. Building on this capability, future work will seek to perform more detailed validation calculations. The ultimate goal is to evaluate both transient and multiphysics simulations of the reactor.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

SOLEDGE3X full vessel plasma boundary simulations of ITER non-active phase plasmas

The onset of detachment in the ITER machine is analyzed in this work through the help of 2D-axisymmetric boundary plasma simulations with the SOLEDGE3X-EIRENE code, which features a numerical domain for the plasma solver extending up to the first wall. The plasma boundary is computed in scenarios from the first non-active phase of ITER, in pure H and at 20 MW. This set of simulations is used in two aspects: first, to study the plasma detachment in the divertor, and second, the plasma conditions, fluxes, and beryllium erosion at the first wall. Here, the code results are also compared to those obtained with the well-established SOLPS-ITER code, which includes a plasma numerical domain only covering the main SOL. Results show an increase in the SOL width λ q with increasing density, and a detailed analysis is carried out, for the first time, on each of the different plasma-neutral interactions in the code’s physics model in EIRENE. The gross beryllium erosion rates of first wall panels are estimated from 2D simulations, with the aim of assessing their sensitivity to two parameters: the divertor density regime, and the presence of density shoulders in the far-SOL formed by enhanced perpendicular transport at this location. The erosion contributions from neutrals and ions are considered in each case, and the charge-exchange atoms fluxes and energy distributions are provided, highlighting the two atom populations (cold and charge-exchange).

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate “bottleneck” region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions 𝐿,𝑅 with 𝑁 𝐿 ,𝑁 𝑅 qubits, respectively, coupled only through an intermediate region 𝐶 with 𝑁 𝐶 qubits, for any 𝛿 > 0 we show a lower bound of Ω⁢(𝑁$^{1−𝛿}_{𝑅}$/√𝑁 𝐿⁢ 𝑁 𝐶 ) on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between 𝐿 and 𝐶,𝑅 that can be generated in time 𝑡 by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from 𝑂⁡(𝑁 𝐿⁢ 𝑡) to 𝑂⁡(√𝑁 𝐿⁢ 𝑡). As a special case, when applied to the star graph (i.e., one vertex connected to 𝑁 leaves), we obtain an Ω⁡(√𝑁 1−𝛿 ) lower bound on the routing time and on the time to prepare 𝑁/2 Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time Θ⁡(√𝑁) using Hamiltonian quantum routing, obtaining a speedup over gate-based routing, which takes time Θ⁡(𝑁).

97 MATHEMATICS AND COMPUTING↗

The Galaxy platform for accessible, reproducible, and collaborative data analyses: 2024 update

Galaxy (https://galaxyproject.org) is deployed globally, predominantly through free-to-use services, supporting user-driven research that broadens in scope each year. Users are attracted to public Galaxy services by platform stability, tool and reference dataset diversity, training, support and integration, which enables complex, reproducible, shareable data analysis. Applying the principles of user experience design (UXD), has driven improvements in accessibility, tool discoverability through Galaxy Labs/subdomains, and a redesigned Galaxy ToolShed. Galaxy tool capabilities are progressing in two strategic directions: integrating general purpose graphical processing units (GPGPU) access for cutting-edge methods, and licensed tool support. Engagement with global research consortia is being increased by developing more workflows in Galaxy and by resourcing the public Galaxy services to run them. The Galaxy Training Network (GTN) portfolio has grown in both size, and accessibility, through learning paths and direct integration with Galaxy tools that feature in training courses. Code development continues in line with the Galaxy Project roadmap, with improvements to job scheduling and the user interface. Environmental impact assessment is also helping engage users and developers, reminding them of their role in sustainability, by displaying estimated CO 2 emissions generated by each Galaxy job.

97 MATHEMATICS AND COMPUTING↗

FPGA-accelerated SpeckleNN with SNL for real-time X-ray single-particle imaging

We present the implementation of a specialized version of our previously published unified embedding model, SpeckleNN, for real-time speckle pattern classification in X-ray Single-Particle Imaging (SPI), using the SLAC Neural Network Library (SNL) on an FPGA platform. This hardware realization transitions SpeckleNN from a prototypic model into a practical edge solution, optimized for running inference near the detector in high-throughput X-ray free-electron laser (XFEL) facilities, such as those found at the Linac Coherent Light Source (LCLS). To address the resource constraints inherent in FPGAs, we developed a more specialized version of SpeckleNN. The original model, which was designed for broader classification across multiple biological samples, comprised ~5.6 million parameters. The new implementation, while reducing the parameter count to 64.6K (a 98.8% reduction), focuses on maintaining the model's essential functionality for real-time operation, achieving an accuracy of 90%. Furthermore, we compressed the latent space from 128 to 50 dimensions. This implementation was demonstrated on the KCU1500 FPGA board, utilizing 71% of available DSPs, 75% of LUTs, and 48% of FFs, with an average power consumption of 9.4W according to the Vivado post-implementation report. The FPGA performed inference on a single image with a latency of 45.015 microseconds at a 200 MHz clock rate. In comparison, running the same inference on an NVIDIA A100 GPU resulted in an average power consumption of ~73W and an image processing latency of around 400 microseconds. Our FPGA-accelerated version of SpeckleNN demonstrated significant improvements, achieving an 8.9 × speedup and a 7.8 × reduction in power consumption compared to the GPU implementation. Key advancements include model specialization and dynamic weight loading through SNL, which eliminates the need for time-consuming FPGA design re-synthesis, allowing fast and continuous deployment of models (re)trained online. These innovations enable real-time adaptive classification and efficient vetoing of speckle patterns, making SpeckleNN more suited for deployment in XFEL facilities. This implementation has the potential to significantly accelerate SPI experiments and enhance adaptability to evolving experimental conditions.

47 OTHER INSTRUMENTATION↗

Q2 Report for FY25 Theory and Simulation Performance Target: Development of an integrated modeling framework for fusion reactor design and assessment

This report describes the work and activities carried out towards the completion of each of the following milestones in FY25 Q2: 1. Demonstrate workflow for generating self-consistent CESOL plasma profiles + first wall and divertor loading prediction and generate the CAT plasma and neutron loading needed for further engineering analysis: $\circ$ Run CESOL with BOUT++/Hermes-3 and immersed boundary condition to directly map to wall: • Run BOUT++/Hermes-3 through the IPS workflow to find radial particle and energy diffusivities to match either the Eich or the physics-based scaling of the SOL heat flux width, and • Expand source of first wall heat flux to include charged particles, neutrals, and radiation from the core+edge. 2. Generate medium fidelity parametrized CAD: $\circ$ Develop the TRACER tool to read an existing CAD, regenerate the geometry based on vertex location and connectivity information, define vertex translation and parameters needed for scaling the CAD, and $\circ$ Utilize the FreeGS code to determine CAT PF coil placement, including minimizing the number of coils, coil current, and electromechanical stresses. 3. Utilize plasma loading for engineering analysis: $\circ$ Couple the plasma loading to input for OpenFOAM and demonstrate initial test of thermal analysis of CAT first wall loading with typical DCLL blanket component cooling boundary conditions. 4. Demonstrate nuclear analysis: $\circ$ Apply initial analysis of tritium transport in DCLL blanket by evaluating spatially resolved tritium generation rates, tritium diffusion and convection.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗