Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Performance 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.

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

At least 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1991

Gigaflop performance on a CRAY-2: Multitasking a computational fluid dynamics application

The methodology is described for converting a large, long-running applications code that executed on a single processor of a CRAY-2 supercomputer to a version that executed efficiently on multiple processors. Although the conversion of every application is different, a discussion of the types of modification used to achieve gigaflop performance is included to assist others in the parallelization of applications for CRAY computers, especially those that were developed for other computers. An existing application, from the discipline of computational fluid dynamics, that had utilized over 2000 hrs of CPU time on CRAY-2 during the previous year was chosen as a test case to study the effectiveness of multitasking on a CRAY-2. The nature of dominant calculations within the application indicated that a sustained computational rate of 1 billion floating-point operations per second, or 1 gigaflop, might be achieved. The code was first analyzed and modified for optimal performance on a single processor in a batch environment. After optimal performance on a single CPU was achieved, the code was modified to use multiple processors in a dedicated environment. The results of these two efforts were merged into a single code that had a sustained computational rate of over 1 gigaflop on a CRAY-2. Timings and analysis of performance are given for both single- and multiple-processor runs.

Tennille, Geoffrey M.↗
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.↗
NASA NTRSDate not supplied

Performance and Portability of a Linear Solver Across Emerging Architectures

A linear solver algorithm used by a large-scale unstructured-grid computational fluid dynamics application is examined for a broad range of familiar and emerging architectures. Efficient implementation of a linear solver is challenging on recent CPUs offering vector architectures. Vector loads and stores are essential to effectively utilize available memory bandwidth on CPUs, and maintaining performance across different CPUs can be difficult in the face of varying vector lengths offered by each. A similar challenge occurs on GPU architectures, where it is essential to have coalesced memory accesses to utilize memory bandwidth effectively. In this work, we demonstrate that restructuring a computation, and possibly data layout, with regard to architecture is essential to achieve optimal performance by establishing a performance benchmark for each target architecture in a low level language such as vector intrinsics or CUDA. In doing so, we demonstrate how a linear solver kernel can be mapped to Intel® Xeon™ and Xeon Phi™, Marvell® ThunderX2®, NEC® SX-Aurora™ TSUBASA Vector Engine, and NVIDIA® and AMD® GPUs. We further demonstrate that the required code restructuring can be achieved in higher level programming environments such as OpenACC, OCCA, and Intel® OneAPI™/SYCL, and that each generally results in optimal performance on the target architecture. Relative performance metrics for all implementations are shown, and subjective ratings for ease of implementation and optimization are suggested.

Programming models↗
DOE OSTI2020

Scalable molecular dynamics on CPU and GPU architectures with NAMD

NAMD is a molecular dynamics program designed for high-performance simulations of very large biological objects on CPU- and GPU-based architectures. NAMD offers scalable performance on petascale parallel supercomputers consisting of hundreds of thousands of cores, as well as on inexpensive commodity clusters commonly found in academic environments. It is written in C++ and leans on Charm++ parallel objects for optimal performance on low-latency architectures. NAMD is a versatile, multipurpose code that gathers state-of-the-art algorithms to carry out simulations in apt thermodynamic ensembles, using the widely popular CHARMM, AMBER, OPLS, and GROMOS biomolecular force fields. Here, we review the main features of NAMD that allow both equilibrium and enhanced-sampling molecular dynamics simulations with numerical efficiency. We describe the underlying concepts utilized by NAMD and their implementation, most notably for handling long-range electrostatics; controlling the temperature, pressure, and pH; applying external potentials on tailored grids; leveraging massively parallel resources in multiple-copy simulations; and hybrid quantum-mechanical/molecular-mechanical descriptions. We detail the variety of options offered by NAMD for enhanced-sampling simulations aimed at determining free-energy differences of either alchemical or geometrical transformations and outline their applicability to specific problems. Last, we discuss the roadmap for the development of NAMD and our current efforts toward achieving optimal performance on GPU-based architectures, for pushing back the limitations that have prevented biologically realistic billion-atom objects to be fruitfully simulated, and for making large-scale simulations less expensive and easier to set up, run, and analyze. NAMD is distributed free of charge with its source code at www.ks.uiuc.edu.

high-performance computing↗
DOE OSTI2022

Turbine scale and siting considerations in wind plant layout optimization and implications for capacity density

