Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “performance gain”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
NASA NTRS2012

Partial Overhaul and Initial Parallel Optimization of KINETICS, a Coupled Dynamics and Chemistry Atmosphere Model

KINETICS is a coupled dynamics and chemistry atmosphere model that is data intensive and computationally demanding. The potential performance gain from using a supercomputer motivates the adaptation from a serial version to a parallelized one. Although the initial parallelization had been done, bottlenecks caused by an abundance of communication calls between processors led to an unfavorable drop in performance. Before starting on the parallel optimization process, a partial overhaul was required because a large emphasis was placed on streamlining the code for user convenience and revising the program to accommodate the new supercomputers at Caltech and JPL. After the first round of optimizations, the partial runtime was reduced by a factor of 23; however, performance gains are dependent on the size of the data, the number of processors requested, and the computer used.

KINETICS↗
NASA NTRS2001

Baseline Validation of Unstructured Grid Reynolds-Averaged Navier-Stokes Toward Flow Control

The value of the use of the Reynolds-averaged Navier-Stokes methodology for active flow control applications is assessed. An experimental flow control database exists for a NACA0015 airfoil modified at the leading edge to implement a fluidic actuator; hence, this configuration is used. Computational results are documented for the baseline wing configuration (no control) with the experimental results and assumes two-dimensional flow. The baseline wing configuration has discontinuities at the leading edge, trailing edge, and aft of midchord on the upper surface. A limited number of active flow control applications have been tested in the laboratory and in flight. These applications include dynamic stall control using a deformable leading edge, separation control for takeoff and landing flight conditions using piezoelectric devices, pulsed vortex generators, zero-net-mass oscillations, and thrust vectoring with zero-net-mass piezoelectric-driven oscillatory actuation. As yet, there is no definitive comparison with experimental data that indicates current computational capabilities can quantitatively predict the large aerodynamic performance gains achieved with active flow control in the laboratory. However, one study using the Reynolds-averaged Navier-Stokes (RANS) methodology has shown good quantitative agreement with experimental results for an isolated zero-net-mass actuator. In addition, some recent studies have used RANS to demonstrate qualitative performance gains compared with the experimental data for separation control on an airfoil. Those quantitative comparisons for both baseline and flow control cases indicated that computational results were in poor quantitative agreement with the experiments. The current research thrust will investigate the potential use of an unstructured grid RANS approach to predict aerodynamic performance for active flow control applications building on the early studies. First the computational results must quantitatively match experiments for the no-control case before proceeding to the time-dependent flow control case. This paper documents the baseline (no-control) case using an unswept airfoil configuration. The next section describes the configurations used for the computations and the experimentals. The computational approach is then described followed by results and concluding remarks.

Joslin, Ronald D.↗
DOE OSTI2023

IRIS-DMEM: Efficient Memory Management for Heterogeneous Computing

This paper proposes an efficient data memory management approach for the Intelligent RuntIme System (IRIS) heterogeneous computing framework along with new data transfer policies. IRIS provides a task-based programming model for extreme heterogeneous computing (e.g., CPU, GPU, DSP, FPGA) with support for today's most important programming languages (e.g., OpenMP, OpenCL, CUDA, HIP, OpenACC). However, the IRIS framework either forces the programmer to introduce data transfer commands for each task or relies on suboptimal memory management for automatic and transparent data transfers. The work described here extends IRIS with novel heterogeneous memory handling and introduces novel data transfer policies by employing the Distributed data MEMory handler (DMEM) for efficient and optimal movement of data among the various computing resources. The proposed approach achieves performance gains of up to 7× for tiled LU factorization and tiled DGEMM (i.e., matrix multiplication) benchmarks. Moreover, this approach also reduces data transfers by up to 71% when compared to previous IRIS heterogeneous memory management handlers. This work compares the performance results of the IRIS framework's novel DMEM with the StarPU runtime and MAGMA math library for GPUs. Experiments show a performance gain of up to 1.95× over StarPU and 2.1× over MAGMA.

Miniskar, Narasinga Rao↗
NASA NTRS2010

Capacity Maximizing Constellations

