Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer hardware”

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,423 records · Page 79

Zero and Finite Temperature Quantum Simulations Powered by Quantum Magic

We introduce a quantum information theory-inspired method to improve the characterization of many-body Hamiltonians on near-term quantum devices. We design a new class of similarity transformations that, when applied as a preprocessing step, can substantially simplify a Hamiltonian for subsequent analysis on quantum hardware. By design, these transformations can be identified and applied efficiently using purely classical resources. In practice, these transformations allow us to shorten requisite physical circuit-depths, overcoming constraints imposed by imperfect near-term hardware. Importantly, the quality of our transformations is t u n a b l e : we define a 'ladder' of transformations that yields increasingly simple Hamiltonians at the cost of more classical computation. Using quantum chemistry as a benchmark application, we demonstrate that our protocol leads to significant performance improvements for zero and finite temperature free energy calculations on both digital and analog quantum hardware. Specifically, our energy estimates not only outperform traditional Hartree-Fock solutions, but this performance gap also consistently widens as we tune up the quality of our transformations. In short, our quantum information-based approach opens promising new pathways to realizing useful and feasible quantum chemistry algorithms on near-term hardware.

Physics↗

Influence of turbulence and thermophysical fluid properties on cavitation erosion predictions in channel flow geometries

Cavitation and cavitation-induced erosion have been observed in fuel injectors in regions of high acceleration and low pressure. Although these phenomena can have a large influence on the performance and lifetime of injector hardware, questions still remain on how these physics should be accurately and efficiently represented within a computational fluid dynamics model. While several studies have focused on the validation of cavitation predictions within canonical and realistic injector geometries, it is not well documented what influence the numerical and physical parameters selected to represent turbulence and phase change will have on the predictions for cavitation erosion propensity and severity. In this work, a range of numerical and physical parameters are evaluated within the mixture modeling approach in CONVERGE to understand their influence on predictions of cavitation, condensation and erosion. Particular attention is paid to grid resolution, turbulence model and near-wall treatment, fuel surrogate properties, and non-condensable gas content. Assessment of cavitation predictions are conducted through comparison of measured and predicted mass flow rates and cavitation probability distributions for flow through a channel with a sharp inlet. Predictions for hydrodynamic impact loading and cavitation erosion are compared with the experimentally measured incubation period and critical site for erosion. Based on these findings, recommendations are provided for modeling turbulent cavitating flows, using the single fluid mixture modeling approach, to improve predictions for cavitation-induced erosion. In particular, to capture the fluid dynamic phenomena characterizing cavitation cloud formation, development and shedding, a Large Eddy simulation with grid resolution as fine as 2.50 μm is recommended. The assumed concentration of non-condensable gas content is observed to have a strong influence on the predicted cavitation erosion severity, which motivates the need for dissolved gas concentration measurements for future cavitation erosion experimental studies. Using the best practices established in this work, good agreement is achieved between the measured and predicted cavitation parameters, as well as the critical site for cavitation-induced erosion.

Magnotti, Gina Maureen↗

Smart Hydro: AI Applications

This presentation provides an overview of artificial intelligence (AI) applications in hydropower.

13 HYDRO ENERGY↗

Development of Variational Guiding Center Algorithms for Parallel Calculations in Experimental Magnetic Equilibria

Structure-preserving algorithms obtained via discrete variational principles exhibit strong promise for the calculation of guiding center test particle trajectories. The non-canonical Hamiltonian structure of the guiding center equations forms a novel and challenging context for geometric integration. To demonstrate the practical relevance of these methods, a prototypical variational midpoint algorithm is applied to an experimental magnetic equilibrium. The stability characteristics, conservation properties, and implementation requirements associated with the variational algorithms are addressed. Furthermore, computational run time is reduced for large numbers of particles by parallelizing the calculation on GPU hardware.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Adding Fault Tolerance to NPB Benchmarks Using ULFM

