Search NASA⌕ Search

SEARCH · Search NASA

Results for “Compilation”

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 73 records · Page 4

Wootz: a compiler-based framework for fast CNN pruning via composability

Convolutional Neural Networks (CNN) are widely used for Deep Learning tasks. CNN pruning is an important method to adapt a large CNN model trained on general datasets to fit a more specialized task or a smaller device. The key challenge is on deciding which filters to remove in order to maximize the quality of the pruned networks while satisfying the constraints. It is time-consuming due to the enormous configuration space and the slowness of CNN training.The problem has drawn many efforts from the machine learning field, which try to reduce the set of network configurations to explore. This work tackles the problem distinctively from a programming systems perspective, trying to speed up the evaluations of the remaining configurations through computation reuse via a compiler-based framework. We empirically uncover the existence of composability in the training of a collection of pruned CNN models, and point out the opportunities for computation reuse. We then propose composability-based CNN pruning, and design a compression-based algorithm to efficiently identify the set of CNN layers to pre-train for maximizing their reuse benefits in CNN pruning. We further develop a compiler-based framework named Wootz, which, for an arbitrary CNN, automatically generates code that builds a Teacher-Student scheme to materialize composability-based pruning. Experiments show that network pruning enabled by Wootz shortens the state-of-art pruning process by up to 186X while producing significantly better pruning results.

Guan, Hui↗

Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures

Superconducting quantum devices are a leading technology for quantum computation, but they face several challenges. Gate errors, coherence errors and a lack of connectivity all contribute to low fidelity results. In particular, connectivity restrictions enforce a gate set that requires three-qubit gates to be decomposed into one- or two-qubit gates. This substantially increases the number of two-qubit gates that need to be executed. However, many quantum devices have access to higher energy levels. We can expand the qubit abstraction of |0〉 and |1〉 to a ququart which has access to the |2〉 and |3〉 state, but with shorter coherence times. This allows for two qubits to be encoded in one ququart, enabling increased virtual connectivity between physical units from two adjacent qubits to four fully connected qubits. This connectivity scheme allows us to more efficiently execute three-qubit gates natively between two physical devices.We present direct-to-pulse implementations of several three-qubit gates, synthesized via optimal control, for compilation of three-qubit gates onto a superconducting-based architecture with access to four-level devices with the first experimental demonstration of four-level ququart gates designed through optimal control. We demonstrate strategies that temporarily use higher level states to perform Toffoli gates and always use higher level states to improve fidelities for quantum circuits. We find that these methods improve expected fidelities with increases of 2x across circuit sizes using intermediate encoding, and increases of 3x for fully-encoded ququart compilation.

Litteken, Andrew↗

TISCC: A Surface Code Compiler and Resource Estimator for Trapped-Ion Processors

We introduce the Trapped-Ion Surface Code Compiler (TISCC), a software tool that generates circuits for a universal set of surface code patch operations in terms of a native trapped-ion gate set. To accomplish this, TISCC manages an internal representation of a trapped-ion system where a repeating pattern of trapping zones and junctions is arranged in an arbitrarily large rectangular grid. Surface code operations are compiled by instantiating surface code patches on the grid and using methods to generate transversal operations over data qubits, rounds of error correction over stabilizer plaquettes, and/or lattice surgery operations between neighboring patches. Beyond the implementation of a basic surface code instruction set, TISCC contains corner movement functionality and a patch translation that is implemented using ion movement alone. Except in the latter case, all TISCC functionality is extensible to alternative grid-like hardware architectures. TISCC output has been verified using the Oak Ridge Quasi-Clifford Simulator (ORQCS).

LeBlond, Tyler↗

Fortran Compiler Test Suite v0.1.0

There is no currently available, open-source, easily adapted test suite for checking a compiler's conformance to the Fortran Standard. The main innovation of this software is in the framework to make the test suite apply to a new compiler. Making it open-source will enable community contributions of the test cases. Single organization construction of a comprehensive test suite is something that would be financially infeasible.

Richardson, Bradley↗

Compiled Groundwater Chemistry Data and Identified Mineralogy for the Portland Basin CRBG Aquifer System as part of DDU Feasibility Study

