Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “code optimization”

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 541 records · Page 30

EnergyPlus Interior Radiant Heat Exchange Runtime Performance Improvements

EnergyPlus is the flagship whole-building energy simulation program developed by the US Department of Energy. This paper describes the various approaches to improve the performance of the interior radiant heat exchange algorithm. Vectorization, optimized Basic Linear Algebra Subprograms (BLAS) library, multithreading, and Graphical Processing Unit (GPU) computation are all investigated. The approach with the best performance, while maintaining drop-in compatibility with existing EnergyPlus code, is the optimized BLAS library. However, GPU computing has the potential to reduce simulation time by orders of magnitude with major refactoring to EnergyPlus.

Adams, Mark↗

Codes for a priority queue on a parallel data bus

Some codes for arbitration of priorities among subsystem computers or peripheral device controllers connected to a parallel data bus are described. At arbitration time, several subsystems present wire-OR, parallel code words to the bus, and the central computer can identify the subsystem of highest priority and determine which of two or more transmission services the subsystem requires. A mathematical discussion of the optimality of the codes with regard to the number of subsystems that may participate in the scheme for a given number of wires is presented along with the number of services that each subsystem may request.

Wallis, D. E.↗

High-resolution Thomson parabola for ion analysis

A new, versatile Thomson parabola ion energy (TPIE) analyzer has been designed, constructed, and used at the OMEGA-EP facility. Laser-accelerated multi-MeV ions from hemispherical C targets are transmitted through a W pinhole into a multi-kG magnetic field and subsequently through a parallel electric field of up to 25 kV/cm. The ion drift region has a user-selected length of 10, 50, or 80 cm. With the highest fields, 400-MeV C{sup 6+} and C{sup 5+} may be resolved. TPIE is ten-inch manipulator (TIM)-mounted at OMEGA-EP and can be used opposite either of the EP ps beams. The instrument runs on pressure-interlocked 15-Vdc power available in EP TIM carts. Flux control derives from the insertion depth into the target chamber and the user-selected pinhole dimensions. The detector consists of CR39 backed by an image plate. A fully relativistic simulation code for calculating ion trajectories was employed for design optimization. Excellent agreement of code predictions with the actual ion positions on the detectors is observed. Through pit counting of carbon-ion tracks in CR39, it is shown that conversion efficiency of laser light to energetic carbon ions exceeds {approx}5% for these targets.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Nonequilibrium radiative heating prediction method for aeroassist flowfields with coupling to flowfield solvers

A method for predicting radiation adsorption and emission coefficients in thermochemical nonequilibrium flows is developed. The method is called the Langley optimized radiative nonequilibrium code (LORAN). It applies the smeared band approximation for molecular radiation to produce moderately detailed results and is intended to fill the gap between detailed but costly prediction methods and very fast but highly approximate methods. The optimization of the method to provide efficient solutions allowing coupling to flowfield solvers is discussed. Representative results are obtained and compared to previous nonequilibrium radiation methods, as well as to ground- and flight-measured data. Reasonable agreement is found in all cases. A multidimensional radiative transport method is also developed for axisymmetric flows. Its predictions for wall radiative flux are 20 to 25 percent lower than those of the tangent slab transport method, as expected, though additional investigation of the symmetry and outflow boundary conditions is indicated. The method was applied to the peak heating condition of the aeroassist flight experiment (AFE) trajectory, with results comparable to predictions from other methods. The LORAN method was also applied in conjunction with the computational fluid dynamics (CFD) code LAURA to study the sensitivity of the radiative heating prediction to various models used in nonequilibrium CFD. This study suggests that radiation measurements can provide diagnostic information about the detailed processes occurring in a nonequilibrium flowfield because radiation phenomena are very sensitive to these processes.

Hartung, Lin C.↗

Scalable Triadic Analysis of Large-Scale Graphs: Multi-Core vs. Multi-Processor vs. Multi-Threaded Shared Memory Architectures

