Search NASA⌕ Search

SEARCH · Search NASA

Results for “Compiler”

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 937 records · Page 52
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

XACC: a system-level software infrastructure for heterogeneous quantum–classical computing

Quantum programming techniques and software have advanced significantly over the past five years, with a majority focusing on high-level language frameworks targeting remote REST library APIs. As quantum computing architectures advance and become more widely available, lower-level, system software infrastructures will be needed to enable tighter, co-processor programming and access models. In this work, we present XACC, a system-level software infrastructure for quantum–classical computing that promotes a service-oriented architecture to expose interfaces for core quantum programming, compilation, and execution tasks. Additionally, we detail XACC's interfaces, their interactions, and its implementation as a hardware-agnostic framework for both near-term and future quantum–classical architectures. We provide concrete examples demonstrating the utility of this framework with paradigmatic tasks. Our approach lays the foundation for the development of compilers, associated runtimes, and low-level system tools tightly integrating quantum and classical workflows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Shearing approach to gauge-invariant Trotterization

Universal quantum simulations of gauge field theories are exposed to the risk of gauge symmetry violations when it is not known how to compile the desired operations exactly using the available gate set. In this article, we show how time evolution can be compiled in an Abelian gauge theory—if only approximately—without compromising gauge invariance, by graphically motivating a block-diagonalization procedure. When gauge-invariant interactions are associated with a “spatial network” in the space of discrete quantum numbers, it is seen that cyclically shearing the spatial network converts simultaneous updates to many quantum numbers into conditional updates of a single quantum number; ultimately, this eliminates any need to pass through (and acquire overlap onto) unphysical intermediate configurations. Shearing is explicitly applied to gauge-matter and magnetic interactions of lattice quantum electrodynamics. The features that make shearing successful at preserving Abelian gauge symmetry may also be found in non-Abelian theories, bringing one closer to gauge-invariant simulations of quantum chromodynamics.

Gauge theories↗
DOE OSTI2016

Octahedral rotation patterns in strained EuFeO 3 and other Pbnm perovskite films: Implications for hybrid improper ferroelectricity

Here, we report the relationship between epitaxial strain and the crystallographic orientation of the in-phase rotation axis and A -site displacements in Pbnm-type perovskite films. Synchrotron diffraction measurements of EuFeO 3 films under strain states ranging from 2% compressive to 0.9% tensile on cubic or rhombohedral substrates exhibit a combination of a - a + c - and a + a - c - rotational patterns. We compare the EuFeO 3 behavior with previously reported experimental and theoretical work on strained Pbnm-type films on nonorthorhombic substrates, as well as additional measurements from LaGaO 3 , LaFeO 3 , and Eu 0.7 Sr 0.3 MnO 3 films on SrTiO 3 . Compiling the results from various material systems reveals a general strain dependence in which compressive strain strongly favors a - a + c - and a + a - c - rotation patterns and tensile strain weakly favors a - a - c + structures. In contrast, EuFeO 3 films grown on Pbnm-type GdScO 3 under 2.3% tensile strain take on a uniform a - a + c - rotation pattern imprinted from the substrate, despite strain considerations that favor the a - a - c + pattern. Our results point to the use of substrate imprinting as a more robust route than strain for tuning the crystallographic orientations of the octahedral rotations and A -site displacements needed to realize rotation-induced hybrid improper ferroelectricity in oxide heterostructures.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2023

Current data are consistent with flat spatial hypersurfaces in the Λ CDM cosmological model but favor more lensing than the model predicts

