Search NASA⌕ Search

SEARCH · Search NASA

Results for “Processors”

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 343 records · Page 19

Summer Internship Report: ARA2 Benchmarking

Over the past decade, the RISC-V Instruction Set Architecture (ISA) has emerged as a significant player in both academic and industrial processor design due to its open-source nature, modular extension system, and versatility across domains ranging from microcontrollers to high-performance computing (HPC). One of its most important recent advancements is the RISC-V Vector Extension (RVV), which enables explicit data-level parallelism through vector registers and vectorized instructions. Unlike traditional SIMD (Single Instruction, Multiple Data) architectures that fix vector lengths at design time, RVV uses the concept of VLEN (vector register length) as a hardware-independent parameter and allows software to adapt dynamically to the available vector width. This flexible approach ensures portability across implementations while enabling scalable performance. The ARA2 core is a parameterizable RISC-V vector processor developed at the Integrated Systems Lab at ETH Zürich and the University of Bologna. Designed as a tightly-coupled accelerator to a scalar RISC-V core, ARA2 implements the RVV 1.0 specification and offers tunable architectural parameters such as the number of vector lanes, VLEN, and cache sizes.

97 MATHEMATICS AND COMPUTING↗

Application of Accelerator Technology to Quantum Information Science

The intersection of accelerator and quantum information science (QIS) offers a unique platform to advance both fields through shared technology and infrastructure. This talk will discuss the synergies which exist between these two vastly different but complementary domains. We demonstrate how we leverage pre-existing infrastructure and knowledge to perform research and development which helps to realize dramatic improvements in both 10 km long accelerators and 10 cm large quantum processors. We will explore niobium superconducting radio-frequency (SRF) cavities, a highly advanced technology that excels in efficiently storing electromagnetic energy, enabling ultra-long photon lifetimes critical for quantum processors and facilitating the characterization of quantum materials with parts-per-billion precision. We will also discuss how advancements in superconducting materials, cryogenic systems, and control techniques help to reduce cost and improve performance for both quantum systems and particle accelerators. Moreover, we will discuss cross-disciplinary applications such as dark-matter searches and demonstrate the convergence of these fields in addressing fundamental scientific questions.

Bafia, Daniel [Fermilab]↗

A volumetric framework for quantum computer benchmarks

We propose a very large family of benchmarks for probing the performance of quantum computers. We call them volumetric benchmarks (VBs) because they generalize IBM's benchmark for measuring quantum volume \cite{Cross18}. The quantum volume benchmark defines a family of square circuits whose depth d and width w are the same. A volumetric benchmark defines a family of rectangular quantum circuits, for which d and w are uncoupled to allow the study of time/space performance trade-offs. Each VB defines a mapping from circuit shapes — ( w , d ) pairs — to test suites C ( w , d ) . A test suite is an ensemble of test circuits that share a common structure. The test suite C for a given circuit shape may be a single circuit C , a specific list of circuits { C 1 … C N } that must all be run, or a large set of possible circuits equipped with a distribution P r ( C ) . The circuits in a given VB share a structure, which is limited only by designers' creativity. We list some known benchmarks, and other circuit families, that fit into the VB framework: several families of random circuits, periodic circuits, and algorithm-inspired circuits. The last ingredient defining a benchmark is a success criterion that defines when a processor is judged to have ``passed'' a given test circuit. We discuss several options. Benchmark data can be analyzed in many ways to extract many properties, but we propose a simple, universal graphical summary of results that illustrates the Pareto frontier of the d vs w trade-off for the processor being benchmarked.

97 MATHEMATICS AND COMPUTING↗

Parallelization techniques for quantum simulation of fermionic systems

Mapping fermionic operators to qubit operators is an essential step for simulating fermionic systems on a quantum computer. We investigate how the choice of such a mapping interacts with the underlying qubit connectivity of the quantum processor to enable (or impede) parallelization of the resulting Hamiltonian-simulation algorithm. It is shown that this problem can be mapped to a path coloring problem on a graph constructed from the particular choice of encoding fermions onto qubits and the fermionic interactions onto paths. The basic version of this problem is called the weak coloring problem. Taking into account the fine-grained details of the mapping yields what is called the strong coloring problem, which leads to improved parallelization performance. A variety of illustrative analytical and numerical examples are presented to demonstrate the amount of improvement for both weak and strong coloring-based parallelizations. Our results are particularly important for implementation on near-term quantum processors where minimizing circuit depth is necessary for algorithmic feasibility.

97 MATHEMATICS AND COMPUTING↗

Adaptive variational simulation for open quantum systems