Groundwater Chemistry data for the Portland Basin was compiled from published literature, as well as state and federal groundwater quality reports. Mineralogies were identified based on previous literature, as well as XRD and SEM analysis conducted at Portland State University. Uploaded data sets include the compiled data on Portland and Tualatin Basin hydrogeology, and corresponding hydrogeochemical analyses.

15 GEOTHERMAL ENERGY↗

VotE-Dams: a compilation of global dams' locations and attributes (v1)

This dataset represents a compilation of two global and three USA-specific datasets of dam locations and their attributes. The major hurdle toward developing this compilation was the identification of duplicates within the source datasets, especially given the variable precision of dam location coordinates. The most immediately-useful product in this dataset is a spreadsheet (VotE-Dams_v1.csv) that documents the unique dams found across the datasets, their coordinates, and their ids within the respective source datasets. We do not reproduce the source datasets (GRaND, GOODD, GeoDAR, NID, and EHA) here, but their download locations are provided in the README files ('Overview' tab). Some of the source datasets are provided as shapefiles, which require geospatial data software to open (e.g. QGIS/ArcGIS for graphical display, geopandas for Python, rgdal for R, many others freely available). The provided README documents metadata of the source datasets and provides attribute-linking information (i.e. matches attributes among various source datasets that contain the same, or similar, information but have different names). Note that the README is provided as both .xslx and a collection of .csvs (one per tab in the .xslx file). We suggest using the .xlsx version that preserves images, formatting, and sheets. .xlsx files can be viewed using (free) Google Docs or Microsoft Excel.Finally, we provide Technical Documentation.pdf that describes the procedures used to identify unique and duplicate dams.The title of this dataset refers to our 'Veins of the Earth' (VotE) project, which seeks to provide a flexible, scale-free representation of the Earth's river networks. Dams are a critical component of VotE as they heavily influence flows throughout river networks.

54 ENVIRONMENTAL SCIENCES↗

Global compilation of soil methane uptake measurements from 1984 to 2018

This data package contains a global compilation of soil methane uptake measurements collected from published field studies between 1989 and 2022. The dataset was developed to support machine learning (ML) estimation of the global terrestrial methane soil sink and includes monthly methane uptake rates, measurement dates, site coordinates, and associated ecosystem information from different ecosystems. Data were compiled from 164 peer-reviewed publications across approximately 260 study sites, resulting in ~12,000 monthly observations after quality control screening and removal of manipulated experimental treatments. The database was further processed to generate site-averaged methane uptake estimates for comparison between process-based (PB) and ML models.

earth science↗

Compilation of a Comprehensive Earthquake Catalog and Relocations in the Caucasus Region

Instrumental seismic monitoring has a long history in the Caucasus and started in 1899 when the first seismograph was installed in Tbilisi, Georgia. Much of the analog paper records from this time period are preserved in the Tbilisi archives because Georgia served as the regional data center. In the 1990s, due to the collapse of the Soviet Union and the political turmoil in the region, the analog networks and the communication between the newly formed national networks deteriorated. In Georgia, for the next 13 yr, the seismic network coverage was poor until the 2002 Tbilisi earthquake. Following this earthquake, the first permanent digital seismic station in Georgia was established in Tbilisi in 2003. The digital era progressively improved the ability to collect and archive data and today more than a hundred broadband seismic stations (including temporary arrays) are operating in the southern Caucasus. Until recently, the region lacked a coordinated effort to catalog all analog and digital era data collected by different countries into a single repository. As a result of collaboration between Lawrence Livermore National Laboratory, the Ilia State University, and the Republican Seismic Survey Center of Azerbaijan, a comprehensive earthquake catalog was compiled for the Caucasus and neighboring areas as part of a broader probabilistic seismic hazard assessment project. Here this project digitized Soviet-era paper bulletins, compiled a unified earthquake catalog from regional bulletins, developed 1D reference velocity model, and used it to relocate the events. The final catalog contains 16,963 events with magnitudes 3.7 and above, bringing together all the available data sets in the Caucasus region from 1900 to 2015, significantly improving locations, and generating the most complete earthquake catalog in the region, temporally and geographically.

58 GEOSCIENCES↗

Making Compiler-Based Tools Accessible Online