Improvements in wind energy technology, reduced costs, and ambitious clean energy goals have led to projections of high wind contribution in coming years. Developing methodologies to design wind plants with a variety of siting constraints and turbine sizes helps enable high wind penetration, and gain a better understanding of how wind plants are sensitive to setback constraints and turbine design. In this paper, we present a two-step optimization method to simultaneously determine the optimal number of turbines and their locations in a wind plant domain divided into many small, discrete parcels. We present the optimized performance metrics of a wind plant optimized with different turbine sizes and ratings, and with different siting restrictions within the wind plant. Our results indicate that taller and larger turbines are more sensitive to increasing siting constraints. We also compare the optimal wind plant layouts and performance for wind plants optimized for minimum COE and maximum profit. Wind plants optimized for profit had 130%-190% of the capacity of plants optimized for COE, which demonstrates that the optimal results are greatly affected by the objective function, which should be carefully considered. Finally, in this paper we demonstrate the effect of increasing siting constraints on wind plant capacity density, and how the results change when different land areas are used to calculate capacity density. When using the entire wind plant boundary area to determine capacity density, increasing siting constraints decreases the capacity density. However, when we only use the available area (the area left after removing the siting constraints) to calculate the capacity density, increasing the siting constraints increases capacity density. This is a critical insight because of how capacity density is typically defined and used in research, and has important implications for assessment of technical potential and capacity expansion modeling, as well as future wind deployment potential.

17 WIND ENERGY↗
NASA NTRS1991

Performance and optimization of a derated ion thruster for auxiliary propulsion

The characteristics and implications of use of a derated ion thruster for north-south stationkeeping (NSSK) propulsion are discussed. A derated thruster is a 30 cm diameter primary propulsion ion thruster operated at highly throttled conditions appropriate to NSSK functions. The performance characteristics of a 30 cm ion thruster are presented, emphasizing throttled operation at low specific impulse and high thrust-to-power ratio. Performance data and component erosion are compared to other NSSK ion thrusters. Operations benefits derived from the performance advantages of the derated approach are examined assuming an INTELSAt 7-type spacecraft. Minimum ground test facility pumping capabilities required to maintain facility enhanced accelerator grid erosion at acceptable levels in a lifetest are quantified as a function of thruster operating condition. Approaches to reducing the derated thruster mass and volume are also discussed.

Patterson, Michael J.↗
NASA NTRS1991

Performance and optimization of a 'derated' ion thruster for auxiliary propulsion

This paper discusses the characteristics and implications of use of a derated ion thruster for north-south-stationkeeping (NSSK) propulsion. A derated thruster is a 30-cm diameter primary propulsion ion thruster operated at highly throttled conditions appropriate to NSSK functions. The performance characteristics of a 30-cm ion thruster are presented, emphasizing throttled operation at low specific impulse and high thrust-to-power ratio. Performance data and component erosion are compared to other NSSK ion thrusters. Operations benefits derived from the performance advantages of the derated approach are examined assuming an Intelsat VII-type spacecraft. Minimum ground test facility pumping capabilities required to maintain facility enhanced accelerator grid erosion at acceptable levels in a lifetest are quantified as a function of thruster operating condition. Novel approaches to reducing the derated thruster mass and volume are also discussed.

Patterson, Michael J.↗
DOE OSTI2023

On-Chip Batteries as Distributed Energy Sources in Heterogeneous 2.5D/3D Integrated Circuits

Energy efficiency in digital systems faces challenges due to the constraints imposed by small-scale transistors. Moreover, the growing demand for portable consumer electronics necessitates the use of compact energy sources. To address these challenges, heterogeneous 3D IC technology has emerged as a promising solution for the former. Regarding the latter, we propose the concept of distributed batteries within a heterogeneous 3D IC. This approach involves utilizing multiple smaller batteries with different specifications among different modules of 3D ICs. This approach optimizes performance and overcomes limitations associated with both 3D ICs and conventional power delivery methods. Distributed batteries play a vital role in effectively managing the heat generated by energy sources and modules within a 3D IC. Furthermore, they contribute to achieving a uniform distribution of heat throughout the entire structure, which ultimately ensures the optimal performance of the batteries and modules. The simulation results indicate a 40 percent enhancement in achieving a more even distribution of generated heat. Additionally, the proposed distributed battery techniques improve power delivery, enhance reliability, and enable optimized voltage regulation while improving efficiency. In addition to the primary benefits, alternative configurations of the proposed approach can offer extra energy storage capacity and act as efficient electromagnetic shields, resulting in an impressive reduction of external electromagnetic noises by 60 dB.