Here, we study the performance of three pairs of tilted, and a pair of untilited, ΛCDM cosmological models, with three of these four pairs allowing for non-flat spatial hypersurfaces, against cosmic microwave background (CMB) temperature and polarization power spectrum data (P18), measurements of the Planck 2018 lensing potential power spectrum (lensing), and a large compilation of non-CMB data (non-CMB). For the eight models, we measure cosmological parameters and study whether or not pairs of the data sets (as well as subsets of them) are mutually consistent in these models. Half of these models allow the lensing consistency parameter A L , which re-scales the gravitational potential power spectrum, to be an additional free parameter to be determined from data, while the other three have A L = 1 which is the theoretically expected value. The pair of untilted non-flat ΛCDM models are incompatible with P18 data. The tilted spatially-flat models assume the usual primordial spatial inhomogeneity power spectrum that is a power law in wave number. The tilted non-flat models assume either the primordial power spectrum used in the Planck group anal yses [Planck P(q)], that has recently been numerically shown to be a good approximation to what is quantum-mechanically generated from a particular choice of closed inflation model initial conditions, or a recently computed power spectrum [new P(q)] that quantum-mechanically follows from a different set of non-flat inflation model initial conditions. In the tilted non-flat models with A L = 1 we find differences between P18 data and non-CMB data cosmological parameter constraints, which are large enough to rule out the Planck P(q) model at 3σ but not the new P(q) model. No significant differences are found when cosmological parameter constraints obtained with two different data sets are compared within the standard tilted flat ΛCDM model. While both P18 data and non-CMB data separately favor a closed geometry, with spatial curvature density parameter Ω k < 0, when P18+non-CMB data are jointly analyzed the evidence in favor of non-flat hypersurfaces subsides. Differences between P18 data and non-CMB data cosmological constraints subside when A L is allowed to vary. From the most restrictive P18+lensing+non-CMB data combination we get almost model-independent constraints on the cosmological parameters and find that the A L > 1 option is preferred over the Ω k < 0 one, with the A L parameter, for all models, being larger than unity by ~ 2.5σ. According to the deviance information criterion, in the P18+lensing+non-CMB analysis, the varying A L option is on the verge of being strongly favored over the A L = 1 one, which could indicate a problem for the standard tilted flat ΛCDM model. These data are consistent with flat spatial hypersurfaces but more and better data could improve the constraints on Ω k and might alter this conclusion. Error bars on some cosmological parameters are significantly reduced when non-CMB data are used jointly with P18+lensing data. For example, in the tilted flat ΛCDM model for P18+lensing+non-CMB data the Hubble constant H 0 = 68.09 ± 0.38 km s -1 Mpc -1 , which is consistent with that from a median statistics analysis of a large compilation of H 0 measurements as well as with a number of local measurements of the cosmological expansion rate. This H 0 error bar is 31% smaller than that from P18+lensing data alone.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2019

Dark Energy Survey year 1 results: Constraints on extended cosmological models from galaxy clustering and weak lensing

We present constraints on extensions of the minimal cosmological models dominated by dark matter and dark energy, Lambda CDM and wCDM, by using a combined analysis of galaxy clustering and weak gravitational lensing from the first-year data of the Dark Energy Survey (DES Y1) in combination with external data. We consider four extensions of the minimal dark energy-dominated scenarios: (1) nonzero curvature Omega(k), (2) number of relativistic species N-eff different from the standard value of 3.046, (3) time-varying equation-of-state of dark energy described by the parameters w(0) and w(a) (alternatively quoted by the values at the pivot redshift, w(p), and w(a)), and (4) modified gravity described by the parameters is mu(0) and Sigma(0) that modify the metric potentials. We also consider external information from Planck cosmic microwave background measurements; baryon acoustic oscillation measurements from SDSS, 6dF, and BOSS; redshift-space distortion measurements from BOSS; and type Ia supernova information from the Pantheon compilation of datasets. Constraints on curvature and the number of relativistic species are dominated by the external data; when these are combined with DES Y1, we find Omega(k) = 0.0020(-0.0032)(+0.0037) at the 68% confidence level, and the upper limit N-eff < 3.28(3.55) at 68% (95%) confidence, assuming a hard prior N-eff > 3.0. For the time-varying equation-of-state, we find the pivot value (w(p), w(a)) = (-0.91(-0.23)(+0.19), -0.57(-1.11)(+0.93)) at pivot redshift z(p )= 0.27 from DES alone, and (w(p), w(a)) = (-1.01(-0.04)(+0.04), -0.28(-0.48)(+0.37)) at z(p) = 0.20 from DES Y1 combined with external data; in either case we find no evidence for the temporal variation of the equation of state. For modified gravity, we find the present-day value of the relevant parameters to be Sigma(0) = 0.43(-)(0.29)(+0.28) from DES Y1 alone, and (Sigma(0), mu(0)) = (0.06(-0.07)(+0.08), -0.11(-0.46)(+0.42)) from DES Y1 combined with external data. These modified-gravity constraints are consistent with predictions from general relativity.

Abbott, T. M. C.↗
DOE OSTI2019

Direct Randomized Benchmarking for Multiqubit Devices