Triadic analysis encompasses a useful set of graph mining methods that is centered on the concept of a triad, which is a subgraph of three nodes and the configuration of directed edges across the nodes. Such methods are often applied in the social sciences as well as many other diverse fields. Triadic methods commonly operate on a triad census that counts the number of triads of every possible edge configuration in a graph. Like other graph algorithms, triadic census algorithms do not scale well when graphs reach tens of millions to billions of nodes. To enable the triadic analysis of large-scale graphs, we developed and optimized a triad census algorithm to efficiently execute on shared memory architectures. We will retrace the development and evolution of a parallel triad census algorithm. Over the course of several versions, we continually adapted the code’s data structures and program logic to expose more opportunities to exploit parallelism on shared memory that would translate into improved computational performance. We will recall the critical steps and modifications that occurred during code development and optimization. Furthermore, we will compare the performances of triad census algorithm versions on three specific systems: Cray XMT, HP Superdome, and AMD multi-core NUMA machine. These three systems have shared memory architectures but with markedly different hardware capabilities to manage parallelism.

Triadic analysis, triads, triad census, large-scal↗

Optimal design of geodesically stiffened composite cylindrical shells

An optimization system based on general-purpose finite element code CSM Testbed and optimization program ADS is described. The system can be used to obtain minimum-mass designs of composite shell structures with complex stiffening arrangements. Ply thicknesses, ply orientations, and stiffener heights can be used as design variables. Buckling, displacement, and material failure constraints can be imposed on the design. The system is used to conduct a preliminary design study of geodesically stiffened shells. For comparison purposes, optimal designs of unstiffened shells, and ring and longitudinal stringer stiffened shells are also studied. Trends in the design of geodesically stiffened shells are identified. Features that enhance the capabilities and efficiency of the design system are described.

Gendron, G.↗

Towards Gradient-Based Proprotor Design with VSPAERO

Gradient-based optimization techniques are an attractive approach to solving multidisciplinary design problems. In this work, the status of gradient-based proprotor optimizations with the VSPAERO code are described.

Multidisciplinary optimization↗

An Atmospheric General Circulation Model with Chemistry for the CRAY T3E: Design, Performance Optimization and Coupling to an Ocean Model

The design, implementation and performance optimization on the CRAY T3E of an atmospheric general circulation model (AGCM) which includes the transport of, and chemical reactions among, an arbitrary number of constituents is reviewed. The parallel implementation is based on a two-dimensional (longitude and latitude) data domain decomposition. Initial optimization efforts centered on minimizing the impact of substantial static and weakly-dynamic load imbalances among processors through load redistribution schemes. Recent optimization efforts have centered on single-node optimization. Strategies employed include loop unrolling, both manually and through the compiler, the use of an optimized assembler-code library for special function calls, and restructuring of parts of the code to improve data locality. Data exchanges and synchronizations involved in coupling different data-distributed models can account for a significant fraction of the running time. Therefore, the required scattering and gathering of data must be optimized. In systems such as the T3E, there is much more aggregate bandwidth in the total system than in any particular processor. This suggests a distributed design. The design and implementation of a such distributed 'Data Broker' as a means to efficiently couple the components of our climate system model is described.

Farrara, John D.↗

Bridging Python to Silicon: The SODA Toolchain

Systems performing scientific computing, data analysis, and machine learning tasks have a growing demand for application-specific accelerators that can provide high computational performance while meeting strict size and power requirements. However, the algorithms and applications that need to be accelerated are evolving at a rate that is incompatible with manual design processes based on hardware description languages. Agile hardware design tools based on compiler techniques can help by quickly producing an application-specific integrated circuit (ASIC) accelerator starting from a high-level algorithmic description. Here, we present the software-defined accelerator (SODA) synthesizer, a modular and open-source hardware compiler that provides automated end-to-end synthesis from high-level software frameworks to ASIC implementation, relying on multilevel representations to progressively lower and optimize the input code. Our approach does not require the application developer to write any register-transfer level code, and it is able to reach up to 364 giga floating point operations per second (GFLOPS)/W efficiency (32-bit precision) on typical convolutional neural network operators.

97 MATHEMATICS AND COMPUTING↗

Investigation of Coded Source Neutron Imaging at the North Carolina State University PULSTAR Reactor

