Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “EXECUTIVE CODES”

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

A Case Study of MPI Over Long Distance Connections

Scientific workflows are increasingly being distributed across wide-area networks, and their code executions are expected to span across geographically dispersed computing systems. MPI has been extensively used to support communications for distributed computations, typically, over compute clusters and high-performance systems within a single facility. We present a case study of performance of MPI basic operations over long distance connections, wherein TCP is used for the underlying transport. We present measurements of execution times of MPI codes that utilize MPI Sendrecv operations over emulated 10Gbps connections with 0-366ms round-trip times, including the longest one spanning the globe. They demonstrate that basic MPI codes can be sustained over long distance connections under external packet loss rates up to 10%. They also highlight the qualitative effects of losses which manifest as increased execution times as a consequence of TCP’s loss recovery process.

Rao, Nageswara S.↗

Graphics processing unit accelerated three-dimensional model for the simulation of pulsed low-temperature plasmas

A 3-dimensional particle-in-cell/Monte Carlo collision simulation that is fully implemented on a graphics processing unit (GPU) is described and used to determine low-temperature plasma characteristics at high reduced electric field, E/n, in nitrogen gas. Details of implementation on the GPU using the NVIDIA Compute Unified Device Architecture framework are discussed with respect to efficient code execution. The software is capable of tracking around 10 × 10{sup 6} particles with dynamic weighting and a total mesh size larger than 10{sup 8} cells. Verification of the simulation is performed by comparing the electron energy distribution function and plasma transport parameters to known Boltzmann Equation (BE) solvers. Under the assumption of a uniform electric field and neglecting the build-up of positive ion space charge, the simulation agrees well with the BE solvers. The model is utilized to calculate plasma characteristics of a pulsed, parallel plate discharge. A photoionization model provides the simulation with additional electrons after the initial seeded electron density has drifted towards the anode. Comparison of the performance benefits between the GPU-implementation versus a CPU-implementation is considered, and a speed-up factor of 13 for a 3D relaxation Poisson solver is obtained. Furthermore, a factor 60 speed-up is realized for parallelization of the electron processes.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The Cosmic Linear Anisotropy Solving System (CLASS). Part II: Approximation schemes

Boltzmann codes are used extensively by several groups for constraining cosmological parameters with Cosmic Microwave Background and Large Scale Structure data. This activity is computationally expensive, since a typical project requires from 10{sup 4} to 10{sup 5} Boltzmann code executions. The newly released code CLASS (Cosmic Linear Anisotropy Solving System) incorporates improved approximation schemes leading to a simultaneous gain in speed and precision. We describe here the three approximations used by CLASS for basic ΛCDM models, namely: a baryon-photon tight-coupling approximation which can be set to first order, second order or to a compromise between the two; an ultra-relativistic fluid approximation which had not been implemented in public distributions before; and finally a radiation streaming approximation taking reionisation into account.

79 ASTRONOMY AND ASTROPHYSICS↗

Improving robustness and computational efficiency using modern C++

For nearly two decades, the C++ programming language has been the dominant programming language for experimental HEP. The publication of ISO/IEC 14882:2011, the current version of the international standard for the C++ programming language, makes available a variety of language and library facilities for improving the robustness, expressiveness, and computational efficiency of C++ code. However, much of the C++ written by the experimental HEP community does not take advantage of the features of the language to obtain these benefits, either due to lack of familiarity with these features or concern that these features must somehow be computationally inefficient. In this paper, we address some of the features of modern C+-+, and show how they can be used to make programs that are both robust and computationally efficient. We compare and contrast simple yet realistic examples of some common implementation patterns in C, currently-typical C++, and modern C++, and show (when necessary, down to the level of generated assembly language code) the quality of the executable code produced by recent C++ compilers, with the aim of allowing the HEP community to make informed decisions on the costs and benefits of the use of modern C++.

Paterno, M.↗

Ducted Assembly Steady-State Heat Transfer Software (DASSH): Theory Manual

