SEARCH · Search NASA

Results for “Compiler Optimizations”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 307 records · Page 17

All sources NASA NTRS DOE OSTI

NASA NTRS2010

Deconvolution methods and systems for the mapping of acoustic sources from phased microphone arrays

A method and system for mapping acoustic sources determined from a phased microphone array. A plurality of microphones are arranged in an optimized grid pattern including a plurality of grid locations thereof. A linear configuration of N equations and N unknowns can be formed by accounting for a reciprocal influence of one or more beamforming characteristics thereof at varying grid locations among the plurality of grid locations. A full-rank equation derived from the linear configuration of N equations and N unknowns can then be iteratively determined. A full-rank can be attained by the solution requirement of the positivity constraint equivalent to the physical assumption of statically independent noise sources at each N location. An optimized noise source distribution is then generated over an identified aeroacoustic source region associated with the phased microphone array in order to compile an output presentation thereof, thereby removing the beamforming characteristics from the resulting output presentation.

Brooks, Thomas F.↗

NASA NTRSDate not supplied

Modeling Evolvable Water Recovery Systems for Short and Long-Duration Missions in Partial Gravity

Water recovery technologies on the International Space Station (ISS) are designed and optimized for microgravity environments, thus creating a need for innovative systems optimized for mission operations in the presence of gravity. Alternative water recovery technologies under research by the Life Support Systems division were compiled into a series of Partial Gravity Water Recovery System (PGWRS) architectures. Individual unit processes were modeled via fundamental physical-chemical process equations to simulate their method of treatment, including chemical or biological oxidation, flash evaporation, filtration, or a combination of adsorption and ion exchange processes. Dimension and sizing data were then utilized to scale each architecture. Modeling was completed on an assortment of architectures assuming three scenarios in which treatment methods could take advantage of partial gravity: a short-duration mission with a temporary surface habitat, a longer duration mission with a more permanent habitat, and a long duration mission without resupply. Total system mass was estimated to quantitatively compare architectures within scenarios, but qualitative observations were also made regarding system robustness, flexibility, and capacity to meet more stringent demands. Technologies that traded most favorably between the scenarios were those that included a pre-oxidation stage to minimize mass loading to downstream absorption and ion exchange beds, exploited gravity in liquid-vapor separation processes, and reconstituted wastewater components into recyclable material streams.

Avery Carlson↗

NASA NTRSDate not supplied

Modeling Evolvable Water Recovery Systems for Short and Long-Duration Missions in Partial Gravity

Avery L. Carlson↗

NASA NTRS2024

Modeling Evolvable Water Recovery Systems for Short and Long-Duration Missions in Partial Gravity

Water recovery technologies on the International Space Station (ISS) are designed and optimized for microgravity environments, thus creating a need for innovative systems optimized for mission operations in the presence of gravity. Alternative water recovery technologies under research by the Life Support Systems division were compiled into a series of Partial Gravity Water Recovery System (PGWRS) architectures. Individual unit processes were modeled via fundamental physical-chemical process equations to simulate their method of treatment, including chemical or biological oxidation, flash evaporation, filtration, or adsorption and ion exchange. Dimension and sizing data were then utilized to scale each architecture. Modeling was completed on an assortment of architectures assuming three scenarios in which treatment methods could take advantage of partial gravity: a short-duration mission with a temporary surface habitat, a longer duration mission with a more permanent habitat, and a long duration mission with minimal resupply. Total system mass was estimated to quantitatively compare architectures within scenarios, but qualitative observations were also made regarding system robustness, flexibility, and capacity to meet more stringent demands. Technologies that traded most favorably between the scenarios were those that included a pre-oxidation stage to minimize mass loading to downstream absorption and ion exchange beds, exploited gravity in liquid-vapor separation processes, and reconstituted wastewater components into recyclable material streams.

Avery L. Carlson↗

NASA NTRSDate not supplied

Modeling Evolvable Water Recovery Systems for Short and Long-Duration Missions in Partial Gravity

Water recovery technologies on the International Space Station (ISS) are designed and optimized for microgravity environments, thus creating a need for innovative systems optimized for mission operations in the presence of gravity. Alternative water recovery technologies under research by the Life Support Systems division were compiled into a series of Partial Gravity Water Recovery System (PGWRS) architectures. Individual unit processes were modeled via fundamental physical-chemical process equations to simulate their method of treatment, including chemical or biological oxidation, flash evaporation, filtration, or adsorption and ion exchange. Dimension and sizing data were then utilized to scale each architecture. Modeling was completed on an assortment of architectures assuming three scenarios in which treatment methods could take advantage of partial gravity: a short-duration mission with a temporary surface habitat, a longer duration mission with a more permanent habitat, and a long duration mission with minimal resupply. Total system mass was estimated to quantitatively compare architectures within scenarios, but qualitative observations were also made regarding system robustness, flexibility, and capacity to meet more stringent demands. Technologies that traded most favorably between the scenarios were those that included a pre-oxidation stage to minimize mass loading to downstream absorption and ion exchange beds, exploited gravity in liquid-vapor separation processes, and reconstituted wastewater components into recyclable material streams.