Some non-traditional signal constellations have been proposed for transmission of data over the Additive White Gaussian Noise (AWGN) channel using such channel-capacity-approaching codes as low-density parity-check (LDPC) or turbo codes. Computational simulations have shown performance gains of more than 1 dB over traditional constellations. These gains could be translated to bandwidth- efficient communications, variously, over longer distances, using less power, or using smaller antennas. The proposed constellations have been used in a bit-interleaved coded modulation system employing state-ofthe-art LDPC codes. In computational simulations, these constellations were shown to afford performance gains over traditional constellations as predicted by the gap between the parallel decoding capacity of the constellations and the Gaussian capacity

Barsoum, Maged↗
NASA NTRS2000

Performance of the OVERFLOW-MLP and LAURA-MLP CFD Codes on the NASA Ames 512 CPU Origin System

The shared memory Multi-Level Parallelism (MLP) technique, developed last year at NASA Ames has been very successful in dramatically improving the performance of important NASA CFD codes. This new and very simple parallel programming technique was first inserted into the OVERFLOW production CFD code in FY 1998. The OVERFLOW-MLP code's parallel performance scaled linearly to 256 CPUs on the NASA Ames 256 CPU Origin 2000 system (steger). Overall performance exceeded 20.1 GFLOP/s, or about 4.5x the performance of a dedicated 16 CPU C90 system. All of this was achieved without any major modification to the original vector based code. The OVERFLOW-MLP code is now in production on the inhouse Origin systems as well as being used offsite at commercial aerospace companies. Partially as a result of this work, NASA Ames has purchased a new 512 CPU Origin 2000 system to further test the limits of parallel performance for NASA codes of interest. This paper presents the performance obtained from the latest optimization efforts on this machine for the LAURA-MLP and OVERFLOW-MLP codes. The Langley Aerothermodynamics Upwind Relaxation Algorithm (LAURA) code is a key simulation tool in the development of the next generation shuttle, interplanetary reentry vehicles, and nearly all "X" plane development. This code sustains about 4-5 GFLOP/s on a dedicated 16 CPU C90. At this rate, expected workloads would require over 100 C90 CPU years of computing over the next few calendar years. It is not feasible to expect that this would be affordable or available to the user community. Dramatic performance gains on cheaper systems are needed. This code is expected to be perhaps the largest consumer of NASA Ames compute cycles per run in the coming year.The OVERFLOW CFD code is extensively used in the government and commercial aerospace communities to evaluate new aircraft designs. It is one of the largest consumers of NASA supercomputing cycles and large simulations of highly resolved full aircraft are routinely undertaken. Typical large problems might require 100s of Cray C90 CPU hours to complete. The dramatic performance gains with the 256 CPU steger system are exciting. Obtaining results in hours instead of months is revolutionizing the way in which aircraft manufacturers are looking at future aircraft simulation work. Figure 2 below is a current state of the art plot of OVERFLOW-MLP performance on the 512 CPU Lomax system. As can be seen, the chart indicates that OVERFLOW-MLP continues to scale linearly with CPU count up to 512 CPUs on a large 35 million point full aircraft RANS simulation. At this point performance is such that a fully converged simulation of 2500 time steps is completed in less than 2 hours of elapsed time. Further work over the next few weeks will improve the performance of this code even further.The LAURA code has been converted to the MLP format as well. This code is currently being optimized for the 512 CPU system. Performance statistics indicate that the goal of 100 GFLOP/s will be achieved by year's end. This amounts to 20x the 16 CPU C90 result and strongly demonstrates the viability of the new parallel systems rapidly solving very large simulations in a production environment.

Taft, James R.↗
NASA NTRS1985

Aerodynamic-structural study of canard wing, dual wing, and conventional wing systems for general aviation applications

An analytical aerodynamic-structural airplane configuration study was conducted to assess performance gains achievable through advanced design concepts. The mission specification was for 350 mph, range of 1500 st. mi., at altitudes between 30,000 and 40,000 ft. Two payload classes were studied - 1200 lb (6 passengers) and 2400 lb (12 passengers). The configurations analyzed included canard wings, closely coupled dual wings, swept forward - swept rearward wings, joined wings, and conventional wing tail arrangements. The results illustrate substantial performance gains possible with the dual wing configuration. These gains result from weight savings due to predicted structural efficiencies. The need for further studies of structural efficiencies for the various advanced configurations was highlighted.

Selberg, B. P.↗
DOE OSTI2020

The potential of quantum annealing for rapid solution structure identification