Emerging quantum hardware provides new possibilities for quantum simulation. While much of the research has focused on simulating closed quantum systems, the real-world quantum systems are mostly open. Therefore, it is essential to develop quantum algorithms that can effectively simulate open quantum systems. Here we present an adaptive variational quantum algorithm for simulating open quantum system dynamics described by the Lindblad equation. The algorithm is designed to build resource-efficient ansatze through the dynamical addition of operators by maintaining the simulation accuracy. We validate the effectiveness of our algorithm on both noiseless simulators and IBM quantum processors and observe good quantitative and qualitative agreement with the exact solution. We also investigate the scaling of the required resources with system size and accuracy and find polynomial behavior. Our results demonstrate that near-future quantum processors are capable of simulating open quantum systems.

97 MATHEMATICS AND COMPUTING↗

AthenaK: A Performance-portable Version of the Athena++ Adaptive Mesh Refinement Framework

We describe AthenaK: a new implementation of the Athena++ block-based adaptive mesh refinement framework using the Kokkos programming model. Finite volume methods for Newtonian, special relativistic, and general relativistic (GR) hydrodynamics and magnetohydrodynamics (MHD), and GR-radiation hydrodynamics and MHD, as well as a module for evolving Lagrangian tracer or charged test particles (e.g., cosmic rays) are implemented using the framework. In two companion papers, we describe (1) a new solver for the Einstein equations based on the Z4c formalism, and (2) a GRMHD solver in dynamical spacetimes also implemented using the framework, enabling new applications in numerical relativity. By adopting Kokkos, the code can be run on virtually any hardware, including CPUs, GPUs from multiple vendors, and emerging Advanced RISC Machine processors. AthenaK shows excellent performance and weak scaling, achieving over 1 billion cell updates per second for hydrodynamics in three dimensions on a single NVIDIA Grace Hopper processor. It does this with a typical parallel efficiency of 80% on 65,536 AMD GPUs on the OLCF Frontier system. Such performance portability enables AthenaK to leverage modern exascale computing systems for challenging applications in astrophysical fluid dynamics, numerical relativity, and multimessenger astrophysics.

79 ASTRONOMY AND ASTROPHYSICS↗

Comparing the Performance of Julia on CPUs versus GPUs and Julia-MPI versus Fortran-MPI: a case study with MPAS-Ocean (Version 7.1)

Abstract. Some programming languages are easy to develop at the cost of slow execution, while others are fast at runtime but much more difficult to write. Julia is a programming language that aims to be the best of both worlds – a development and production language at the same time. To test Julia's utility in scientific high-performance computing (HPC), we built an unstructured-mesh shallow water model in Julia and compared it against an established Fortran-MPI ocean model, the Model for Prediction Across Scales–Ocean (MPAS-Ocean), as well as a Python shallow water code. Three versions of the Julia shallow water code were created: for single-core CPU, graphics processing unit (GPU), and Message Passing Interface (MPI) CPU clusters. Comparing identical simulations revealed that our first version of the Julia model was 13 times faster than Python using NumPy, where both used an unthreaded single-core CPU. Further Julia optimizations, including static typing and removing implicit memory allocations, provided an additional 10–20× speed-up of the single-core CPU Julia model. The GPU-accelerated Julia code was almost identical in terms of performance to the MPI parallelized code on 64 processes, an unexpected result for such different architectures. Parallelized Julia-MPI performance was identical to Fortran-MPI MPAS-Ocean for low processor counts and ranges from 2× faster to 2× slower for higher processor counts. Our experience is that Julia development is fast and convenient for prototyping but that Julia requires further investment and expertise to be competitive with compiled codes. We provide advice on Julia code optimization for HPC systems.

54 ENVIRONMENTAL SCIENCES↗

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↗

Quantum Simulation of Field Theories Without State Preparation

We propose an algorithm for computing real-time observables using a quantum processor while avoiding the need to prepare the full quantum state. This reduction in quantum resources is achieved by classically sampling configurations in imaginary-time using standard lattice field theory. These configurations can then be passed to quantum processor for time-evolution. This method encounters a signal-to-noise problem which we characterize, and we demonstrate the application of standard lattice QCD methods to mitigate it.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Method and apparatus for scheduling in a non-uniform compute device

A data processing apparatus, and method of operation thereof, for executing instructions. The apparatus includes one or more host processors, each having a first processing unit, and a multi-level memory system. One or more levels of the memory system are tightly coupled to a corresponding second processing unit. At least one of the host processors includes an instruction scheduler that routes instructions selectively to at least one of the first and second processing units, dependent upon the availability of the processing units and the location, within the memory system, of data to be used when executing the instructions.

97 MATHEMATICS AND COMPUTING↗

Dynamic cache bypassing

A processing system fills a memory access request for data from a processor core by bypassing a cache when a write congestion condition is detected, and when transferring the data to the cache would cause eviction of a dirty cache line. The cache is bypassed by transferring the requested data to the processor core or to a different cache. Accordingly, the processing system can temporarily bypass the cache storing the dirty cache line when filling a memory access request, thereby avoiding the eviction and write back to main memory of a dirty cache line when a write congestion condition exists.

97 MATHEMATICS AND COMPUTING↗