Benchmarking methods that can be adapted to multiqubit systems are essential for assessing the overall or “holistic” performance of nascent quantum processors. The current industry standard is Clifford randomized benchmarking (RB), which measures a single error rate that quantifies overall performance. But, scaling Clifford RB to many qubits is surprisingly hard. It has only been performed on one, two, and three qubits as of this writing. This reflects a fundamental inefficiency in Clifford RB: the n-qubit Clifford gates at its core have to be compiled into large circuits over the one- and two-qubit gates native to a device. As n grows, the quality of these Clifford gates quickly degrades, making Clifford RB impractical at relatively low n. In this Letter, we propose a direct RB protocol that mostly avoids compiling. Instead, it uses random circuits over the native gates in a device, which are seeded by an initial layer of Clifford-like randomization. We demonstrate this protocol experimentally on two to five qubits using the publicly available ibmqx5. We believe this to be the greatest number of qubits holistically benchmarked, and this was achieved on a freely available device without any special tuning up. Our protocol retains the simplicity and convenient properties of Clifford RB: it estimates an error rate from an exponential decay. But, it can be extended to processors with more qubits—we present simulations on 10+ qubits—and it reports a more directly informative and flexible error rate than the one reported by Clifford RB. Here, we show how to use this flexibility to measure separate error rates for distinct sets of gates, and we use this method to estimate the average error rate of a set of cnot gates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

AXI4MLIR: User-Driven Automatic Host Code Generation for Custom AXI-Based Accelerators

Tensor algebra operations represent an important class of algorithms used across many applications, including machine learning, scientific computing, and data analytics. As a result, the efficient generation of custom accelerators for tensor operations has received increased attention. Previous efforts have produced automated tools enabling users to prototype and explore optimized accelerators. However, little effort has been focused on the host-accelerator interaction in these tools. Efficient use of hardware accelerators requires knowledge about the accelerator's capabilities (operations, data formats, and opcode support), the host CPU microarchitecture (e.g., memory hierarchy), the host-accelerator interface, and the application's features (which code regions should be mapped onto an accelerator). Manually rewriting the original applications to facilitate improved custom accelerator mapping is an error-prone and time-consuming endeavor. To cope with this, we propose AXI4MLIR, a new framework to automatically generate and optimize the communication between the host CPU and arbitrary accelerators that implement linear algebra algorithms. AXI4MLIR extends the MLIR compiler framework to automatically generate efficient host-accelerator driver code for accelerators with AXI-based interfaces. Our compiler extensions enable automatic driver code generation while carefully considering the host's memory hierarchy and target accelerator features. To demonstrate the flexibility and utility of AXI4MLIR, we test it with diverse use cases that include different types of accelerators, tiling scenarios, and dataflow schemes. We compare our experimental results to manual implementations of host-accelerator driver code and find that our approach can reduce CPU cache references by 56% and deliver up to a 1.65x speedup.

Bohm Agostini, Nicolas↗
DOE OSTI2021

Invited: Bambu: an Open-Source Research Framework for the High-Level Synthesis of Complex Applications

This paper presents the open-source High-Level Synthesis research framework Bambu. The framework provides an open-source starting point to experiment with new ideas across High-Level Synthesis, high-level verification and debugging, FPGA/ASIC design, design flow space exploration, and parallel hardware accelerator design. The tool accepts as input standard C/C++ specifications and compiler intermediate representations (IRs) coming from the well-known Clang/LLVM and GCC com- pilers. The broad spectrum and flexibility of input formats allow the electronic design automation (EDA) research community to explore and integrate new transformations and optimizations. The easily extendable modular framework already includes many op- timizations and HLS benchmarks. The integration with synthesis and verification backends (commercial and open-source) allows researchers to quickly test any new finding and easily obtain performance and resource usage metrics for a given application. Different FPGA devices are supported from several different vendors: AMD/XILINX, Intel/Altera, Lattice Semiconductor, and NanoXplore. Finally, integration with the OpenRoad open-source end-to-end silicon compiler perfectly fits with the recent push towards open-source EDA.

Ferrandi, Fabrizio↗
DOE OSTI2017

PRESAGE: Protecting Structured Address Generation against Soft Errors

Modern computer scaling trends in pursuit of larger component counts and power efficiency have, unfortunately, lead to less reliable hardware and consequently soft errors escaping into application data ("silent data corruptions"). Techniques to enhance system resilience hinge on the availability of efficient error detectors that have high detection rates, low false positive rates, and lower computational overhead. Unfortunately, efficient detectors to detect faults during address generation (to index large arrays) have not been widely researched. We present a novel lightweight compiler-driven technique called PRESAGE for detecting bit-flips affecting structured address computations. A key insight underlying PRESAGE is that any address computation scheme that flows an already incurred error is better than a scheme that corrupts one particular array access but otherwise (falsely) appears to compute perfectly. Enabling the flow of errors allows one to situate detectors at loop exit points, and helps turn silent corruptions into easily detectable error situations. Our experiments using PolyBench benchmark suite indicate that PRESAGE-based error detectors have a high error-detection rate while incurring low overheads.