Abstract The recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations of unquestionable performance gains leveraging novel hardware platforms have faced significant obstacles. One key challenge is understanding the algorithmic properties that distinguish such devices from established optimization approaches. Through the careful design of contrived optimization tasks, this work provides new insights into the computation properties of quantum annealing and suggests that this model has the potential to quickly identify the structure of high-quality solutions. A meticulous comparison to a variety of algorithms spanning both complete and local search suggests that quantum annealing’s performance on the proposed optimization tasks is distinct. This result provides new insights into the time scales and types of optimization problems where quantum annealing has the potential to provide notable performance gains over established optimization algorithms and suggests the development of hybrid algorithms that combine the best features of quantum annealing and state-of-the-art classical approaches.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1982

Performance improvements of single-engine business airplanes by the integration of advanced technologies

An assessment is presented of the performance gains and economic impact of the integration in general aviation aircraft of advanced technologies, relating to such aspects of design as propulsion, natural laminar flow, lift augmentation, unconventional configurations, and advanced aluminum and composite structures. All considerations are with reference to a baseline mission of 1300 nm range and 300-knot cruise speed with a 1300-lb payload, and a baseline aircraft with a 40 lb/sq ft wing loading and an aspect ratio of 8. Extensive analytical results are presented from the NASA-sponsored General Aviation Synthesis Program. Attention is given to the relative performance gains to be expected from the single-engined baseline aircraft's use of a low cost general aviation turbine engine, a spark-ignited reciprocating engine, a diesel engine, and a Wankel rotary engine.

Kohlman, D. L.↗
NASA NTRS2001

Performance of the Wavelet Decomposition on Massively Parallel Architectures

Traditionally, Fourier Transforms have been utilized for performing signal analysis and representation. But although it is straightforward to reconstruct a signal from its Fourier transform, no local description of the signal is included in its Fourier representation. To alleviate this problem, Windowed Fourier transforms and then wavelet transforms have been introduced, and it has been proven that wavelets give a better localization than traditional Fourier transforms, as well as a better division of the time- or space-frequency plane than Windowed Fourier transforms. Because of these properties and after the development of several fast algorithms for computing the wavelet representation of any signal, in particular the Multi-Resolution Analysis (MRA) developed by Mallat, wavelet transforms have increasingly been applied to signal analysis problems, especially real-life problems, in which speed is critical. In this paper we present and compare efficient wavelet decomposition algorithms on different parallel architectures. We report and analyze experimental measurements, using NASA remotely sensed images. Results show that our algorithms achieve significant performance gains on current high performance parallel systems, and meet scientific applications and multimedia requirements. The extensive performance measurements collected over a number of high-performance computer systems have revealed important architectural characteristics of these systems, in relation to the processing demands of the wavelet decomposition of digital images.

El-Ghazawi, Tarek A.↗
NASA NTRS1998

Performance Modeling and Measurement of Parallelized Code for Distributed Shared Memory Multiprocessors

This paper presents a model to evaluate the performance and overhead of parallelizing sequential code using compiler directives for multiprocessing on distributed shared memory (DSM) systems. With increasing popularity of shared address space architectures, it is essential to understand their performance impact on programs that benefit from shared memory multiprocessing. We present a simple model to characterize the performance of programs that are parallelized using compiler directives for shared memory multiprocessing. We parallelized the sequential implementation of NAS benchmarks using native Fortran77 compiler directives for an Origin2000, which is a DSM system based on a cache-coherent Non Uniform Memory Access (ccNUMA) architecture. We report measurement based performance of these parallelized benchmarks from four perspectives: efficacy of parallelization process; scalability; parallelization overhead; and comparison with hand-parallelized and -optimized version of the same benchmarks. Our results indicate that sequential programs can conveniently be parallelized for DSM systems using compiler directives but realizing performance gains as predicted by the performance model depends primarily on minimizing architecture-specific data locality overhead.

Waheed, Abdul↗
NASA NTRS1987

Optimal dynamic remapping of parallel computations

A large class of computations are characterized by a sequence of phases, with phase changes occurring unpredictably. The decision problem was considered regarding the remapping of workload to processors in a parallel computation when the utility of remapping and the future behavior of the workload is uncertain, and phases exhibit stable execution requirements during a given phase, but requirements may change radically between phases. For these problems a workload assignment generated for one phase may hinder performance during the next phase. This problem is treated formally for a probabilistic model of computation with at most two phases. The fundamental problem of balancing the expected remapping performance gain against the delay cost was addressed. Stochastic dynamic programming is used to show that the remapping decision policy minimizing the expected running time of the computation has an extremely simple structure. Because the gain may not be predictable, the performance of a heuristic policy that does not require estimnation of the gain is examined. The heuristic method's feasibility is demonstrated by its use on an adaptive fluid dynamics code on a multiprocessor. The results suggest that except in extreme cases, the remapping decision problem is essentially that of dynamically determining whether gain can be achieved by remapping after a phase change. The results also suggest that this heuristic is applicable to computations with more than two phases.