47 OTHER INSTRUMENTATION↗
NASA NTRS1981

Optimization and performance calculation of dual-rotation propellers

An analysis is given which enables the design of dual-rotation propellers. It relies on the use of a new tip loss factor deduced from T. Theodorsen's measurements coupled with the general methodology of C. N. H. Lock. In addition, it includes the effect of drag in optimizing. Some values for the tip loss factor are calculated for one advance ratio.

Davidson, R. E.↗
NASA NTRS1994

On the use of controls for subsonic transport performance improvement: Overview and future directions

Increasing competition among airline manufacturers and operators has highlighted the issue of aircraft efficiency. Fewer aircraft orders have led to an all-out efficiency improvement effort among the manufacturers to maintain if not increase their share of the shrinking number of aircraft sales. Aircraft efficiency is important in airline profitability and is key if fuel prices increase from their current low. In a continuing effort to improve aircraft efficiency and develop an optimal performance technology base, NASA Dryden Flight Research Center developed and flight tested an adaptive performance seeking control system to optimize the quasi-steady-state performance of the F-15 aircraft. The demonstrated technology is equally applicable to transport aircraft although with less improvement. NASA Dryden, in transitioning this technology to transport aircraft, is specifically exploring the feasibility of applying adaptive optimal control techniques to performance optimization of redundant control effectors. A simulation evaluation of a preliminary control law optimizes wing-aileron camber for minimum net aircraft drag. Two submodes are evaluated: one to minimize fuel and the other to maximize velocity. This paper covers the status of performance optimization of the current fleet of subsonic transports. Available integrated controls technologies are reviewed to define approaches using active controls. A candidate control law for adaptive performance optimization is presented along with examples of algorithm operation.

Gilyard, Glenn↗
DOE OSTI2025

Spike-Free Adaptive Sliding Mode Control: Application to Permanent Magnet Synchronous Motors

A new methodology for adaptive sliding mode control (ASMC) has been widely used to improve the control performance in various systems. This method exhibits several advantages, including low sliding mode control (SMC) chattering, no knowledge of the system disturbance bound, and no overestimation of the control gain. Despite its advantages, this method can be hampered by the spike phenomenon, slow control gain convergence, and difficulty in achieving optimal performance under varying disturbances. Consequently, this article proposes a spike-free ASMC method with a disturbance observer (DOB) to address these problems. Previous ASMC methods have been analyzed via simulations to verify the aforementioned problems. Here, this analysis highlights the need for disturbance compensation and improvements in the SMC gain adaptation law. Therefore, a DOB is designed to mitigate the spike phenomenon by compensating for disturbances. Subsequently, an SMC gain adaptation law based on disturbance error estimation is designed to eliminate the spike phenomenon completely. The proposed adaptation law makes the SMC gain to converge to a slightly higher value than the disturbance estimation error. Consequently, the proposed method not only eliminates the spike phenomenon, but also ensures optimal performance under varying disturbances. The performance of the proposed method is experimen tally validated through a comparative study.

42 ENGINEERING↗
NASA NTRS2017

Automation of POST Cases via External Optimizer and "Artificial p2" Calculation

During early conceptual design of complex systems, speed and accuracy are often at odds with one another. While many characteristics of the design are fluctuating rapidly during this phase there is nonetheless a need to acquire accurate data from which to down-select designs as these decisions will have a large impact upon program life-cycle cost. Therefore enabling the conceptual designer to produce accurate data in a timely manner is tantamount to program viability. For conceptual design of launch vehicles, trajectory analysis and optimization is a large hurdle. Tools such as the industry standard Program to Optimize Simulated Trajectories (POST) have traditionally required an expert in the loop for setting up inputs, running the program, and analyzing the output. The solution space for trajectory analysis is in general non-linear and multi-modal requiring an experienced analyst to weed out sub-optimal designs in pursuit of the global optimum. While an experienced analyst presented with a vehicle similar to one which they have already worked on can likely produce optimal performance figures in a timely manner, as soon as the "experienced" or "similar" adjectives are invalid the process can become lengthy. In addition, an experienced analyst working on a similar vehicle may go into the analysis with preconceived ideas about what the vehicle's trajectory should look like which can result in sub-optimal performance being recorded. Thus, in any case but the ideal either time or accuracy can be sacrificed. In the authors' previous work a tool called multiPOST was created which captures the heuristics of a human analyst over the process of executing trajectory analysis with POST. However without the instincts of a human in the loop, this method relied upon Monte Carlo simulation to find successful trajectories. Overall the method has mixed results, and in the context of optimizing multiple vehicles it is inefficient in comparison to the method presented POST's internal optimizer functions like any other gradient-based optimizer. It has a specified variable to optimize whose value is represented as optval, a set of dependent constraints to meet with associated forms and tolerances whose value is represented as p2, and a set of independent variables known as the u-vector to modify in pursuit of optimality. Each of these quantities are calculated or manipulated at a certain phase within the trajectory. The optimizer is further constrained by the requirement that the input u-vector must result in a trajectory which proceeds through each of the prescribed events in the input file. For example, if the input u-vector causes the vehicle to crash before it can achieve the orbital parameters required for a parking orbit, then the run will fail without engaging the optimizer, and a p2 value of exactly zero is returned. This poses a problem, as this "non-connecting" region of the u-vector space is far larger than the "connecting" region which returns a non-zero value of p2 and can be worked on by the internal optimizer. Finding this connecting region and more specifically the global optimum within this region has traditionally required the use of an expert analyst.