A neutron imaging facility is located on beam-tube #5of the 1-MWth PULSTAR reactor at the North Carolina StateUniversity. An investigation has been initiated to explore theapplication of coded imaging techniques at the facility. Codedimaging uses a mosaic of pinholes to encode an aperture, thusgenerating an encoded image of the object at the detector. Toreconstruct the image recorded by the detector, correspondingdecoding patterns are used. The optimized design of coded masksis critical for the performance of this technique and will dependon the characteristics of the imaging beam. In this work, MonteCarlo (MCNP) simulations were utilized to explore the neededmodifications to the PULSTAR thermal neutron beam to supportcoded imaging techniques. In addition, an assessment of codedmask design has been performed. The simulations indicated thata 12 inch single crystal sapphire filter is suited for such anapplication at the PULSTAR beam in terms of maximizing fluxwith good neutron-to-gamma ratio. Computational simulationsdemonstrate the feasibility of correlation reconstruction methodson neutron transmission imaging. A gadolinium aperture withthickness of 500 m was used to construct the mask using a 38 ×34 URA pattern. A test experiment using such a URA design hasbeen conducted and the point spread function of the system hasbeen measured.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

On relaxations of the max k -cut problem formulations

Here, a tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max k-cut problem is a fundamental combinatorial optimization problem with multiple notorious mixed integer optimization formulations. In this paper, we explore four existing mixed integer optimization formulations of the max k-cut problem. Specifically, we show that the continuous relaxation of a binary quadratic optimization formulation of the problem is: (i) stronger than the continuous relaxation of two mixed integer linear optimization formulations and (ii) at least as strong as the continuous relaxation of a mixed integer semidefinite optimization formulation. We also conduct a set of experiments on multiple sets of instances of the max k-cut problem using state-of-the-art solvers that empirically confirm the theoretical results in item (i). Furthermore, these numerical results illustrate the advances in the efficiency of global non-convex quadratic optimization solvers and more general mixed integer nonlinear optimization solvers. As a result, these solvers provide a promising option to solve combinatorial optimization problems. Our codes and data are available on GitHub.

97 MATHEMATICS AND COMPUTING↗

Innovations in optimization and control of accelerators using methods of differential geometry and genetic algorithms (Final Report)

Online tuning of particle accelerators is necessary in order to achieve optimal machine performance. However, it is also a major challenge due to the large parameter space which must be searched and the fact that many of the desir- able objectives compete with one another, and so will not reach their optimal values simultaneously. In order to mitigate these issues, we have explored using dimension-reduction techniques to reduce the size of the parameter space which must be searched and multi-objective genetic algorithms to obtain the sets of tuning parameters which provide pareto-optimal values for the objectives. These methods have enabled us to obtain improved values of the vertical emittance at the Cornell Electron Storage Ring (CESR), and to do so with greater control of orbit errors. Algorithmic tuning is a multidisciplinary endeavour, requiring expertise in beam dynamics, diagnostics, control systems and computer science, and thus a key practical problem is to formulate a common language in which experts with different specialties can communicate. We developed a solution to this problem in the form of a generic accelerator software interface that allows for rapid prototyping of optimization and control algorithms. Our interface is built on the Experimental Physics and Industrial Control Systems (EPICS) and makes possible testing control code in simulation before deployment on real accelerators, as well as deployment of third-party optimization code.

43 PARTICLE ACCELERATORS↗

Engineering Overview of a Multidisciplinary HSCT Design Framework Using Medium-Fidelity Analysis Codes