Nicol, David M.↗
NASA NTRS2014

Design and Development of Aerogel-Based Antennas for Aerospace Applications: A Final Report to the NARI Seedling

As highly porous solids possessing low density and low dielectric permittivity combined with good mechanical properties, polyimide (PI) aerogels offer great promise as an enabling technology for lightweight aircraft antenna systems. While they have been aggressively explored for thermal insulation, barely any effort has been made to leverage these materials for antennas or other applications that take advantage of their aforementioned attributes. In Phase I of the NARI Seedling Project, we fabricated PI aerogels with properties tailored to enable new antenna concepts with performance characteristics (wide bandwidth and high gain) and material properties (low density, environmental stability, and robustness) superior to the state of practice (SOP). We characterized electromagnetic properties, including permittivity, reflectivity, and propagation losses for the aerogels. Simple, prototype planar printed circuit patch antennas from down-selected aerogel formulations were fabricated by molding the aerogels to net shapes and by gold-metalizing the pattern onto the templates via electron beam evaporation in a clean room environment. These aerogel based antennas were benchmarked against current antenna SOP, and exhibited both broader bandwidth and comparable or higher gain performance at appreciably lower mass. Phase II focused on the success of the Phase I results pushing the PI aerogel based antenna technology further by exploring alternative antenna design (i.e., slot coupled antennas) and by examining other techniques for fabricating the antennas including ink jet printing with the goal of optimizing antenna performance and simplifying production. We also examined new aerogel formulations with better moisture and solvent resistance to survive processing conditions. In addition, we investigated more complex antenna designs including passive phased arrays such as 2x4 and 4x8 element arrays to assess the scalability of the aerogel antenna concept. Furthermore, we explored the possibility of developing these arrays in thin, flexible form to make conformable antennas.

insulation↗
DOE OSTI2025

Optimization of the light detection system of the ICARUS detector

The Short Baseline Neutrino (SBN) Program at Fermilab is designed to investigate short-baseline neutrino oscillations and test the hypothesis of sterile neutrinos, motivated by several experimental anomalies observed over the past decades. Within this program, the ICARUS experiment plays a key role. It employs the world’s largest Liquid Argon Time Projection Chamber (LArTPC) and serves as the farthest and most sensitive SBN detector for studying muon and electron neutrino oscillations. A crucial subsystem of the ICARUS detector is the Light Detection System (LDS), which captures the prompt scintillation light produced by neutrino interactions in the 600-ton active liquid Argon volume. This system provides precise timing information that is essential for event reconstruction, the trigger system, and cosmic background rejection. The LDS is composed of 360 Hamamatsu R5912-MOD 8-inch photomultiplier tubes (PMTs), operating under cryogenic conditions ($\sim 87 \ K$) inside the detector’s cryostats. During the detector’s operation at FNAL, a degradation in PMT gain has been observed, attributed to aging under low-temperature conditions. In collaboration with ICARUS teams from INFN Pavia and Catania, I developed an experimental setup to study the temperature-dependent behavior of the PMTs, performing gain measurements both at room temperature and down to $-70°C$ using a climatic chamber at INFN Catania. The results indicate that while the PMTs maintain stable gain at room temperature, a significant and permanent gain reduction occurs at low temperatures. Although $-70°C$ is still warmer than liquid Argon temperatures, the findings clearly demonstrate a gain-dependent performance degradation. The thesis also discusses mitigation strategies implemented in the ICARUS detector to address this issue and presents a simplified model to describe and simulate the observed behavior.

Saia, Clara [Catania U.] (ORCID:0009000464102417)↗
DOE OSTI2021

Accelerating Scientific Applications With SambaNova Reconfigurable Dataflow Architecture