Dees, Patrick D.↗
DOE OSTI2024

The Simons Observatory: Design, Optimization, and Performance of Low-Frequency Detectors

The Simons Observatory (SO) is a cosmic microwave background (CMB) experiment located in the Atacama Desert in Chile that will make precise temperature and polarization measurements over six spectral bands ranging from 27 to 285 GHz. Three small aperture telescopes (SATs) and one large aperture telescope (LAT) will house ~60,000 detectors and cover angular scales between one arcminute and tens of degrees. We present the performance of the dichroic, low-frequency (LF) lenslet-coupled sinuous antenna transition-edge sensor (TES) bolometer arrays with bands centered at 27 and 39 GHz. The LF focal plane will primarily characterize Galactic synchrotron emission as a critical part of foreground subtraction from CMB data. We will discuss the design, optimization, and current testing status of these pixels.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2024

pnnl/EZBattery

Cell performance optimization is important for improving the system efficiency of a redox flow battery. To gain better insights into key controlling factors Of system efficiency, this work first proposed a theoretical model for a unit cell by extending a two-dimensional analytic model to a full cell. The model is then used for cell performance optimization after validating it with experimental and numerical modeling data.

Bao, Jie↗
DOE OSTI2023

Towards 5G-Enabled Operational Technology for Process Monitoring and Network Slicing

Cyber-Physical Systems (CPS) are deployed to monitor physical processes in critical cyber-enabled services like power generation. However, CPS ecosystems are typically designed without robust security. While it is important to ensure optimal performance of the Operational Technology (OT) environments, security cannot be overlooked. To modernize traditional OT services, 5G technology is being integrated. 5G technology offers low latency and high availability, making it a suitable infrastructure for managing and monitoring physical processes. How-ever, integrating 5G mechanisms into large-scale OT networks introduces new implementation and performance challenges. Therefore, this paper presents a 5G-enabled CPS architecture (5G-CPS) that describes the necessary components, services, and communication protocols and conducts feasibility study to integrate 5G technology in industrial control system networks to understand the performance merits. The 5G-CPS architecture aims to minimize implementation and operational challenges associated with integrating 5G technology into constrained OT.

Aguayo, Jared M.↗
NASA NTRS2006

Agent Reward Shaping for Alleviating Traffic Congestion

Traffic congestion problems provide a unique environment to study how multi-agent systems promote desired system level behavior. What is particularly interesting in this class of problems is that no individual action is intrinsically "bad" for the system but that combinations of actions among agents lead to undesirable outcomes, As a consequence, agents need to learn how to coordinate their actions with those of other agents, rather than learn a particular set of "good" actions. This problem is ubiquitous in various traffic problems, including selecting departure times for commuters, routes for airlines, and paths for data routers. In this paper we present a multi-agent approach to two traffic problems, where far each driver, an agent selects the most suitable action using reinforcement learning. The agent rewards are based on concepts from collectives and aim to provide the agents with rewards that are both easy to learn and that if learned, lead to good system level behavior. In the first problem, we study how agents learn the best departure times of drivers in a daily commuting environment and how following those departure times alleviates congestion. In the second problem, we study how agents learn to select desirable routes to improve traffic flow and minimize delays for. all drivers.. In both sets of experiments,. agents using collective-based rewards produced near optimal performance (93-96% of optimal) whereas agents using system rewards (63-68%) barely outperformed random action selection (62-64%) and agents using local rewards (48-72%) performed worse than random in some instances.

Tumer, Kagan↗