Compiler-based tools are widely used to analyze and optimize source codes for many purposes, including extracting insights about applications’ properties or restructuring code for better performance. However, using compiler-based tools is often difficult due to tedious and error-prone steps to configure and install such tools on various machines. In this paper, we describe a solution to use CGI + Bash to expose compilerbased tools to a web page so users can directly use these tools without installing them.

97 MATHEMATICS AND COMPUTING↗

Making Compiler-Based Tools Accessible Online

Compiler-based tools are widely used to analyze and optimize source codes for many purposes, including extracting insights about applications’ properties or restructuring code for better performance. However, using compiler-based tools is often difficult due to tedious and error-prone steps to configure and install such tools on various machines. In this paper, we describe a solution to use CGI + Bash to expose compilerbased tools to a web page so users can directly use these tools without installing them.

97 MATHEMATICS AND COMPUTING↗

Correct Compilation of Concurrent C Code

The CompCert compiler represents a landmark effort in program verification as both a piece of verified software and as a compiler for verified C programs. A key shortcoming of CompCert however is that it does not support multithreaded programs. Prior work to add threads to CompCert has either required major rewrites of parts of the proof or only works for well synchronized programs. The problem is that CompCert’s backward simulation derives from a forward simulation via the determinism of the semantics of intermediate representation languages. This makes the proofs in CompCert easier but also makes them incompatible with standard models of multithreading which are non-deterministic. Here we propose an alternate formulation of CompCert’s proof structure that parameterizes the existing single threaded semantics with nondeterministic behavior generated at the multithreading level. While this is an old trick where program equivalence is concerned, performing it in the context of CompCert is quite subtle. Our approach allows for expressive concurrent semantics and does not require major proof rewrites but still results in a global backward simulation for multithreaded programs.

97 MATHEMATICS AND COMPUTING↗

Tough Errors Are no Match (TEAM): Optimizing the Quantum Compiler for Noise Resilience

This report summarizes research performed under the Tough Errors Are no Match (TEAM) project. The primary focus of TEAM has been to research and develop a compilation toolbox leveraging techniques from quantum characterization and control, probabilistic programming, and approximate computing. Our goal was to develop robust protocols that can be integrated into quantum compilers to optimize and enhance the robustness of noisy computation. Here, we provide a summary of TEAM work focused on characterization and control of quantum systems.

97 MATHEMATICS AND COMPUTING↗

The AMUSING++ Nearby Galaxy Compilation. I. Full Sample Characterization and Galactic-scale Outflow Selection

We present here AMUSING++: the largest compilation of nearby galaxies observed with the MUSE integral-field spectrograph so far. This collection consists of 635 galaxies from different MUSE projects covering the redshift interval 0.0002 < z < 0.1. The sample and its main properties are characterized and described here. It includes galaxies of almost all morphological types, with a good coverage in its color–magnitude diagram, within the stellar mass range between 10{sup 8} and 10{sup 12} M {sub ⊙}, and with properties resembling those of a diameter-selected sample. The AMUSING++ sample is, therefore, suitable for studying, with unprecendented detail, the properties of nearby galaxies at global and local scales, providing us with more than 50 million individual spectra. We use this compilation to investigate the presence of galactic outflows. We exploit the use of combined emission-line images to explore the shape of the different ionized components and the distribution along classical diagnostic diagrams to disentangle the different ionizing sources across the optical extension of each galaxy. We use the cross-correlation function to estimate the level of symmetry of the emission lines as an indication of the presence of shocks and/or active galactic nuclei. We uncovered a total of 54 outflows, comprising ∼8% of the sample. A large number of the discovered outflows correspond to those driven by active galactic nuclei (∼60%), suggesting some bias in the selection of our sample. No clear evidence was found that outflow host galaxies are highly star-forming, and outflows appear to be found within all galaxies around the star-formation sequence.

79 ASTRONOMY AND ASTROPHYSICS↗

ChemComp: Compiling and Computing with Chemical Reaction Networks