Sharma, Vishal C.↗
DOE OSTI2021

Automated Generation of Integrated Digital and Spiking Neuromorphic Machine Learning Accelerators

The growing numbers of application areas for artificial intelligence (AI) methods have led to an explosion of domain-specific accelerators that could support every new machine learning (ML) algorithm advancement, clearly highlighting the need for a capability to quickly and automatically transition from algorithm definition to hardware implementation and explore design space along a variety of SWaP (size, weight and Power). The software defined architectures (SODA) synthesizer implements a compiler-based modular infrastructure for the end-to-end generation of machine learning accelerators from high-level frameworks to hardware description language. At the same time, neuromorphic computing, by mimicking how the brain operates, promises to perform artificial intelligence tasks at efficiencies orders of magnitude higher than the current conventional tensor-processing based accelerators, as demonstrated by a variety of specialized designs leveraging Spiking Neural Networks (SNNs). Nevertheless, the mapping of an artificial neural network (ANN) to solutions supporting SNNs is still a non-trivial and very device-specific task, and completely lack the possibility to design hybrid systems that integrate conventional and spiking neural models. In this paper we discuss the support for such an integrated generation leveraging the SODA Synthesizer framework and its modular structure. In particular, we present a new MLIR dialect (part of the SODA frontend) that allows expressing spiking neural network features (e.g., available resources, spiking sequences, analog signal reading, etc.) and illustrate how it enables mapping to Spiking Neurons and deployment to the related specialized hardware (which, in the digital domain, could be generated through the other existing layers of the SODA Synthesizer). We then discuss the opportunities for even deeper integration afforded by the hardware compilation infrastructure, providing a path towards the generation of complex heterogeneous artificial intelligence systems.

Curzel, Serena↗
DOE OSTI2024

Computing with a Chemical Reservoir

Contemporary computation is expensive, with large language models and artificial intelligence becoming more common in daily life. However, high-performance computing is reaching the limits in speed and energy expenditure, and domain science requires ever-increasing computational capacity, with simulations and data analysis pipelines ever-growing in complexity. As we progress towards post-exascale computation, with the associated high energy costs, new methods of energy-conscious computation are required. Novel analog and hybrid digital-analog systems can overcome these challenges, and chemical reactions offer a promising avenue. Computers based on chemistry can provide compact desktop devices with immense computational power. These devices are readily scalable by considering greater reaction systems or vessels, meeting the high-performance requirements for scientific workflows. In this article, we present ChemComp, a compilation pipeline for the conversion of ordinary differential equations into implementable chemical reactions. We then demonstrate the solving capabilities of ChemComp by emulating a potential chemical reservoir device. We leverage the multi-layer intermediate representation (MLIR) compiler framework to implement an expressive chemical reaction abstraction and propose a path for chemical reaction networks (CRNs) to represent mathematical problems effectively. Combined, we demonstrate a potential workflow that can harness chemistry’s computing power to create energy-efficient, high-performance computation systems for contemporary computing needs.

artificial intelligence↗
DOE OSTI2016

Towards Resiliency Evaluation of Vector Programs

The systems resilience research community has developed methods to manually insert additional source-program level assertions to trap errors, and also devised tools to conduct fault injection studies for scalar program codes. In this work, we contribute the first vector oriented LLVM-level fault injector VULFI to help study the effects of faults in vector architectures that are of growing importance, especially for vectorizing loops. Using VULFI, we conduct a resiliency study of nine real-world vector benchmarks using Intel’s AVX and SSE extensions as the target vector instruction sets, and offer the first reported understanding of how faults affect vector instruction sets. We take this work further toward automating the insertion of resilience assertions during compilation. This is based on our observation that during intermediate (e.g., LLVM-level) code generation to handle full and partial vectorization, modern compilers exploit (and explicate in their code-documentation) critical invariants. These invariants are turned into error-checking code. We confirm the efficacy of these automatically inserted low-overhead error detectors for vectorized for-loops.

fault injection↗
DOE OSTI2022

Integer Sum Reduction with OpenMP on an AMD MI100 GPU

Sum reduction is a primitive operation in parallel computing. Device offload support allows a user to use OpenMP directives to take advantage of a highly capable GPU. In this paper, we present the integer sum reduction annotated with the OpenMP directives and evaluate the performance impacts of tunable parameters with the AOMP and GCC compilers on an AMD MI100 GPU. In addition, we explain the implementations of the OpenMP reduction by the compilers. Sweeping over the pruned parameter space, we find that the speedup is approximately 20 with AOMP, and the reduction performance using AOMP is approximately 11% higher than that using GCC. However, the OpenMP offload performance is approximately 30% lower compared to the performance of the reductions written with rocThrust or hipCUB.