The Ducted Assembly Steady-State Heat transfer software (DASSH) is being developed at Argonne National Laboratory to obtain a steady-state thermal fluids result for the coolant flow and temperature distribution in a hexagonally gridded reactor core with ducted assemblies. In DASSH, each assembly is assumed to contain a hexagonal bundle of wire-wrapped pins. DASSH divides the coolant in the pin bundle into subchannels on which it applies energy balances to determine coolant and duct temperatures. DASSH offers multiple models for inter assembly heat transfer and features the ability to calculate pin temperatures. This document describes the models and equations implemented in DASSH. It includes a description of the geometric system to which the models are applied and a derivation of the subchannel energy balance formulation is presented. It also reviews the available correlations and provides an overview of the process by which power distributions are generated. Finally, it covers the code execution procedure, discussing the main code objects and their interactions.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Fast Reactor Physics Model Verification Studies using ARC and PyARC Workflows

PyARC was recently developed at Argonne National Laboratory to automate many of the tasks required in the ARC (Argonne Reactor Computation) fast reactor simulation workflow, from input file generation, code execution, data transfer between ARC codes, and output postprocessing. PyARC will likely be the path forward to train new users of the ARC codes with the goal of wide adoption by the national laboratories, academia, and industry. In particular, for the ANL-JAEA collaboration under the Civil Nuclear Working Group (CNWG) project agreement NE-01, PyARC will be used to model the Joyo and EBR-II reactors for comparisons with measured data and calculated results from JAEA (Task 3: Fast Reactor Fuel and Core). As an additional avenue for verification and validation, this report investigates the use of PyARC towards a variety of existing ARC-based reactor models, in order to understand its efficacy in replicating the behavior of base ARC codes and better understand any limitations within modeling realistic fast reactor problems. To this end, PyARC was used to model the Joyo MKI, RBEC Benchmark-M, PRISM Mod-B, and EBR-II Run 138B cores, and its results were compared to those from existing ARC-based models. It was found that for hexagonal-based geometries PyARC was able to replicate the behavior of ARC codes to within 10 pcm for small reactor cores, and ~150pcm difference in eigenvalue for larger cores. These discrepancies are attributed primarily to differences in local mesh refinement options between ARC and PyARC, which currently cannot be resolved with PyARC’s latest version (1.6.0). In some of these cases, PyARC was used to model steady-state problems with initial core compositions originating from a prior REBUS depletion calculation. While PyARC was not designed to support such steady-state calculations, workarounds were applied to replicate the behavior of ARC-based calculations as closely as possible. Thus, these results demonstrate the wide extent to which they can be applied to fast reactor problems while still providing immense benefit to the user in terms of automating and standardizing common routines within the fast reactor analysis workflow. This study concluded that PyARC will be suitable for modeling the steady-state conditions of the EBR-II and Joyo fast reactors as part of the CNWG project agreement.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

ThunderBoltz API

The ThunderBoltz application programming interface (API) code is written in Python and is comprised of a set of tools to facilitate compilation of the ThunderBoltz code, as well as fast assembly and formatting of input files for the ThunderBoltz code, post-processing tools of ThunderBoltz results, plotting tools, and runs/schedules the ThunderBoltz code executable for calculations. The ThunderBoltz API code is utilized for importing and manipulating input cross section sets, input conditions, and any other simulation settings made available within the ThunderBoltz input deck via user-defined settings or via automatic generation. The API comes with a set of plotting capabilities of input cross sections, results from ThunderBoltz, and post-processed results carried out with the API.

Park, Ryan↗

Dynamic wavefront creation for processing units using a hybrid compactor

A method, a non-transitory computer readable medium, and a processor for repacking dynamic wavefronts during program code execution on a processing unit, each dynamic wavefront including multiple threads are presented. If a branch instruction is detected, a determination is made whether all wavefronts following a same control path in the program code have reached a compaction point, which is the branch instruction. If no branch instruction is detected in executing the program code, a determination is made whether all wavefronts following the same control path have reached a reconvergence point, which is a beginning of a program code segment to be executed by both a taken branch and a not taken branch from a previous branch instruction. The dynamic wavefronts are repacked with all threads that follow the same control path, if all wavefronts following the same control path have reached the branch instruction or the reconvergence point.

97 MATHEMATICS AND COMPUTING↗

SimApp 1.8.x