The exponential growth in computing demands driven by scientific computing, data analytics, and artificial intelligence is pushing conventional CMOS-based high-performance computing systems to their physical and energy efficiency limits. As we approach the era of post-exascale computing, disruptive approaches are necessary to overcome these barriers and achieve substantial gains in energy efficiency. Analog and hybrid digital-analog computing systems have emerged as promising alternatives, offering the potential for orders-of-magnitude improvements in efficiency. Among these, biochemical computing stands out as a novel paradigm capable of leveraging the natural efficiency of chemical reactions, which have shown promise in solving optimization problems by converging to steady states. By scaling up reaction networks or reaction vessel sizes, biochemical systems present an opportunity to meet the high-performance demands of modern computing tasks. Despite their promise, significant theoretical and practical challenges remain, particularly in formulating and mapping computational problems to chemical reaction networks (CRNs) and designing viable biochemical computing devices. This paper addresses these challenges by introducing new ideas to ChemComp, a compilation and emulation framework for chemical computation. This work describes the mechanisms through which solutions to ordinary differential equations (ODEs) that can be represented as CRN systems can be achieved. Furthermore, we explain the design principles of an ODE dialect implemented as a multi-level intermediate representation (MLIR) compiler extension that will be coupled with existing infrastructure. We demonstrate the potential of our framework through a case study emulating a simplified chemical reservoir computing device. This work establishes foundational tools and methodologies necessary to harness the computational power of chemistry, paving the way for the development of energy-efficient, high-performance computing systems tailored to contemporary and future computational needs.

Bohm Agostini, Nicolas↗

Solovay-Kitaev Algorithm and Randomized Compilation Data Availability

This zipped folder contains simulation notebooks, simulated data, and experimental data from the QSCOUT trapped-ion device that were used in the publication "Solovay-Kitaev Algorithm and Randomized Compilation" (https://doi.org/10.1103/ll6m-dbl7). The raw data is in the form of measurement outcomes of simple tomographic quantum circuits that were executed on the QSCOUT device and simulated using JAQALPAQ. These data are used to create plots within the jupyter notebooks that were included in the publication.

Quantum benchmarking↗

INGENIOUS - Great Basin Regional Dataset Compilation

This is the regional dataset compilation for the INnovative Geothermal Exploration through Novel Investigations Of Undiscovered Systems (INGENIOUS) project. The primary goal of this project is to accelerate discoveries of new, commercially viable hidden geothermal systems while reducing the exploration and development risks for all geothermal resources. These datasets will be used in INGENIOUS as input features for predicting geothermal favorability throughout the Great Basin study area. Datasets consist of shapefiles, geotiffs, tabular spreadsheets, and metadata that describe: 2-meter temperature probe surveys, quaternary faults and volcanic features, geodetic shear and dilation models, heat flow, magnetotellurics (conductance), magnetics, gravity, paleogeothermal features (such as sinter and tufa deposits), seismicity, spring and well temperatures, spring and well aqueous geochemistry analyses, thermal conductivity, and fault slip and dilation tendency. For additional project information, see the INGENIOUS project site linked in the submission. Terms of use: These datasets are provided "as is", and the contributors assume no responsibility for any errors or omissions. The user assumes the entire risk associated with their use of these data and bears all responsibility in determining whether these data are fit for their intended use. These datasets may be redistributed with attribution (see citation information below). Please refer to the license information on this page for full licensing terms and conditions.

15 GEOTHERMAL ENERGY↗

Scalable compiler technology for exascale

This is the Final report of the DOE Project, "Scalable Compiler Technology for Exascale." It summarizes the main findings, the students suported and the technical contributions.

97 MATHEMATICS AND COMPUTING↗

Using Compiler Directives for Performance Portability in Scientific Computing: Kernels from Molecular Simulation

Achieving performance portability for high-performance computing (HPC) applications in scientific fields has become an increasingly important initiative due to large differences in emerging supercomputer architectures. Here we test some key kernels from molecular dynamics (MD) to determine whether the use of the OpenACC directive-based programming model when applied to these kernels can result in performance within an acceptable range for these types of programs in the HPC setting. We find that for easily parallelizable kernels, performance on the GPU remains within this range. On the CPU, OpenACC-parallelized pairwise distance kernels would not meet the performance standards required, when using AMD Opteron “Interlagos” processors, but with IBM Power 9 processors, performance remains within an acceptable range for small batch sizes. These kernels provide a test for achieving performance portability with compiler directives for problems with memory-intensive components as are often found in scientific applications.

Sedova, Ada↗