Avery Carlson↗

DOE OSTI2019

D-Wave for High Energy Physics

aWe analyze different problems in high-energy physics where quantum computing, and namely quantum annealers, may be able to provide an edge in coming years: 1) The training of Restricted Boltzmann Machines (RBM) is a natural problem for quantum annealers. We explore RBM trained on a D-Wave machine for classification of galaxy morphologies, including a discussion of how to obtain a Boltzmann distribution from the annealer. 2) For this study, we cast the problem of explaining and predicting the production of particles in high energy collisions (color recombination) as an optimization problem and employ classical and quantum computing techniques to find solutions. In particular, we present a quadratic unconstrained binary optimization (QUBO) formulation for quantum annealers. In parallel to these efforts, we also present the cross-platform XACC package for quantum compilation and execution.

Caldeira, J.↗

NASA NTRS1999

Aerodynamic Shape Optimization Using A Combined Distributed/Shared Memory Paradigm

Current parallel computational approaches involve distributed and shared memory paradigms. In the distributed memory paradigm, each processor has its own independent memory. Message passing typically uses a function library such as MPI or PVM. In the shared memory paradigm, such as that used on the SGI Origin 2000 machine, compiler directives are used to instruct the compiler to schedule multiple threads to perform calculations. In this paradigm, it must be assured that processors (threads) do not simultaneously access regions of memory in such away that errors would occur. This paper utilizes the latest version of the SGI MPI function library to combine the two parallelization paradigms to perform aerodynamic shape optimization of a generic wing/body.

Cheung, Samson↗

DOE OSTI2015

MeshAndCollect: an automated multi-crystal data-collection workflow for synchrotron macromolecular crystallography beamlines

The fully automated collection and merging of partial data sets from a series of cryocooled crystals of biological macromolecules contained on the same support is presented, as are the results of test experiments carried out on various systems. Here, an automated procedure is described to identify the positions of many cryocooled crystals mounted on the same sample holder, to rapidly predict and rank their relative diffraction strengths and to collect partial X-ray diffraction data sets from as many of the crystals as desired. Subsequent hierarchical cluster analysis then allows the best combination of partial data sets, optimizing the quality of the final data set obtained. The results of applying the method developed to various systems and scenarios including the compilation of a complete data set from tiny crystals of the membrane protein bacteriorhodopsin and the collection of data sets for successful structure determination using the single-wavelength anomalous dispersion technique are also presented.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2023

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗

DOE OSTI2025

Optimizing Deep Learning Models for Climate-Related Natural Disaster Detection from UAV Images and Remote Sensing Data

This research study utilized artificial intelligence (AI) to detect natural disasters from aerial images. Flooding and desertification were two natural disasters taken into consideration. The Climate Change Dataset was created by compiling various open-access data sources. This dataset contains 6334 aerial images from UAV (unmanned aerial vehicles) images and satellite images. The Climate Change Dataset was then used to train Deep Learning (DL) models to identify natural disasters. Four different Machine Learning (ML) models were used: convolutional neural network (CNN), DenseNet201, VGG16, and ResNet50. These ML models were trained on our Climate Change Dataset so that their performance could be compared. DenseNet201 was chosen for optimization. All four ML models performed well. DenseNet201 and ResNet50 achieved the highest testing accuracies of 99.37% and 99.21%, respectively. This research project demonstrates the potential of AI to address environmental challenges, such as climate change-related natural disasters. This study’s approach is novel by creating a new dataset, optimizing an ML model, cross-validating, and presenting desertification as one of our natural disasters for DL detection. Three categories were used (Flooded, Desert, Neither). Our study relates to AI for Climate Change and Environmental Sustainability. Drone emergency response would be a practical application for our research project.

AI↗

NASA NTRS2022

Orbital Trade Study for the PREFIRE Mission

The Polar Radiant Energy in the Far-Infrared Experiment (PREFIRE) is a low-cost cubesat-based Earth Science mission selected for rapid implementation through NASAs Earth Ventures-Instrument program. Two cubesats carrying thermal infrared spectrometers (TIRS) in polar orbits will test long-held assumptions regarding radiative balance at long wavelengths where the cold-dry Arctic and Antarctic surfaces expel significant amounts of the earth's radiant energy. Thermal radiometry with better than one micron sampling at wavelengths beyond 15 microns will provide critical observational bounds for inputs into glacier melt and climate change models through improvements in surface emissivities, longwave greenhouse effect parameterizations, and cloud presence/types. Additional information on potential far-infrared surface/atmosphere feedbacks during rapid melt processes may be captured with sub-diurnal revisits of targeted areas. A baseline mission with two cubesats in different orbits provides a means for optimization of sub-diurnal sampling for science purposes. In this presentation we provide details of orbit studies that inform expected sampling metrics. Candidate orbits are modeled in SGP and then TIRS sampling is projected into surface footprints with appropriate geo-location. Matching algorithms then compile statistics for time-delayed revisits between and within the two orbits. Binning of results by latitude allows for abstraction of precession issues as well as for correlations with surface types as defined by radiometric classification schemes. Multiple acceptable pairs of science-driven orbits were found that optimize sampling in areas known to experience rapid melt events. The final choice of PREFIRE orbital parameters includes the systems trade-space, particularly the power budget, as well as the availability of launch opportunities.