Real-time series resistance monitoring in photovoltaic systems

A device includes at least one processor configured to determine a target irradiance value based on an operating current value of a photovoltaic (PV) device, a short-circuit current value of the PV device, and an operating irradiance value of the PV device. The at least one processor is also configured to determine an open-circuit voltage value of the PV device at the target irradiance value, determine a series resistance value of the PV device based on an operating voltage value of the PV device, the operating current value, and the open-circuit voltage value at the target irradiance value, and execute at least one programmatic action based on the series resistance value.

14 SOLAR ENERGY↗

Dynamic frequency control in power networks

Node controllers in power distribution networks in accordance with embodiments of the invention enable dynamic frequency control. One embodiment includes a node controller comprising a network interface a processor; and a memory containing a frequency control application; and a plurality of node operating parameters describing the operating parameters of a node, where the node is selected from a group consisting of at least one generator node in a power distribution network wherein the processor is configured by the frequency control application to calculate a plurality of updated node operating parameters using a distributed process to determine the updated node operating parameter using the node operating parameters, where the distributed process controls network frequency in the power distribution network; and adjust the node operating parameters.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Coordinated net-load management

A management device includes at least one processor communicatively coupled to at least one energy resource controller controlling at least one energy resource and to at least one deferrable load controller controlling power to at least one deferrable load. The is configured to receive an indication, determined based on a frequency value of an electrical network and a nominal frequency value, that a frequency anomaly event has occurred. Responsive to receiving the indication that the frequency anomaly event has occurred, the processor is also configured to determine, for at least one of the energy resource and the deferrable load, based on the frequency value, the nominal frequency value, and a power value of the electrical network, a respective power command, and cause at least one of the at least one energy resource and the at least one deferrable load to modify operation based on the respective power command.

42 ENGINEERING↗

Network-cognizant voltage droop control

The present disclosure provides techniques for network-cognizant droop control in power systems, such as a power distribution system. An example device includes a processor configured to determine, based on (i) a model representing a structure of a power system that includes a plurality of energy resources and (ii) an indication of predicted uncontrollable power injections in the power system, for each controllable energy resource in the plurality of energy resources, a respective value of a first droop coefficient and a respective value of a second droop coefficient. The processor may be further configured to cause at least one controllable energy resource in the plurality of energy resources to modify an output power of the at least one energy resource based on the respective value of the first droop coefficient and the respective value of the second droop coefficient.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Power system model parameter conditioning tool

A power system model parameter conditioning tool including a server control processor in communication with phasor measurement unit monitored data records of multiple disturbance events, a model calibration unit providing event screening, power system model simulation, and simultaneous tuning of model parameters. The model calibration performing a simulation using default model parameters, the processor comparing the simulation results to the monitored data. If the prediction is within threshold, then terminating conditioning; else performing parameter identifiability analysis to determine differing effects of various model parameters on power system model accuracy, selecting a parameter set causing a degradation in power system model prediction, and updating the default model parameters corresponding to members of the parameter set with values selected to reduce the degradation. A method and a non-transitory computer readable medium are also disclosed.

Baone, Chaitanya Ashok↗

Methods, systems, and devices for accurate signal timing of power component events

Disclosed herein are methods, systems, and devices for system event detection associated with power grid components. Methods include detecting, at a plurality of sensors, emissions from a system event associated with at least one winding of a power component. Methods also include determining, using a processor, a plurality of event parameters based, at least in part, on measurements made by the plurality of sensors, the event parameters identifying arrival times of the emissions at each of the plurality of sensors. Methods further include generating, using the processor, an output identifying an estimate of a position of the system event within the power component, the estimate being generated based, at least in part, on the arrival times identified by the plurality of event parameters.

Wu, Keshang↗

Additive manufacturing system and method having toolpath analysis

An additive manufacturing (AM) system is disclosed for constructing a three dimensional (3D) part with optimized orthotropy. The system combines an electronic processor which calculates an optimal set of physically achievable toolpaths to meet a given design objective, and a 3D printing direct ink write machine capable of printing inks with reinforcing particles that result in orthotropic materials. The electronic processor may combine a Domain of Interest subsystem that transforms a mathematical description of a desired part orthotropy to a plurality of guidepaths, a toolpath generate subsystem that develops a plurality of physically realizable toolpaths from those guidepaths with a minimum number of starts and stops, a finite element subsystem that computes spatially varying material orthotropy from those toolpaths and then solves a boundary value problem to determine a figure of merit for the design, and an optimization subsystem that uses that figure of merit to update the mathematical description of the part orthotropy to iteratively develop an improved part. The optimization subsystem also includes convergence criteria to indicate when toolpaths have been achieved that yield a sufficiently optimal part has been achieved. The toolpath generate can then output the final toolpaths, which are converted to suitable code that controls the motion of the 3D printer toolhead and allows the optimized 3D part to be manufactured.

King, Michael J.↗