Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Code Manual”

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 505 records · Page 28

Performance Evaluation of Heterogeneous GPU Programming Frameworks for Hemodynamic Simulations

Preparing for the deployment of large scientific and engineering codes on upcoming exascale systems with GPU-dense nodes is made challenging by the unprecedented diversity of device architectures and heterogeneous programming models. In this work, we evaluate the process of porting a massively parallel, fluid dynamics code written in CUDA to SYCL, HIP, and Kokkos with a range of backends, using a combination of automated tools and manual tuning. We use a proxy application along with a custom performance model to inform the results and identify additional optimization strategies. At scale performance of the programming model implementations are evaluated on pre-production GPU node architectures for Frontier and Aurora, as well as on current NVIDIA device-based systems Summit and Polaris. Real-world workloads representing 3D blood flow calculations in complex vasculature are assessed. Our analysis highlights critical trade-offs between code performance, portability, and development time.

Martin, Aristotle↗

Sierra/SD - Verification Test Manual - 4.56

This document presents tests from the Sierra Structural Mechanics verification test suite. Each of these tests is run nightly with the Sierra/SD code suite and the results of the test checked versus the correct analytic result. For each of the tests presented in this document the test setup, derivation of the analytic solution, and comparison of the Sierra/SD code results to the analytic solution is provided. This document can be used to confirm that a given code capability is verified or referenced as a compilation of example problems.

97 MATHEMATICS AND COMPUTING↗

Sierra/SD – Verification Test Manual – 5.0

This document presents tests from the Sierra Structural Mechanics verification test suite. Each of these tests is run nightly with the Sierra/SD code suite and the results of the test checked versus the correct analytic result. For each of the tests presented in this document the test setup, derivation of the analytic solution, and comparison of the Sierra/SD code results to the analytic solution is provided. This document can be used to confirm that a given code capability is verified or referenced as a compilation of example problems.

97 MATHEMATICS AND COMPUTING↗

Sierra/SD–Verification Test Manual - 4.58

This document presents tests from the Sierra Structural Mechanics verification test suite. Each of these tests is run nightly with the Sierra/SD code suite and the results of the test checked versus the correct analytic result. For each of the tests presented in this document the test setup, derivation of the analytic solution, and comparison of the Sierra/SD code results to the analytic solution is provided. This document can be used to confirm that a given code capability is verified or referenced as a compilation of example problems.

97 MATHEMATICS AND COMPUTING↗

Sierra/SD - Verification Test Manual - 5.2

This document presents tests from the Sierra Structural Mechanics verification test suite. Each of these tests is run nightly with the Sierra/SD code suite and the results of the test checked versus the correct analytic result. For each of the tests presented in this document the test setup, derivation of the analytic solution, and comparison of the Sierra/SD code results to the analytic solution is provided. This document can be used to confirm that a given code capability is verified or referenced as a compilation of example problems.

97 MATHEMATICS AND COMPUTING↗

Sierra/SD - Verification Test Manual - 5.4

This document presents tests from the Sierra Structural Mechanics verification test suite. Each of these tests is run nightly with the Sierra/SD code suite and the results of the test checked versus the correct analytic result. For each of the tests presented in this document the test setup, derivation of the analytic solution, and comparison of the Sierra/SD code results to the analytic solution is provided. This document can be used to confirm that a given code capability is verified or referenced as a compilation of example problems.

97 MATHEMATICS AND COMPUTING↗

Sierra/SD - Verification Test Manual - 5.6

This document presents tests from the Sierra Structural Mechanics verification test suite. Each of these tests is run nightly with the Sierra/SD code suite and the results of the test checked versus the correct analytic result. For each of the tests presented in this document the test setup, derivation of the analytic solution, and comparison of the Sierra/SD code results to the analytic solution is provided. This document can be used to confirm that a given code capability is verified or referenced as a compilation of example problems.

97 MATHEMATICS AND COMPUTING↗

Sierra/SD - Verification Test Manual - 5.8

This document presents tests from the Sierra Structural Mechanics verification test suite. Each of these tests is run nightly with the Sierra/SD code suite and the results of the test checked versus the correct analytic result. For each of the tests presented in this document the test setup, derivation of the analytic solution, and comparison of the Sierra/SD code results to the analytic solution is provided. This document can be used to confirm that a given code capability is verified or referenced as a compilation of example problems.