Jin, Zheming↗
DOE OSTI2025

Implementing Directive-Based Deferred Execution for Effective Network Aggregation

Remote direct memory access technology provides an efficient mechanism for one-sided communication that can be leveraged to implement a distributed shared memory programming model. However, when applications generate large numbers of small, irregular messages, network congestion often arises. Existing solutions address this small message problem by facilitating message aggregation but typically require disruptive code transformations that detract from the algorithmic intent of applications, or can be limited by dependent operations on aggregated data between synchronisation points. A solution is to use a directive-assisted approach that enables compilers to transform code dependent on aggregated communication for deferred execution. This paper presents an algorithm that a compiler can use to implement and optimise deferred execution for code dependent on aggregated data, based on an "aggregation context" extension for the OpenSHMEM partitioned global address space library. This new capability addresses a key challenge of message aggregation, allowing its full potential to reduce network congestion and enhance programmability to be realised.

Welch, Aaron [ORNL]↗
DOE OSTI2021

Really Embedding Domain-Specific Languages into C++

The following topics are dealt with: program compilers; optimising compilers; parallel processing; software engineering; learning (artificial intelligence); multiprocessing systems; shared memory systems; optimisation; computational complexity; specification languages.

Finkel, Hal J.↗
DOE OSTI2021

Sampling on NISQ Devices: "Who’s the Fairest One of All?"

Modern NISQ devices are subject to a variety of biases and sources of noise that degrade the solution quality of computations carried out on these devices. A natural question that arises in the NISQ era, is how fairly do these devices sample ground state solutions. To this end, we run five fair sampling problems (each with at least three ground state solutions) that are based both on quantum annealing and, on the Grover Mixer, -QAOA algorithm for gate-based NISQ hardware. In particular, we use seven IBM Q devices, the Aspen-9 Rigetti device, the IonQ device, and three D-Wave quantum annealers. For each of the fair sampling problems, we measure the ground state probability, the relative fairness of the frequency of each ground state solution with respect to the other ground state solutions, and the aggregate error as given by each hardware provider. Overall, our results show that NISQ devices do not achieve fair sampling yet. Furthermore, we also observe differences in the software stack with a particular focus on compilation techniques that illustrate what work will still need to be done to achieve a seamless integration of frontend (i.e., quantum circuit description) and backend compilation.

Computer Science↗
DOE OSTI2022

SPEL: Software tool for Porting E3SM Land Model with OpenACC in a Function Unit Test Framework

Most high-end computers adopt hybrid architecture, porting a large-scale scientific code onto accelerators is necessary. The paper presents a generic method for porting large-scale scientific code onto accelerators using compiler directives within a modularized function unit test platform. We have implemented the method and designed a software tool (SPEL) to port the E3SM Land Model (ELM) onto the GPUs in the Summit computer. SPEL automatically generates GPU-ready test modules for all ELM functions, such as CanopyFlux, SoilTemperature, and EcosystemDynamics. SPEL breaks the ELM into a collection of standalone unit test programs for easy code verification and further performance improvement. We further optimize several ELM test modules with advanced techniques, including memory reduction, reconstructed parallel loops, and asynchronous GPU kernel launch. We hope our study will inspire new toolkit developments that expedite large-scale scientific code porting with compiler directives.

Schwartz, Peter↗
DOE OSTI2018

Traits drive global wood decomposition rates more than climate

Wood decomposition is a major component of the global carbon cycle. Decomposition rates vary across climate gradients, which is thought to reflect the effects of temperature and moisture on the metabolic kinetics of decomposers. However, decomposition rates also vary with wood traits, which may reflect the influence of stoichiometry on decomposer metabolism as well as geometry relating the surface areas that decomposers colonize with the volumes they consume. In this paper, we combined metabolic and geometric scaling theories to formalize hypotheses regarding the drivers of wood decomposition rates, and assessed these hypotheses using a global compilation of data on climate, wood traits, and wood decomposition rates. Our results are consistent with predictions from both metabolic and geometric scaling theories. Approximately half of the global variation in decomposition rates was explained by wood traits (nitrogen content and diameter), whereas only a fifth was explained by climate variables (air temperature, precipitation, and relative humidity). These results indicate that global variation in wood decomposition rates is best explained by stoichiometric and geometric wood traits. Our findings suggest that inclusion of wood traits in global carbon cycle models can improve predictions of carbon fluxes from wood decomposition.

Hu, Zhenhong↗