An objective of the HPCC Program at NASA Langley has been to promote the use of advanced computing techniques to more rapidly solve the problem of multidisciplinary optimization of a supersonic transport configuration. As a result, a software system has been designed and is being implemented to integrate a set of existing discipline analysis codes, some of them CPU-intensive, into a distributed computational framework for the design of a High Speed Civil Transport (HSCT) configuration. The proposed paper will describe the engineering aspects of integrating these analysis codes and additional interface codes into an automated design system. The objective of the design problem is to optimize the aircraft weight for given mission conditions, range, and payload requirements, subject to aerodynamic, structural, and performance constraints. The design variables include both thicknesses of structural elements and geometric parameters that define the external aircraft shape. An optimization model has been adopted that uses the multidisciplinary analysis results and the derivatives of the solution with respect to the design variables to formulate a linearized model that provides input to the CONMIN optimization code, which outputs new values for the design variables. The analysis process begins by deriving the updated geometries and grids from the baseline geometries and grids using the new values for the design variables. This free-form deformation approach provides internal FEM (finite element method) grids that are consistent with aerodynamic surface grids. The next step involves using the derived FEM and section properties in a weights process to calculate detailed weights and the center of gravity location for specified flight conditions. The weights process computes the as-built weight, weight distribution, and weight sensitivities for given aircraft configurations at various mass cases. Currently, two mass cases are considered: cruise and gross take-off weight (GTOW). Weights information is obtained from correlations of data from three sources: 1) as-built initial structural and non-structural weights from an existing database, 2) theoretical FEM structural weights and sensitivities from Genesis, and 3) empirical as-built weight increments, non-structural weights, and weight sensitivities from FLOPS. For the aeroelastic analysis, a variable-fidelity aerodynamic analysis has been adopted. This approach uses infrequent CPU-intensive non-linear CFD to calculate a non-linear correction relative to a linear aero calculation for the same aerodynamic surface at an angle of attack that results in the same configuration lift. For efficiency, this nonlinear correction is applied after each subsequent linear aero solution during the iterations between the aerodynamic and structural analyses. Convergence is achieved when the vehicle shape being used for the aerodynamic calculations is consistent with the structural deformations caused by the aerodynamic loads. To make the structural analyses more efficient, a linearized structural deformation model has been adopted, in which a single stiffness matrix can be used to solve for the deformations under all the load conditions. Using the converged aerodynamic loads, a final set of structural analyses are performed to determine the stress distributions and the buckling conditions for constraint calculation. Performance constraints are obtained by running FLOPS using drag polars that are computed using results from non-linear corrections to the linear aero code plus several codes to provide drag increments due to skin friction, wave drag, and other miscellaneous drag contributions. The status of the integration effort will be presented in the proposed paper, and results will be provided that illustrate the degree of accuracy in the linearizations that have been employed.

Weston, R. P.↗

TRANSP-based optimization towards tokamak scenario development

An optimization approach that incorporates the predictive transport code TRANSP is proposed for tokamak scenario development. Optimization methods are often employed to develop open-loop control strategies to aid access to high performance tokamak scenarios. Generally, the optimization approaches use control-oriented models, i.e. models that are reduced in complexity and prediction accuracy as compared to physics-oriented transport codes such as TRANSP. In the presented approach, an optimization procedure using the TRANSP code to simulate the tokamak plasma is considered for improved predictive capabilities. As a test case, the neutral beam injection (NBI) power is optimized to develop a control strategy that maximizes the noninductive current fraction during the ramp-up phase for NSTX-U. Simulation studies towards the achievement of noninductive ramp-up in NSTX-U have already been carried out with the TRANSP code. The optimization-based approach presented in this work is used to maximize the noninductive current fraction during ramp-up in NSTX-U, demonstrating that the scenario development task can be automated. An additional test case considers optimization of the current ramp rate in DIII-D for obtaining a stationary plasma characterized by a flat loop voltage profile in the flattop phase.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

TRANSP-based Optimization Towards Tokamak Scenario Development

An optimization approach that incorporates the predictive transport code TRANSP is proposed for tokamak scenario development. Optimization methods are often employed to develop open-loop control strategies to aid access to high performance tokamak scenarios. In general, the optimization approaches use control-oriented models, i.e. models that are reduced in complexity and prediction accuracy as compared to physics-oriented transport codes such as TRANSP. In the presented approach, an optimization procedure using the TRANSP code to simulate the tokamak plasma is considered for improved predictive capabilities. As a test case, the neutral beam injection (NBI) power is optimized to develop a control strategy that maximizes the non-inductive current fraction during the ramp-up phase for NSTX-U. Simulation studies towards the achievement of non-inductive ramp up in NSTX-U have already been carried out with the TRANSP code. The optimization-based approach proposed in this work is used to maximize the non-inductive current fraction during ramp-up in NSTX-U, demonstrating that the scenario development task can be automated. An additional test case considers optimization of the current ramp rate in DIII-D for obtaining a stationary plasma characterized bya flat loop voltage profile in the flattop phase.

DIII-D↗