97 MATHEMATICS AND COMPUTING↗

Sierra/SD: Verification Test Manual - 5.10

This document presents tests from the Sierra Structural Mechanics verification test suite. Each of these tests is run nightly with the Sierra/SD code suite and the results of the test checked versus the correct analytic result. For each of the tests presented in this document the test setup, derivation of the analytic solution, and comparison of the Sierra/SD code results to the analytic solution is provided. This document can be used to confirm that a given code capability is verified or referenced as a compilation of example problems.

97 MATHEMATICS AND COMPUTING↗

A manual for PARTI runtime primitives

Primitives are presented that are designed to help users efficiently program irregular problems (e.g., unstructured mesh sweeps, sparse matrix codes, adaptive mesh partial differential equations solvers) on distributed memory machines. These primitives are also designed for use in compilers for distributed memory multiprocessors. Communications patterns are captured at runtime, and the appropriate send and receive messages are automatically generated.

Berryman, Harry↗

Consist v0.1.0

A Python library for provenance tracking, intelligent caching, and data virtualization in scientific simulation workflows. It automatically records code, configuration, and input data to skip redundant computations and enables querying results across many runs without manual bookkeeping. Designed to support multi-model simulation workflows like the BEAM CORE toolset at LBL, but designed to be extensible to a wide range of research workflows. Combines lineage tracking features as provided by OpenLineage with deterministic hashing like SnakeMake, and adds powerful analysis tools on model outputs.

