Search NASA⌕ Search

SEARCH · Search NASA

Results for “computer”

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 127 records · Page 7

Oak Ridge Computing Academy: An HPC cluster deployment and management pilot

The High Performance Computing Technologies (HPCT) course is a hands-on High Performance Computing (HPC) cluster deployment and management training program offered as part of the International School for Advanced Studies (SISSA) and the International Center for Theoretical Physics (ICTP) Master in High Performance Computing (MHPC) specialization. Here, this training program introduces students to key concepts in cluster configuration. which include networking, software stack provisioning, job scheduling, and monitoring. The publicly available course materials feature several examples and underlying methods that are broadly applicable to cluster deployment and management. This paper discusses the design of a new workforce development program at the Oak Ridge National Laboratory that is based on HPCT, the Oak Ridge Computing Academy (ORCA). The ORCA pilot program was hosted by the Oak Ridge Leadership Computing Facility (OLCF) in Summer 2025. As a part of this discussion, HPCT and ORCA course contents and infrastructure are outlined, ORCA participant experiences are detailed, and potential opportunities for improvement are discussed.

Education↗

A fast and robust computational modeling approach for density and shape predictions in powder metallurgy hot isostatic pressing

Powder metallurgy hot isostatic pressing (PM-HIP) is an advanced manufacturing process that produces near-net-shape parts with high material utilization and uniform microstructures. PM-HIP is frequently used for producing small-scale parts with complicated geometries and is potentially economical for producing large-scale parts. However, excessive post-HIP shape distortions can reduce its effectiveness and economic advantage, especially for larger parts. A PM-HIP computational model can predict and help mitigate these distortions. However, due to complex deformation mechanisms and thermo-mechanical coupling present in PM-HIP processes, these non-linear computational models sometimes become numerically unstable. The numerical instabilities in these models can lead to very slow convergence or no convergence at all, which often translates to slow and unreliable models. These limitations are more pronounced in large models with complicated geometries. Hence, in this work, an alternative modeling approach is presented that improves numerical stability and computational performance. The presented approach achieves these improvements through approximating the fully coupled thermo-mechanical PM-HIP model as a decoupled model and adding inertial damping to the model’s mechanical part. In conclusion, a comparison with the fully coupled model indicated a slight dip in prediction accuracy (<5% error) but significant improvements in numerical stability (>20 times larger time step size) and computational performance (5-10 times speed-up with less computational resource usage) when using the presented approach.

Hot isostatic pressing↗

Federated Access from DOE Labs to Distributed Storage in the EIC Era of Computing

The Electron Ion Collider (EIC) collaboration and future experiment is a unique scientific ecosystem within Nuclear Physics as the experiment starts right off as a crosscollaboration between Brookhaven National Lab (BNL) & Jefferson Lab (JLab). As a result, this muti-lab computing model tries at best to provide services accessible from anywhere by anyone who is part of the collaboration. While the computing model for the EIC is not finalized, it is anticipated that the computational and storage resources will be made accessible to a wide range of collaborators across the world. The use of federated ID seems to be a critical element to the strategy of providing such services, allowing seamless access to each lab site computing resources. However, providing Federated access to a Federated storage is not a trivial matter and has its share of technical challenges. In this contribution, we focus on the steps we took towards the deployment of a distributed object storage system that integrates with Amazon S3 and Federated ID. We will first cover for and explain the first stage storage solutions provided to the EIC during the detector design phase. Our initial test deployment consisted of Lustre storage using MinIO, hence providing an S3 interface. High Availability load balancers were added later to provide the initial scalability it lacked. Performance of that system will be shown. While this embryonic solution worked well, it had many limitations. Looking ahead, the Ceph object storage is considered a top-of-the-line solution in the storage community - since the Ceph Object Gateway is compatible with the Amazon S3 API out of the box, our next phase will use a native S3 storage. Our Ceph deployment will consist of erasure coded storage nodes to maximize storage potential along with multiple Ceph Object Gateways for redundant access. We will compare performance of our next stage implementations. Finally, we will present how to leverage OpenID Connect with the Ceph Object Gateway’s to enable Federated ID access. We hope this contribution will serve the community needs as we move forward with cross-lab collaborations and the need for Federated ID access to distributed compute facilities.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Modeling Distributed Computing Infrastructures for HEP Applications