Here, our exploratory work finds that the SambaNova Reconfigurable Dataflow Architecture (RDA) along with the SambaFlow software stack provides for an attractive system and solution to accelerate AI for science workloads. We have observed the efficacy of using the system with a diverse set of science applications and reasoned their suitability for performance gains over traditional hardware. As the Data-Scale system provides for a very large memory capacity, the system can be used to train models that typically do not fit in a GPU. The architecture also provides for deeper integration with upcoming supercomputers at the Argonne Leadership Computing Facility (ALCF), a US Department of Energy Office of Science user facility, to help advance science insights.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Quantum Computing and Visualization: A Disruptive Technological Change Ahead

The focus of this Visualization Viewpoints article is to provide some background on quantum computing (QC), to explore ideas related to how visualization helps in understanding QC, and examine how QC might be useful for visualization with the growth and maturation of both technologies in the future. In a quickly evolving technology landscape, QC is emerging as a promising pathway to overcome the growth limits in classical computing. In some cases, QC platforms offer the potential to vastly outperform the familiar classical computer by solving problems more quickly or that may be intractable on any known classical platform. As further performance gains for classical computing platforms are limited by diminishing Moore’s Law scaling, QC platforms might be viewed as a potential successor to the current field of exascale-class platforms. Importantly, while present-day QC hardware platforms are still limited in scale, the field of quantum computing is robust and rapidly advancing in terms of hardware capabilities, software environments for developing quantum algorithms, and educational programs for training the next generation of scientists and engineers. After a brief introduction to QC concepts, the focus of this article is to explore the interplay between the fields of visualization and QC. First, visualization has played a role in QC by providing the means to show representations of the quantum state of single-qubits in superposition states and multiple-qubits in entangled states. Second, there are a number of ways in which the field of visual data exploration and analysis may potentially benefit from this disruptive new technology though there are challenges going forward.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2002

LPV Controller Interpolation for Improved Gain-Scheduling Control Performance

In this paper, a new gain-scheduling control design approach is proposed by combining LPV (linear parameter-varying) control theory with interpolation techniques. The improvement of gain-scheduled controllers can be achieved from local synthesis of Lyapunov functions and continuous construction of a global Lyapunov function by interpolation. It has been shown that this combined LPV control design scheme is capable of improving closed-loop performance derived from local performance improvement. The gain of the LPV controller will also change continuously across parameter space. The advantages of the newly proposed LPV control is demonstrated through a detailed AMB controller design example.

Wu, Fen↗
DOE OSTI2021

GANpiler

Focal Area(s): Rather than augment or replace physical models with machine learning, we instead preserve the existing models and augment the underlying code with faster surrogate models created by generative adversarial networks (GAN). To leverage the performance optimization, we also propose a runtime system and user interfaces that allow prediction and tracking of accumulated error as well as dynamic, per-process decision making as to which model (if any) to use for each iteration. Science Challenge: This proposal sits at the nexus of two hard problems. First, climate models based on machine learning will be, by their nature, difficult to trust once their predictions begin diverging from the consensus. Second, compilers and hardware have been making only incremental performance gains for decades. GPGPUs have provided a welcome performance boost for codes that can take advantage of them, but there is no similar technology on the horizon to provide the next performance leap.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1986

Dynamic remapping decisions in multi-phase parallel computations

The effectiveness of any given mapping of workload to processors in a parallel system is dependent on the stochastic behavior of the workload. Program behavior is often characterized by a sequence of phases, with phase changes occurring unpredictably. During a phase, the behavior is fairly stable, but may become quite different during the next phase. Thus a workload assignment generated for one phase may hinder performance during the next phase. We consider the problem of deciding whether to remap a paralled computation in the face of uncertainty in remapping's utility. Fundamentally, it is necessary to balance the expected remapping performance gain against the delay cost of remapping. This paper treats this problem formally by constructing a probabilistic model of a computation with at most two phases. We use stochastic dynamic programming to show that the remapping decision policy which minimizes the expected running time of the computation has an extremely simple structure: the optimal decision at any step is followed by comparing the probability of remapping gain against a threshold. This theoretical result stresses the importance of detecting a phase change, and assessing the possibility of gain from remapping. We also empirically study the sensitivity of optimal performance to imprecise decision threshold. Under a wide range of model parameter values, we find nearly optimal performance if remapping is chosen simply when the gain probability is high. These results strongly suggest that except in extreme cases, the remapping decision problem is essentially that of dynamically determining whether gain can be achieved by remapping after a phase change; precise quantification of the decision model parameters is not necessary.

Nicol, D. M.↗