Needell, Zachary [Lawrence Berkeley National Labor↗

Optimization Studies of Radiation Shielding for PIP-II Project at Fermilab

The Proton Improvement Plan-II (PIP-II) at Fermilab represents a significant advancement in the quest to answer some of the most profound questions about our universe using the world's most intense high-energy neutrino beam. The project requires the construction of a new addition to the Fermilab accelerator complex – an 800-MeV high-intensity superconducting linear accelerator. Ensuring the safety and regulatory compliance of this ambitious project is paramount, necessitating thorough dose rate assessments under both normal operational and accidental scenarios to align with the Fermilab Radiological Control Manual (FRCM) standards. Our approach included a shielding optimization used for the simulations with the Monte Carlo code MARS [1,2,3] to incorporate new magnet and collimator designs, essential for reflecting the current state of PIP-II infrastructure. The implementation of high-resolution detector planes, despite their computational demands, enabled us to gather detailed radiation field data crucial for optimizing shielding configurations. To overcome the significant computational demands, we developed a branching code that drastically reduced simulation runtimes while maintaining statistical integrity. This was achieved through geometry splitting and the application of Russian Roulette techniques, tailored to prioritize regions of interest based on predefined importances and weight limits.

43 PARTICLE ACCELERATORS↗

Optimization Studies of Radiation Shielding for PIP-II Project at Fermilab

The Proton Improvement Plan-II (PIP-II) at Fermilab represents a significant advancement in the quest to answer some of the most profound questions about our universe using the world's most intense high-energy neutrino beam. The project requires the construction of a new addition to the Fermilab accelerator complex – an 800-MeV high-intensity superconducting linear accelerator. Ensuring the safety and regulatory compliance of this ambitious project is paramount, necessitating thorough dose rate assessments under both normal operational and accidental scenarios to align with the Fermilab Radiological Control Manual (FRCM) standards. Our approach included a shielding optimization used for the simulations with the Monte Carlo code MARS [1,2,3] to incorporate new magnet and collimator designs, essential for reflecting the current state of PIP-II infrastructure. The implementation of high-resolution detector planes, despite their computational demands, enabled us to gather detailed radiation field data crucial for optimizing shielding configurations. To overcome the significant computational demands, we developed a branching code that drastically reduced simulation runtimes while maintaining statistical integrity. This was achieved through geometry splitting and the application of Russian Roulette techniques, tailored to prioritize regions of interest based on predefined importances and weight limits.

Makovec, Alajos↗

HYTESS: A hypothetical turbofan engine simplified simulation

A users manual for a hypothetical turbofan engine simplified simulation is presented. This digital simulation exists as FORTRAN source code. The program is self-contained and was developed to offer those interested in engine dynamics and controls research an efficient, realistic, and easily used engine simulation. The engine is modeled using a state space formulation. Matrix elements within the linear state space structure are nonlinear functions of various engine variables.

Merrill, W. C.↗

User's guide to PMESH: A grid-generation program for single-rotation and counterrotation advanced turboprops

A detailed operating manual is presented for a grid generating program that produces 3-D meshes for advanced turboprops. The code uses both algebraic and elliptic partial differential equation methods to generate single rotation and counterrotation, H or C type meshes for the z - r planes and H type for the z - theta planes. The code allows easy specification of geometrical constraints (such as blade angle, location of bounding surfaces, etc.), mesh control parameters (point distribution near blades and nacelle, number of grid points desired, etc.), and it has good runtime diagnostics. An overview is provided of the mesh generation procedure, sample input dataset with detailed explanation of all input, and example meshes.

Warsi, Saif A.↗

Theory and Computation of Optimal Low- and Medium- Thrust Orbit Transfers

This report presents new theoretical results which lead to new algorithms for the computation of fuel-optimal multiple-burn orbit transfers of low and medium thrust. Theoretical results introduced herein show how to add burns to an optimal trajectory and show that the traditional set of necessary conditions may be replaced with a much simpler set of equations. Numerical results are presented to demonstrate the utility of the theoretical results and the new algorithms. Two indirect methods from the literature are shown to be effective for the optimal orbit transfer problem with relatively small numbers of burns. These methods are the Minimizing Boundary Condition Method (MBCM) and BOUNDSCO. Both of these methods make use of the first-order necessary conditions exactly as derived by optimal control theory. Perturbations due to Earth's oblateness and atmospheric drag are considered. These perturbations are of greatest interest for transfers that take place between low Earth orbit altitudes and geosynchronous orbit altitudes. Example extremal solutions including these effects and computed by the aforementioned methods are presented. An investigation is also made into a suboptimal multiple-burn guidance scheme. The FORTRAN code developed for this study has been collected together in a package named ORBPACK. ORBPACK's user manual is provided as an appendix to this report.

Goodson, Troy D.↗

EUPDF-II: An Eulerian Joint Scalar Monte Carlo PDF Module : User's Manual

EUPDF-II provides the solution for the species and temperature fields based on an evolution equation for PDF (Probability Density Function) and it is developed mainly for application with sprays, combustion, parallel computing, and unstructured grids. It is designed to be massively parallel and could easily be coupled with any existing gas-phase CFD and spray solvers. The solver accommodates the use of an unstructured mesh with mixed elements of either triangular, quadrilateral, and/or tetrahedral type. The manual provides the user with an understanding of the various models involved in the PDF formulation, its code structure and solution algorithm, and various other issues related to parallelization and its coupling with other solvers. The source code of EUPDF-II will be available with National Combustion Code (NCC) as a complete package.

Raju, M. S.↗

Traceability Through Automatic Program Generation

Program synthesis is a technique for automatically deriving programs from specifications of their behavior. One of the arguments made in favour of program synthesis is that it allows one to trace from the specification to the program. One way in which traceability information can be derived is to augment the program synthesis system so that manipulations and calculations it carries out during the synthesis process are annotated with information on what the manipulations and calculations were and why they were made. This information is then accumulated throughout the synthesis process, at the end of which, every artifact produced by the synthesis is annotated with a complete history relating it to every other artifact (including the source specification) which influenced its construction. This approach requires modification of the entire synthesis system - which is labor-intensive and hard to do without influencing its behavior. In this paper, we introduce a novel, lightweight technique for deriving traceability from a program specification to the corresponding synthesized code. Once a program has been successfully synthesized from a specification, small changes are systematically made to the specification and the effects on the synthesized program observed. We have partially automated the technique and applied it in an experiment to one of our program synthesis systems, AUTOFILTER, and to the GNU C compiler, GCC. The results are promising: 1. Manual inspection of the results indicates that most of the connections derived from the source (a specification in the case of AUTOFILTER, C source code in the case of GCC) to its generated target (C source code in the case of AUTOFILTER, assembly language code in the case of GCC) are correct. 2. Around half of the lines in the target can be traced to at least one line of the source. 3. Small changes in the source often induce only small changes in the target.

Richardson, Julian↗