Predicting the performance of various infrastructure design options in complex federated infrastructures with computing sites distributed over a wide area network that support a plethora of users and workflows, such as the Worldwide LHC Computing Grid (WLCG), is not trivial. Due to the complexity and size of these infrastructures, it is not feasible to deploy experimental test-beds at large scales merely for the purpose of comparing and evaluating alternate designs. An alternative is to study the behaviours of these systems using simulation. This approach has been used successfully in the past to identify efficient and practical infrastructure designs for High Energy Physics (HEP). A prominent example is the Monarc simulation framework, which was used to study the initial structure of the WLCG. New simulation capabilities are needed to simulate large-scale heterogeneous computing systems with complex networks, data access and caching patterns. A modern tool to simulate HEP workloads that execute on distributed computing infrastructures based on the SimGrid and WRENCH simulation frameworks is outlined. Studies of its accuracy and scalability are presented using HEP as a case-study. Hypothetical adjustments to prevailing computing architectures in HEP are studied providing insights into the dynamics of a part of the WLCG and candidates for improvements.

Horzela, Maximilian↗

Accelerating science: The usage of commercial clouds in ATLAS Distributed Computing

The ATLAS experiment at CERN is one of the largest scientific machines built to date and will have ever growing computing needs as the Large Hadron Collider collects an increasingly larger volume of data over the next 20 years. ATLAS is conducting R&D projects on Amazon Web Services and Google Cloud as complementary resources for distributed computing, focusing on some of the key features of commercial clouds: lightweight operation, elasticity and availability of multiple chip architectures. The proof of concept phases have concluded with the cloud-native, vendoragnostic integration with the experiment’s data and workload management frameworks. Google Cloud has been used to evaluate elastic batch computing, ramping up ephemeral clusters of up to O(100k) cores to process tasks requiring quick turnaround. Amazon Web Services has been exploited for the successful physics validation of the Athena simulation software on ARM processors. We have also set up an interactive facility for physics analysis allowing endusers to spin up private, on-demand clusters for parallel computing with up to 4 000 cores, or run GPU enabled notebooks and jobs for machine learning applications. The success of the proof of concept phases has led to the extension of the Google Cloud project, where ATLAS will study the total cost of ownership of a production cloud site during 15 months with 10k cores on average, fully integrated with distributed grid computing resources and continue the R&D projects.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

RASPA3

RASPA3, a molecular simulation code for computing adsorption and diffusion in nanoporous materials and thermodynamic and transport properties of fluids. It implements force field based classical Monte Carlo/molecular dynamics in various ensembles. RASPA3 is rewritten from the ground up in C++23 with speed and code readability in mind. Transition-matrix Monte Carlo is added to compute the density of states and free energies. The Monte Carlo code for rigid molecules is based on quaternions, and the atomic positions needed in the energy evaluation are recreated from the center of mass position and quaternion orientation. The expanded ensemble methodology for fractional molecules, with a scaling parameter λ between 0 and 1, now also keeps track of analytic expressions of dU/dλ, allowing independent verification of the chemical potential using thermodynamic integration. The source code is freely available under the MIT license on GitHub.

Dubbeldam, David↗

Quantum graph learning and algorithms applied in quantum computer sciences and image classification

Graph and network theory play a fundamental role in quantum computer sciences, including quantum information and computation. Random graphs and complex network theory are pivotal in predicting novel quantum phenomena, where entangled links are represented by edges. Quantum algorithms have been developed to enhance solutions for various network problems, giving rise to quantum graph computing and quantum graph learning (QGL). Here, in this review, we explore graph theory and graph learning methods as powerful tools for quantum computers to generate efficient solutions to problems beyond the reach of classical systems. We delve into the development of quantum complex network theory and its applications in quantum computation, materials discovery, and research. We also discuss quantum machine learning (QML) methodologies for effective image classification using qubits, quantum gates, and quantum circuits. Additionally, the paper addresses the challenges of QGL and algorithms, emphasizing the steps needed to develop flexible QGL solvers. This review presents a comprehensive overview of the fields of QGL and QML, highlights recent advancements, and identifies opportunities for future research.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics, and computer science are typically very hard to tackle in classical computing; quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat a problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. Here, we develop a method, called imaginary-time evolution block encoding (ITE-BE), based on a recent imaginary-time algorithm, which requires no variational parameter optimization, as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as the quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the postselection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block-encoding scheme to allow for a deterministic application of the first layer of the circuit.