"L'Ecuyer, Tristan"↗

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 OSTI2024

MUPPET: An automated OpenMP mutation testing framework for performance optimization

MUPPET is a tool for OpenMP programs that identifies program modifications, called mutations, aimed at improving program performance. Existing performance optimization techniques, including profiling-based and auto-tuning techniques, fail to indicate program modifications at the source level thus preventing their portability across compilers. MUPPET aims to help HPC developers reason about performance defects and missed opportunities to improve performance at the source code level.

Parasyris, Konstantinos↗

NASA NTRS2018

QAOA Tutorial Outline

In this tutorial we discuss the quantum alternating operator ansatz (QAOA), which is a variational algorithm that can be used for approximate optimization of combinatorial problems with soft and hard constraints.We go through the design of the quantum circuit and its actual implementation in real hardware, discussing compilation issues such as gate synthesis and scheduling of all the required gates and qubit-swapping overhead.

Venturelli, Davide↗

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

Compiler-based code generation and autotuning for geometric multigrid on GPU-accelerated supercomputers

GPUs, with their high bandwidths and computational capabilities are an increasingly popular target for scientific computing. Unfortunately, to date, harnessing the power of the GPU has required use of a GPU-specific programming model like CUDA, OpenCL, or OpenACC. Thus, in order to deliver portability across CPU-based and GPU-accelerated supercomputers, programmers are forced to write and maintain two versions of their applications or frameworks. In this paper, we explore the use of a compiler-based autotuning framework based on CUDA-CHiLL to deliver not only portability, but also performance portability across CPU- and GPU-accelerated platforms for the geometric multigrid linear solvers found in many scientific applications. We also show that with autotuning we can attain near Roofline (a performance bound for a computation and target architecture) performance across the key operations in the miniGMG benchmark for both CPU- and GPU-based architectures as well as for a multiple stencil discretizations and smoothers. We show that our technology is readily interoperable with MPI resulting in performance at scale equal to that obtained via hand-optimized MPI+CUDA implementation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Towards Digital and Performance-Based Supervisory HVAC Control Delivery

Upgrading supervisory HVAC control in commercial buildings is one of the most attractive decarbonization tools at our disposal. Modern controls are software programs and can in theory be deployed at scale and with a low up-front carbon "pulse". In practice, however, control delivery is a disjointed and inefficient process, dominated by manual handoffs of imprecise English language documents. A particularly high barrier exists between control implementation and building energy modeling (BEM) which results in control sequences typically not being tested for correctness or performance before implementation. Together with industry partners, DOE and the national labs are developing an ecosystem of tools and standards that can support fully digital performance-based control delivery workflows. This paper describes this ecosystem, which consists of three mutually supportive efforts. Semantic models of buildings and their systems enable automatic configuration and installation of control software. Platform-neutral control descriptions separate control algorithms from control platforms and enable the creation of libraries of reference control implementations. Dynamic whole-building energy-control simulation that can execute physically realistic control sequences makes it possible to test and evaluate the performance of control sequences and then directly compile them for installation and execution in control systems. In addition to digitizing and streamlining project-level control delivery, these standards and related software support benchmarking of control algorithms, both rule-based and optimization-based, and help to both advance the state of the art and to implement ratings and programs that encourage the adoption of high-performance control.

building controls↗

DOE OSTI2024

Exploring code portability solutions for HEP with a particle tracking test code

Traditionally, high energy physics (HEP) experiments have relied on x86 CPUs for the majority of their significant computing needs. As the field looks ahead to the next generation of experiments such as DUNE and the High-Luminosity LHC, the computing demands are expected to increase dramatically. To cope with this increase, it will be necessary to take advantage of all available computing resources, including GPUs from different vendors. A broad landscape of code portability tools—including compiler pragma-based approaches, abstraction libraries, and other tools—allow the same source code to run efficiently on multiple architectures. In this paper, we use a test code taken from a HEP tracking algorithm to compare the performance and experience of implementing different portability solutions. While in several cases portable implementations perform close to the reference code version, we find that the performance varies significantly depending on the details of the implementation. Achieving optimal performance is not easy, even for relatively simple applications such as the test codes considered in this work. Several factors can affect the performance, such as the choice of the memory layout, the memory pinning strategy, and the compiler used. The compilers and tools are being actively developed, so future developments may be critical for their deployment in HEP experiments.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