In the world of high-performance computing, fault tolerance and application resilience are becoming some of the primary concerns because of increasing hardware failures and memory corruptions. While the research community has been investigating various options, from system-level solutions to application-level solutions, standards such as the Message Passing Interface (MPI) are also starting to include such capabilities. The current proposal for MPI fault tolerant is centered around the User-Level Failure Mitigation (ULFM) concept, which provides means for fault detection and recovery of the MPI layer. This approach does not address application-level recovery, which is currently left to application developers. In this work, we present a mod- ification of some of the benchmarks of the NAS parallel benchmark (NPB) to include support of the ULFM capabilities as well as application-level strategies and mechanisms for application-level failure recovery. As such, we present: (i) an application-level library to checkpoint and restore data, (ii) extensions of NPB benchmarks for fault tolerance based on different strategies, (iii) a fault injection tool, and (iv) some preliminary results that show the impact of such fault tolerant strategies on the application execution.

Parchman, Zachary W↗

S&TR Preview: Preparing to Scale Sierra

Application developers are partnering with supercomputing experts and hardware vendors to ready a stable of mission-critical applications for the next generation of computing architectures.

97 MATHEMATICS AND COMPUTING↗

Performance-Portable Particle Advection with VTK-m

Particle advection is the fundamental kernel behind most vector field visualization methods. Yet, the efficient parallel computation of large amounts of particle traces remains challenging. This is exacerbated by the variety of hardware trends in today's HPC arena, including increasing core counts in classical CPUs, many-core designs such as the Intel Xeon Phi, and massively parallel GPUs. The dedicated optimization of a particle advection kernel for each individual target architecture is both time-consuming and error prone. In this paper, we propose a performance-portable algorithm for particle advection. Our algorithm is based on the recently introduced VTK-m system and chiefly relies on its device adapter abstraction. We demonstrate the general portability of our implementation across a wide variety of hardware. Finally, our evaluation shows that our hardware-agnostic algorithm has comparable performance to hardware-specific algorithms.

Pugmire, Dave↗

DS-TIDE: Harnessing Dynamical Systems for Efficient Time-Independent Differential Equation Solving

Time-Independent Differential Equations (TIDEs) are central to modeling equilibrium behavior across a wide range of scientific and engineering domains, from electrostatics to porous media flow. Conventional numerical solvers offer reliable solutions but incur significant computational costs due to fine-grained discretization and iterative procedures. Machine learning-based approaches address this by replacing iterative solving processes with one-time inference; however, their sophisticated models require extensive training resources that often exceed those of traditional solvers. Consequently, designing a TIDE solver that achieves high accuracy, broad applicability, and exceptional computational efficiency remains a fundamental challenge. In this paper, we propose DS-TIDE, a novel hardware solver that is inspired by, and subsequently leverages, the intrinsic connection between Dynamical Systems (DS) and Differential Equations (DEs) to efficiently and accurately solve TIDEs. DS-TIDE employs a CMOS-compatible DS-based processor, whose physical states evolve under carefully designed DE-driven dynamics and naturally converge to equilibrium -- the solution of the target TIDE -- within ~1µs on a ~1-watt DS-TIDE processor. To enhance expressivity, DS-TIDE incorporates Heterogeneous Dynamics with Temporal Layering (HDTL), which solves TIDEs through a three-stage DS evolution -- conditioning, solving, and decoding -- each governed by specialized dynamics. The entire evolution process is analogous to an infinitely deep neural network temporally unrolled, offering the system the capability of representing complex equations. Furthermore, DS-TIDE is equipped with an on-device DS-DE Auto-Alignment mechanism that dynamically adapts intrinsic hardware dynamics within milliseconds, effectively aligning the system’s dynamics to diverse target DEs. Experimental results across TIDEs from a wide range of scientific and engineering domains demonstrate that DS-TIDE achieves ~10^3× speedup, ~10^5× energy savings, and competitive or superior accuracy compared to state-of-the-art numerical and ML-based solvers.

Liu, Chuan↗

Complexity in scalable computing.