Zhong, Dawei [University of Southern California, L↗

Design-to-Deployment Continuum Platform for Microscopes and Computing Ecosystems

Science ecosystems with networked computing systems and physical instruments are increasingly being deployed with a goal to achieve the productivity promised by AI-supported remote automation. In support of these efforts, the virtual infrastructure twins (VITs) have been successfully utilized to develop the orchestration codes for these ecosystems without requiring physical access to expensive instruments, such as electron microscopes. Currently, the utility of such a VIT is severely limited by the computing capacity and capability of the computing system used as its host. Furthermore, codes developed on the VIT typically need to be transferred and refactored for production use, particularly, on high-performance systems with accelerators. In response, we develop a design-to-deployment continuum platform wherein a VIT runs natively on the ecosystem's own computing system, and thereby facilitates the continual in-situ testing and transition of codes for production use. Here, we describe the development and testing of software for remote microscope steering and GPU-based image reconstruction using this platform on a multi-GPU computing system networked to Nion microscopes. We demonstrate a continual transition of steering and reconstruction codes developed under VIT platform to production ecosystem deployment.

Al-Najjar, Anees [Oak Ridge National Laboratory (O↗

Computational Modeling to Advance Novel Medical Isotopes for Radiotheranostics: A DOE-NIH Joint Workshop Executive Summary

The DOE-NIH Joint Workshop on Computational Modeling to Advance Novel Medical Isotopes for Radiotheranostics, held on September 27, 2024, brought together experts from government, academia, and industry to address critical challenges in radionuclide production and clinical translation. Here, the workshop emphasized interdisciplinary collaboration, particularly between the Department of Energy (DOE) and the National Institutes of Health (NIH), to strengthen the domestic isotope supply, streamline regulatory pathways, and further integrate computational tools into radiopharmaceutical therapy (RPT). Key discussions explored the role of AI-driven modeling, machine learning, and digital twin technologies in optimizing dosimetry, dynamically personalizing treatments, and reducing time to clinical adoption. Advances in predictive computational modeling were highlighted as essential for improving radionuclide yield, purity, and synthesis efficiency. Regulatory considerations and equitable access were central themes, with participants advocating for harmonized global standards, adaptive trial designs, and expanded infrastructure for clinical implementation. DOE computational and production infrastructure was emphasized. Future priorities identified include increased investment in radionuclide production infrastructure, expanded workforce development in radiopharmaceutical sciences and computational modeling, and the creation of robust public-private partnerships. The workshop concluded that continued strategic collaboration and sustained resources will be vital for advancing next-generation radiotheranostics, ensuring safe and effective therapies accessible to all patients.

digital twins↗

Integrating DOE ASCR Computing into HEPCloud through GlideinWMS

Fermilab's HEPCloud facility expands the laboratory's computing capacity by provisioning resources beyond the local grid, using GlideinWMS to deliver pilots to where experiments such as CMS and DUNE run. The High-Performance Computing (HPC) facilities of the DOE Office of Advanced Scientific Computing Research (ASCR) are a growing part of that pool. HEPCloud currently provisions NERSC over SSH, but NERSC is moving away from that path as it adopts multi-factor authentication and directs automated access to its Superfacility API and the DOE Integrated Research Infrastructure (IRI) APIs. Maintaining and extending access across the ASCR ecosystem now requires provisioning through these interfaces. This work adds new pilot submission paths to GlideinWMS for the NERSC Superfacility API, IRI, and Globus Compute. Each uses the provisioning model GlideinWMS already applies to batch resources, so experiments can run on ASCR computing resources without changes to their existing workflows. This work finally presents a comparison of the paths to guide which interfaces are best suited for different workflows.

Majumder, Meghanto [U. Houston (main)]↗

Quantum Solver Using Singular Value Decomposition for Computational Fluid Dynamics

Numerical solutions for fluid flow problems are challenging and have been focus of Computational Fluid Dynamics (CFD) research for past several decades. The advent of quantum computing promises exponential speedup in comparison to existing classical methods and alleviate computational constraints posed by CFD problems. Although solutions for most problems of interest in fluid dynamics using quantum computing are distant, recent advances in algorithms, software and hardware provide a path towards realizing this goal. Quantum linear solver algorithms (QLSA) such as Harrow–Hassidim–Lloyd (HHL) and Variational Quantum Linear Solver (VQLS) have been successfully implemented to solve for canonical problems such as Hele-Shaw flow. However, these algorithms still suffer to scale and address problems with ill-conditioned Jacobians. In the current paper, we alleviate these restrictions with a new quantum solver based on Singular Value Decomposition (SVD) and simulate flow past a 2D cylinder. The fidelity of the SVD based quantum solver in predicting the flow past 2D cylinder is computed along with an assessment of errors. Classical and quantum solutions for the flow are compared for different resolutions. Finally, we discuss variation in the solutions based on number of shots used.

Gottiparthi, Kalyan [ORNL] (ORCID:0000000213540255↗

Role of Computational Parameters on Predicting Self-Consistent Residual Stress and Distortion during Wire Arc Additive Manufacturing

Production of three-dimensional metallic parts through integration of an articulated robot and gas metal arc welding, also known as wire arc additive manufacturing (WAAM), can produce large-scale components with moderate geometrical complexity. This technology is particularly appealing due to its high deposition rates, scalability, and cost-effective feedstock compared to other AM processes. Despite its advantages, WAAM adoption is hindered by challenges in ensuring geometric conformity without extensive distortion, defect-free structures, and consistent mechanical properties. Finite element analysis (FEA) is often used to address the challenge of geometrical conformity. As the size of parts increases, the best practices for mesh size and temporal resolution known in the literature become computationally unviable. This research examined the effects of mesh and time-step resolutions during transient FEA of a large-scale (248 layers) metallic part. The impact of computational parameters on the thermal history, displacement, and residual stress distributions were evaluated. The results showed that predicted distortion was consistent across resolutions, while time-step length significantly affected predicted thermal history, and mesh size influenced residual stress distributions. To investigate this relationship further, directionally biased meshes were considered and analyzed. The results indicated that increasing mesh resolution perpendicular to the welding path yielded stress predictions that aligned closely with higher-resolution models while offering substantial computational savings. In conclusion, the significances of this research are related to verification and validation of WAAM models for widespread industrial adoption and pragmatic guidelines for optimizing computation parameters for balancing computational efficiency and predictive accuracy of residual stress and distortion.

Solsbee, Brandon [Univ. of Tennessee, Knoxville, T↗

Comparing computational times for simulations when using PBPK model template and stand-alone implementations of PBPK models

Introduction We previously developed a PBPK model template that consists of a single model “superstructure” with equations and logic found in many physiologically based pharmacokinetic (PBPK) models. Using the template, one can implement PBPK models with different combinations of structures and features. Methods To identify factors that influence computational time required for PBPK model simulations, we conducted timing experiments using various implementations of PBPK models for dichloromethane and chloroform, including template and stand-alone implementations, and simulating four different exposure scenarios. For each experiment, we measured the required computational time and evaluated the impacts of including various model features (e.g., number of output variables calculated) and incorporating various design choices (e.g., different methods for estimating blood concentrations). Results We observed that model implementations that treat body weight and dependent quantities as constant (fixed) parameters can result in a 30% time savings compared with options that treat body weight and dependent quantities as time-varying. We also observed that decreasing the number of state variables by 36% in our PBPK model template led to a decrease of 20–35% in computational time. Other factors, such as the number of output variables, the method for implementing conditional statements, and the method for estimating blood concentrations, did not have large impacts on simulation time. In general, simulations with PBPK model template implementations of models required more time than simulations with stand-alone implementations, but the flexibility and (human) time savings in preparing and reviewing a model implemented using the PBPK model template may justify the increases in computational time requirements. Conclusion Our findings concerning how PBPK model design and implementation decisions impact computational speed can benefit anyone seeking to develop, improve, or apply a PBPK model, with or without the PBPK model template.

Bernstein, Amanda S.↗

Capturing the Page curve and entanglement dynamics of black holes in quantum computers

Quantum computers are emerging technologies expected to become important tools for exploring various aspects of fundamental physics in the future. Therefore, we pose the question of whether quantum computers can help us to study the Page curve and the black hole information dynamics, which has been a key focus in fundamental physics. In this regard, we rigorously examine the qubit transport model, a toy qubit model of black hole evaporation on IBM’s superconducting quantum computers, to shed light on this question. Specifically, we implement the quantum simulation of the scrambling dynamics in black holes using an efficient random unitary circuit. Furthermore, we employ the swap-based many-body interference protocol and the randomized measurement protocol to measure the entanglement entropy of Hawking radiation qubits in this model. Finally, by incorporating quantum error mitigation techniques into our challenging implementation of entanglement entropy measurement protocols on the IBM quantum hardware, we accurately determine the Rényi entropy in the qubit transport model, thus showcasing the utility of quantum computers for future investigations of complex quantum systems.

97 MATHEMATICS AND COMPUTING↗

Digital quantum magnetism on a trapped-ion quantum computer

Digital quantum matter—realized when discrete quantum gates approximate continuous time evolution—is susceptible to heating into chaotic, structureless states. If digitization errors are adequately suppressed, a long-lived transient regime of approximately energy-conserving dynamics can be observed on gate-based quantum computers. Conservation of energy, in turn, enables the exploration of a wide variety of complex behaviours observed in equilibrium systems, ranging from the non-trivial microscopic origins of thermalization itself to the stabilization of effective models hosting exotic emergent properties. Here we use Quantinuum’s H2 quantum computer to simulate digitized dynamics of the quantum Ising model, suppressing digitization errors well enough to observe thermalization on timescales that severely challenge classical simulation methods. Relaxation of an inhomogeneous state reveals an emergent hydrodynamics owing to approximate energy conservation and we compute the associated diffusion constant. By reprogramming our simulations to take place on a triangular lattice with periodic boundary conditions, we observe thermalization consistent with emergent gauge and topological constraints resulting from lattice frustration. Furthermore, our results were enabled by continued advances in two-qubit gate quality (native partial entangler fidelities of 99.94(1)%) and establish digital quantum computers as powerful tools for studying (effectively) continuous-time dynamics.

Information theory and computation↗

Simulating long-time evolution of driven many-body systems with next generation quantum computers (Final Report)

This project is focused on performing the best science possible on current generation quantum computers. As such, we have focused on developing techniques that involve robust algorithms that are either insensitive to noise, or are extremely low depth. We also have worked on determining topological properties and employing the robustness of topology to noise to allow for robust quantum computation. The ultimate goal is to be able to do new science on quantum computers that cannot be achieved on classical computers. The main effort of the work we have completed is on time-evolution of quantum systems and robust calculation of properties of systems enabled by being able to perform time evolution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accelerating computing for the future electric grid (CRADA Final Report)

As a participant in the Cyclotron Road Lab-Embedded Entrepreneurship Program (LEEP), Vellex Computing, Inc. has successfully validated the "Vellex Computing Stack," a breakthrough Analog Neural Computer (ANC) specifically designed for high-performance edge optimization. This project achieved critical milestones in mixed-signal circuit stability and software-hardware co-design, directly addressing national priorities in semiconductor resiliency. The success of this work is deeply rooted in the support from the Cyclotron Road LEEP, which provided the essential "hard tech" runway—funding, mentorship, and access to Lawrence Berkeley National Laboratory’s world-class characterization facilities—allowing Vellex to overcome the "Valley of Death" often faced by deep-tech hardware startups. By leveraging LBNL’s advanced testing infrastructure, Vellex was able to rigorously benchmark the ANC architecture against state-of-the-art digital solutions, a feat that would have been resource-prohibitive independently. This collaboration has not only advanced American leadership in analog computing but has also matured Vellex’s technology to a stage ripe for private sector commercialization.

24 POWER TRANSMISSION AND DISTRIBUTION↗