System for converting DESIRE (Direct Executing Simulation in Real Time) simulation models to executable code models (C# / C++). These converted models are used as the basis for 2 products, one of which is the focus of this review: an engineering design interface for Fissile Solution Systems. ModelConverter.exe (C#) converts DESIRE model inputs to a C++ plug-in subclass. SimApp.exe (C# / C++) has a C++ dll that is a numerical integration engine that the Converted models plug into. The engineering design interface is a C# GUI that calls on the C++ dll to execute a particular converted model. The GUI allows the user to specify the length of a simulation, run the simulation, view data plots and data tables. Stability plots may also be produced and manipulated. The engineering design interface will be released as source code and executable; the model converter source is also intended for release.

Determan, JohnC.↗

SimApp 1.8.x

System for converting DESIRE (Direct Executing Simulation in Real Time) simulation models to executable code models (C# / C++). These converted models are used as the basis for 2 products, one of which is the focus of this review: an engineering design interface for Fissile Solution Systems. ModelConverter.exe (C#) converts DESIRE model inputs to a C++ plug-in subclass. SimApp.exe (C# / C++) has a C++ dll that is a numerical integration engine that the Converted models plug into. The engineering design interface is a C# GUI that calls on the C++ dll to execute a particular converted model. The GUI allows the user to specify the length of a simulation, run the simulation, view data plots and data tables. Stability plots may also be produced and manipulated. The engineering design interface will be released as source code and executable; the model converter source is also intended for release.

Determan, John C.↗

TRAPEDS: Producing traces for multicomputers via execution-driven simulation

Trace-driven simulation is an important aid in performance analysis of computer systems. Capturing address traces for these simulations is a difficult problem for single processors and particularly for multicomputers. Even when existing trace methods can be used on multicomputers, the amount of collected data typically grows with the number of processors, so I/O and trace storage costs increase. A new technique is presented which modifies the executable code to dynamically collect the address trace from the user code and analyzes this trace during the execution of the program. This method helps resolve the I/O and storage problems and facilitates parallel analysis of the address trace. If a trace stored on disk is desired, the generated trace information can also be written to files during execution, with a resultant drop in program execution speed. An initial implementation on the Intel iPSC/2 hypercube multicomputer is detailed, and sample simulation results are presented. The effect of this trace collection method on execution time is illustrated.

Stunkel, Craig B.↗

TRAPEDS - Producing traces for multicomputers via execution driven simulation

Trace-driven simulation is an important aid in performance analysis of computer systems. Capturing address traces for these simulations is a difficult problem for single processors and particularly for multicomputers. Even when existing trace methods can be used on multicomputers, the amount of collected data typically grows with the number of processors, so I/O and trace storage costs increase. A new technique is presented which modifies the executable code to dynamically collect the address trace from the user code and analyzes this trace during the execution of the program. This method helps resolve the I/O and storage problems and facilitates parallel analysis of the address trace. If a trace stored on disk is desired, the generated trace information can also be written to files during execution, with a resultant drop in program execution speed. An initial implementation on the Intel iPSC/2 hypercube multicomputer is detailed, and sample simulation results are presented. The effect of this trace collection method on execution time is illustrated.

Stunkel, Craig B.↗

Injecting Errors for Testing Built-In Test Software

Two algorithms have been conceived to enable automated, thorough testing of Built-in test (BIT) software. The first algorithm applies to BIT routines that define pass/fail criteria based on values of data read from such hardware devices as memories, input ports, or registers. This algorithm simulates effects of errors in a device under test by (1) intercepting data from the device and (2) performing AND operations between the data and the data mask specific to the device. This operation yields values not expected by the BIT routine. This algorithm entails very small, permanent instrumentation of the software under test (SUT) for performing the AND operations. The second algorithm applies to BIT programs that provide services to users application programs via commands or callable interfaces and requires a capability for test-driver software to read and write the memory used in execution of the SUT. This algorithm identifies all SUT code execution addresses where errors are to be injected, then temporarily replaces the code at those addresses with small test code sequences to inject latent severe errors, then determines whether, as desired, the SUT detects the errors and recovers

Gender, Thomas K.↗

Optimized scalar promotion with load and splat SIMD instructions

Mechanisms for optimizing scalar code executed on a single instruction multiple data (SIMD) engine are provided. Placement of vector operation-splat operations may be determined based on an identification of scalar and SIMD operations in an original code representation. The original code representation may be modified to insert the vector operation-splat operations based on the determined placement of vector operation-splat operations to generate a first modified code representation. Placement of separate splat operations may be determined based on identification of scalar and SIMD operations in the first modified code representation. The first modified code representation may be modified to insert or delete separate splat operations based on the determined placement of the separate splat operations to generate a second modified code representation. SIMD code may be output based on the second modified code representation for execution by the SIMD engine.

97 MATHEMATICS AND COMPUTING↗

Optimized scalar promotion with load and splat SIMD instructions

Mechanisms for optimizing scalar code executed on a single instruction multiple data (SIMD) engine are provided. Placement of vector operation-splat operations may be determined based on an identification of scalar and SIMD operations in an original code representation. The original code representation may be modified to insert the vector operation-splat operations based on the determined placement of vector operation-splat operations to generate a first modified code representation. Placement of separate splat operations may be determined based on identification of scalar and SIMD operations in the first modified code representation. The first modified code representation may be modified to insert or delete separate splat operations based on the determined placement of the separate splat operations to generate a second modified code representation. SIMD code may be output based on the second modified code representation for execution by the SIMD engine.

97 MATHEMATICS AND COMPUTING↗

Transferring ecosystem simulation codes to supercomputers

Many ecosystem simulation computer codes have been developed in the last twenty-five years. This development took place initially on main-frame computers, then mini-computers, and more recently, on micro-computers and workstations. Supercomputing platforms (both parallel and distributed systems) have been largely unused, however, because of the perceived difficulty in accessing and using the machines. Also, significant differences in the system architectures of sequential, scalar computers and parallel and/or vector supercomputers must be considered. We have transferred a grassland simulation model (developed on a VAX) to a Cray Y-MP/C90. We describe porting the model to the Cray and the changes we made to exploit the parallelism in the application and improve code execution. The Cray executed the model 30 times faster than the VAX and 10 times faster than a Unix workstation. We achieved an additional speedup of 30 percent by using the compiler's vectoring and 'in-line' capabilities. The code runs at only about 5 percent of the Cray's peak speed because it ineffectively uses the vector and parallel processing capabilities of the Cray. We expect that by restructuring the code, it could execute an additional six to ten times faster.

Skiles, J. W.↗

From Verified Models to Verifiable Code

Declarative specifications of digital systems often contain parts that can be automatically translated into executable code. Automated code generation may reduce or eliminate the kinds of errors typically introduced through manual code writing. For this approach to be effective, the generated code should be reasonably efficient and, more importantly, verifiable. This paper presents a prototype code generator for the Prototype Verification System (PVS) that translates a subset of PVS functional specifications into an intermediate language and subsequently to multiple target programming languages. Several case studies are presented to illustrate the tool's functionality. The generated code can be analyzed by software verification tools such as verification condition generators, static analyzers, and software model-checkers to increase the confidence that the generated code is correct.

Lensink, Leonard↗

A Flang Plugin for Fortran Feature Characterization

As new compute systems are developed, there is still a need to compile and execute codes authored in Fortran on these leading edge systems. In order to achieve this, development of compilers that support the latest hardware is continuously under development. Though the specification of Fortran is extensive, it is helpful to compiler authors to be able to prioritize the development of key features in order to get certain codes deemed important, e.g., applications of interest to leadership computing facilities, executable on leading edge compute systems. Identifying key features though is largely done through querying software experts or users of the Fortran applications of interest, who then manually report what features are and are not present. This exercise can both time consuming and error prone. To automate this process, we present a compiler plugin to Flang, the Fortran frontend for LLVM. This plugin is a tool that operates on the parse tree representation generated by Flang and detects key features based on walking parse tree nodes that correspond to features of interest. We show the result of our tool on four applications, three of which were manually profiled by software experts. We show the discrepancies between our tool and the manual characterization of the three applications, as well as generate a characterization for an application not yet profiled. We intend to open-source our tool in order to invite the community to benefit from the tool and make contributions for other features.

Cabrera, Anthony [ORNL]↗