The rich history of scalable computing research owes much to a rapid rise in computing platform scale in terms of size and speed. As platforms evolve, so must algorithms and the software expressions of those algorithms. Unbridled growth in scale inevitably leads to complexity. This special issue grapples with two facets of this complexity: scalable execution and scalable development. The former results from efficient programming of novel hardware with increasing numbers of processing units (e.g., cores, processors, threads or processes). The latter results from efficient development of robust, flexible software with increasing numbers of programming units (e.g., procedures, classes, components or developers). The progression in the above two parenthetical lists goes from the lowest levels of abstraction (hardware) to the highest (people). This issue's theme encompasses this entire spectrum. The lead author of each article resides in the Scalable Computing Research and Development Department at Sandia National Laboratories in Livermore, CA. Their co-authors hail from other parts of Sandia, other national laboratories and academia. Their research sponsors include several programs within the Department of Energy's Office of Advanced Scientific Computing Research and its National Nuclear Security Administration, along with Sandia's Laboratory Directed Research and Development program and the Office of Naval Research. The breadth of interests of these authors and their customers reflects in the breadth of applications this issue covers. This article demonstrates how to obtain scalable execution on the increasingly dominant high-performance computing platform: a Linux cluster with multicore chips. The authors describe how deep memory hierarchies necessitate reducing communication overhead by using threads to exploit shared register and cache memory. On a matrix-matrix multiplication problem, they achieve up to 96% parallel efficiency with a three-part strategy: intra-node multithreading, non-blocking inter-node message passing, and a dedicated communications thread to facilitate concurrent communications and computations. On a quantum chemistry problem, they spawn multiple computation threads and communication threads on each node and use one-sided communications between nodes to minimize wait times. They reduce software complexity by evolving a multi-threaded factory pattern in C++ from a working, message-passing program in C.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

HPC application performance and scaling : understanding trends and future challenges with application benchmarks on past, present and future Tri-Lab computing systems.

In this paper HPC architectural characteristics and their impact on application performance and scaling are investigated. Performance data gathered over several generations of very large HPC systems like: ASC Red Storm, ASC Purple, and a large InfiniBand cluster - Red Sky, are analyzed. As the number of cache coherent cores and number of NUMA domains at a compute node keeps increasing, we analyze their impact with a few simple benchmarks and several applications. We present bottlenecks and remedies examining production applications. We conclude with preliminary early-hardware performance data from the ASC Cielo, a petaFLOPS class future capability system.

99 GENERAL AND MISCELLANEOUS↗

GPU COMPUTING FOR PARTICLE TRACKING

This is a feasibility study of using a modern Graphics Processing Unit (GPU) to parallelize the accelerator particle tracking code. To demonstrate the massive parallelization features provided by GPU computing, a simplified TracyGPU program is developed for dynamic aperture calculation. Performances, issues, and challenges from introducing GPU are also discussed. General purpose Computation on Graphics Processing Units (GPGPU) bring massive parallel computing capabilities to numerical calculation. However, the unique architecture of GPU requires a comprehensive understanding of the hardware and programming model to be able to well optimize existing applications. In the field of accelerator physics, the dynamic aperture calculation of a storage ring, which is often the most time consuming part of the accelerator modeling and simulation, can benefit from GPU due to its embarrassingly parallel feature, which fits well with the GPU programming model. In this paper, we use the Tesla C2050 GPU which consists of 14 multi-processois (MP) with 32 cores on each MP, therefore a total of 448 cores, to host thousands ot threads dynamically. Thread is a logical execution unit of the program on GPU. In the GPU programming model, threads are grouped into a collection of blocks Within each block, multiple threads share the same code, and up to 48 KB of shared memory. Multiple thread blocks form a grid, which is executed as a GPU kernel. A simplified code that is a subset of Tracy++ [2] is developed to demonstrate the possibility of using GPU to speed up the dynamic aperture calculation by having each thread track a particle.

42 ENGINEERING↗

Self-stabilizing Connected Components

For the problem of computing the connected components of a graph, this paper considers the design of algorithms that are resilient to transient hardware faults, like bit Hips. More specifically, it applies the technique of self-stabilization. A system is self-stabilizing if, when starting from a valid or invalid state, it is guaranteed to reach a valid state after a finite number of steps. Therefore on a machine subject to a transient fault, a self-stabilizing algorithm could recover if that fault caused the system to enter an invalid state. We give a comprehensive analysis of the valid and invalid states during label propagation and derive algorithms to verify and correct the invalid state. The self-stabilizing label-propagation algorithm performs O (V log V) additional computation and requires O (V) additional storage over its conventional counterpart (and, as such, does not increase asymptotic complexity over conventional label propagation). When run against a battery of simulated fault injection tests, the self-stabilizing label propagation algorithm exhibits more resilient behavior than a triple modular redundancy (TMR) based fault-tolerant algorithm in 80% of cases. From a performance perspective, it also outperforms TMR as it requires fewer iterations in total. Beyond the fault tolerance properties of self-stabilizing label-propagation, we believe, they are useful from the theoretical perspective; and may have other use-cases.

Sao, Piyush↗

IRIS: A Performance-Portable Framework for Cross-Platform Heterogeneous Computing

From edge to exascale, computer architectures are becoming more heterogeneous and complex. The systems typically have fat nodes, with multicore CPUs and multiple hardware accelerators such as GPUs, FPGAs, and DSPs. This complexity is causing a crisis in programming systems and performance portability. Several programming systems are working to address these challenges, but the increasing architectural diversity is forcing software stacks and applications to be specialized for each architecture. As we show, all of these approaches critically depend on their software framework for discovery, execution, scheduling, and data orchestration. To address this challenge, we believe that a more agile and proactive software framework is essential to increase performance portability and improve user productivity. To this end, we have designed and implemented IRIS: a performance-portable framework for cross-platform heterogeneous computing. IRIS can discover available resources, manage multiple diverse programming platforms (e.g., CUDA, Hexagon, HIP, Level Zero, OpenCL, OpenMP) simultaneously in the same execution, respect data dependencies, orchestrate data movement proactively, and provide for user-configurable scheduling. To simplify data movement, IRIS introduces a shared virtual device memory with relaxed consistency among different heterogeneous devices. IRIS also adds an automatic kernel workload partitioning technique using the polyhedral model so that it can resize kernels for a wide range of devices. Our evaluation on three architectures, ranging from Qualcomm Snapdragon to a Summit supercomputer node, shows that IRIS improves portability across a wide range of diverse heterogeneous architectures with negligible overhead.

97 MATHEMATICS AND COMPUTING↗

Roadrunner Supercomputer Breaks the Petaflop Barrier

At 3:30 a.m. on May 26, 2008, Memorial Day, the "Roadrunner" supercomputer exceeded a sustained speed of 1 petaflop/s, or 1 million billion calculations per second. The sustained performance makes Roadrunner more than twice as fast as the current number 1 system on the TOP500 list. The best sustained performance to date is 74.5% efficiency, 1.026 petaflop/s. "Petaflop/s" is computer jargon—peta signifying the number 1 followed by 15 zeros (sometimes called a quadrillion) and flop/s meaning "double-precision floating point operations per second." Los Alamos held the fastest supercomputer title in 1993 with the Thinking Machines CM-5, and inaugurated the supercomputer era, assisting in the development of the Cray-1 in 1976. The Laboratory and IBM go all the way back to the first card-programmable calculators, used at Los Alamos in 1949. Los Alamos also housed serial number 1 of the IBM 704 in 1956. The Roadrunner supercomputer, developed by IBM in partnership with the Laboratory and the National Nuclear Security Administration, uses commercially available hardware, including aspects of commercial game console and graphics technologies. Because of its off-the-shelf components, the computer costs significantly less than a one-of-a-kind machine. It also uses a Linux operating system. The secret to its record-breaking performance is a unique hybrid design. Each compute node in this cluster consists of two AMD OpteronTM dual-core processors plus four PowerXCell 8iTM processors used as computational accelerators. The accelerators used in Roadrunner are a special IBM-developed variant of the Cell processor used in the Sony PlayStation® 3. The node-attached Cell accelerators are what make Roadrunner different than typical clusters. The Lab and IBM have been working on Roadrunner since 2006, but collaboration on Cell dates back to 2002. The first phase of the project included delivery of an initial Opteron-only cluster that operates at a speed of 71 teraflop/s. This initial system has been in full production at Los Alamos for almost a year, and Laboratory researchers are using this machine for classified weapons applications. The full-scale Roadrunner machine operates more than 10 times faster than the current installed system. Phase 2 of the Roadrunner project was completed in October 2007. Two external assessments, one by NNSA headquarters and one by an independent team of high performance computing experts, evaluated the machine's potential use for Laboratory applications, the Laboratory's ability to successfully manage the computing system, IBM's ability to deliver the product, and whether computer programs could be adapted to the new system. Based on the positive outcome of the assessments, the Laboratory and NNSA decided to pursue the final phase of the Roadrunner project. The powerful cluster of nodes will process information enabling the Laboratory to use Roadrunner for advanced physics and predictive simulations of complex scientific processes. Weapons science applications that can be processed by Roadrunner are applicable to all three of the U.S. Department of Energy weapons laboratories. The machine will also be well equipped to tackle the intricacies of modeling processes, ranging from the biomolecular to the cosmological. In addition, Los Alamos intends to purchase additional Roadrunner resources to support open science and technology applications. The full-scale Roadrunner system, named in honor of New Mexico's speedy state bird, broke the performance record at IBM's Poughkeepsie, New York, facility. The full machine will be moved to Los Alamos beginning in July and housed in the Nicholas Metropolis Center for Modeling and Simulation. The first computing applications are expected to begin running on the machine in January 2009. The cost of all phases of the Roadrunner project is approximately $120 million. More than 200 Laboratory employees have been involved in this effort. For more information about Roadrunner at Los Alamos National Laboratory, see the Roadrunner website at http://www.lanl.gov/roadrunner.

CELL BASED PROCESSOR↗

US-VISIT Independent Verification and Validation Project: Test Bed Establishment Report

This document describes the computational and data systems available at the Lawrence Livermore National Laboratory for use on the US-VISIT Independent Verification and Validation (IV&V) project. This system - composed of data, software and hardware - is designed to be as close as a representation of the operational ADIS system as is required to verify and validate US-VISIT methodologies. It is not required to reproduce the computational capabilities of the enterprise-class operational system. During FY10, the test bed was simplified from the FY09 version by reducing the number of database host computers from three to one, significantly reducing the maintenance and overhead while simultaneously increasing system throughput. During the current performance period, a database transfer was performed as a set of Data Pump Export files. The previous RMAN backup from 2007 required the availability of an AIX system which is not required when using data pump. Due to efficiencies in the new system and process, loading of the database refresh was able to be accomplished in a much shorter time frame than was previously required. The FY10 Oracle Test Bed now consists of a single Linux platform hosting two Oracle databases including the 2007 copy as well as the October 2010 refresh.

42 ENGINEERING↗

Performance Analysis of Traditional and Data-Parallel Primitive Implementations of Visualization and Analysis Kernels

Measurements of absolute runtime are useful as a summary of performance when studying parallel visualization and analysis methods on computational platforms of increasing concurrency and complexity. We can obtain even more insights by measuring and examining more detailed measures from hardware performance counters, such as the number of instructions executed by an algorithm implemented in a particular way, the amount of data moved to/from memory, memory hierarchy utilization levels via cache hit/miss ratios, and so forth. This work focuses on performance analysis on modern multi-core platforms of three different visualization and analysis kernels that are implemented in different ways: one is "traditional", using combinations of C++ and VTK, and the other uses a data-parallel approach using VTK-m. Our performance study consists of measurement and reporting of several different hardware performance counters on two different multi-core CPU platforms. The results reveal interesting performance differences between these two different approaches for implementing these kernels, results that would not be apparent using runtime as the only metric.

97 MATHEMATICS AND COMPUTING↗

Designing FAIR Workflows at OLCF: Building Scalable and Reusable Ecosystems for HPC Science

High Performance Computing (HPC) centers, such as the Oak Ridge Leadership Computing Facility (OLCF), provide advanced infrastructure that enables scientific research at extreme scale. These centers operate with unique hardware configurations, specialized software environments, and elevated security re quirements that differ substantially from what most users encounter on their local systems. As a result, users often develop customized digital artifacts that are tightly coupled to the specific configuration of a given HPC center. Although necessary, this practice can lead to significant duplication of effort as multiple users independently create similar solutions to common problems.

97 MATHEMATICS AND COMPUTING↗

ESnet-JLab FPGA Accelerated Transport (control plane) [EJFAT (udplbd2)] v2.0

The ESnet-JLab FPGA Accelerated Transport system is a solution for streaming high-speed scientific measurement data from Data Acquisition Systems (DAQs) to high-performance computing facilties. It is generally compatible with many science workflows, and makes no assumptions about the specifics of any particular experiment. This program (udplbd version 2) implements the control plane for the system. It is responsible for programming network forwarding rules into the data plane (implemented by the hardware designed named udplb, described separately). It also implements the control loop necessary to match up offered workload with available capacity on high-performance compute nodes.

Howard, Derek [Lawrence Berkeley National Laborato↗