Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational environment”

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

A Multidisciplinary Modeling Approach of Plant Gas Exchange in Reduced Gravity Environments

In-situ food production is a necessary step for human exploration of the solar system and requires a deep understanding of plant growth in reduced gravity environments. In particular, the lack of buoyancy-driven convection changes the gas exchange at the leaf surface, which decreases photosynthesis and transpiration rates, and ultimately biomass production. To understand the intricate relations between physical, chemical, and biochemical processes, the following methodology combines the development of a mechanistic model of plant growth in reduced gravity environments, computational fluid dynamics (CFD) simulations, and experiments in different time frames.The model presented here is a coupled mass and energy balance using the single round leaf assumption, including gravity as an entry parameter, and the leaf surface temperature as an output variable. Measures of the leaf surface temperature using infra-red cameras allow for a computation of the transpiration rate. This approach was followed to design a parabolic flight experiment, which performed 7 flights, and enabled data collection for model validation in different gravity and ventilation settings on a short time frame. Current measures of carbon assimilation and transpiration rate at the leaf and canopy level using an infra-red gas analyzer (Li-6800) in 1g lab conditions on several species will enable a validation on longer time frames and further calibration of the model. CFD studies both on the parabolic flight and on the lab experimental set-up allow the precise assessment of ventilation above the canopy and plants' leaves.Ultimately, this work will provide recommendations for the design of future plant growth hardware, especially on the lowest adequate ventilation for optimal plant growth in reduced gravity environments, as well as assessing biomass and oxygen production rates on planetary surfaces and space stations. This work was funded by CNES, CNRS, Clermont Auvergne Metropole, and NASA Space Biology through NASA postdoctoral program / USRA.

Poulet, Lucie↗

Sierra/SolidMechanics 4.56 User's Guide

Siera/SolidMechanics (Sierra / SM) is a Lagrangian, three-dimensional code for finite element analysis of solids and structures. It provides capabilities for explicit dynamic, implicit quasistatic and dynamic analyses. The explicit dynamics capabilities allow for the efficient and robust solution of models with extensive contact subjected to large, suddenly applied loads. For implicit problems, Sierra / SM uses a multi-level iterative solver, which enables it to effectively solve problems with large deformations, nonlinear material behavior, and contact. Sierra / SM has a versatile library of continuum and structural elements, and a large library of material models. The code is written for parallel computing environments enabling scalable solutions of extremely large problems for both implicit and explicit analyses. It is built on the SIERRA Framework, which facilitates coupling with other SIERRA mechanics codes . This document describes the functionality and input syntax for Sierra/SM.

97 MATHEMATICS AND COMPUTING↗

Sierra/SolidMechanics 4.56.2 User's Guide

Sierra/SolidMechanics (Sierra/SM) is a Lagrangian, three-dimensional code for finite element analysis of solids and structures. It provides capabilities for explicit dynamic, implicit quasistatic and dynamic analyses. The explicit dynamics capabilities allow for the efficient and robust solution of models with extensive contact subjected to large, suddenly applied loads. For implicit problems, Sierra/SM uses a multi-level iterative solver, which enables it to effectively solve problems with large deformations, nonlinear material behavior, and contact. Sierra/SM has a versatile library of continuum and structural elements, and a large library of material models. The code is written for parallel computing environments enabling scalable solutions of extremely large problems for both implicit and explicit analyses. It is built on the SIERRA Framework, which facilitates coupling with other SIERRA mechanics codes . This document describes the functionality and input syntax for Sierra/SM.

97 MATHEMATICS AND COMPUTING↗

Sierra/SolidMechanics 5.2 User's Guide

Sierra/SolidMechanics (Sierra/SM) is a Lagrangian, three-dimensional code for finite element analysis of solids and structures. It provides capabilities for explicit dynamic, implicit quasistatic and dynamic analyses. The explicit dynamics capabilities allow for the efficient and robust solution of models with extensive contact subjected to large, suddenly applied loads. For implicit problems, Sierra/SM uses a multi-level iterative solver, which enables it to effectively solve problems with large deformations, nonlinear material behavior, and contact. Sierra/SM has a versatile library of continuum and structural elements, and a large library of material models. The code is written for parallel computing environments enabling scalable solutions of extremely large problems for both implicit and explicit analyses. It is built on the SIERRA Framework, which facilitates coupling with other SIERRA mechanics codes. This document describes the functionality and input syntax for Sierra/SM.

97 MATHEMATICS AND COMPUTING↗

The Benefits of Adaptive Partitioning for Parallel AMR Applications

Parallel adaptive mesh refinement methods potentially lead to realistic modeling of complex three-dimensional physical phenomena. However, the dynamics inherent in these methods present significant challenges in data partitioning and load balancing. Significant human resources, including time, effort, experience, and knowledge, are required for determining the optimal partitioning technique for each new simulation. In reality, scientists resort to using the on-board partitioner of the computational framework, or to using the partitioning industry standard, ParMetis. Adaptive partitioning refers to repeatedly selecting, configuring and invoking the optimal partitioning technique at run-time, based on the current state of the computer and application. In theory, adaptive partitioning automatically delivers superior performance and eliminates the need for repeatedly spending valuable human resources for determining the optimal static partitioning technique. In practice, however, enabling frameworks are non-existent due to the inherent significant inter-disciplinary research challenges. This paper presents a study of a simple implementation of adaptive partitioning and discusses implied potential benefits from the perspective of common groups of users within computational science. The study is based on a large set of data derived from experiments including six real-life, multi-time-step adaptive applications from various scientific domains, five complementing and fundamentally different partitioning techniques, a large set of parameters corresponding to a wide spectrum of computing environments, and a flexible cost function that considers the relative impact of multiple partitioning metrics and diverse partitioning objectives. The results show that even a simple implementation of adaptive partitioning can automatically generate results statistically equivalent to the best static partitioning. Thus, it is possible to effectively eliminate the problem of determining the best partitioning technique for new simulations. Moreover. the results show that adaptive partitioning can provide a performance gain of about 10 percent on average as compared to routinely using the industry-standard, ParMetis.

97 MATHEMATICS AND COMPUTING↗

U.S. Department of Energy Best Practices Workshop onFile Systems & Archives San Francisco, CA September 26-27, 2011 Position Paper

This position paper discusses issues of usability of the large parallel file systems in the Livermore Computing Center. The primary uses of these file systems are for storage and access of data that is created during the course of a simulation running on an LC system. The Livermore Computing Center has multiple, globally mounted parallel file systems in each of its computing environments. The single biggest issue of file system usability that we have encountered through the years is to maintain continuous file system responsiveness. Given the back end storage hardware that our file systems are provisioned with, it is easily possible for a particularly I/O intensive application or one with particularly inefficiently coded I/O operations to bring the file system to an apparent halt. The practice that we will be addressing is one of having an ability to indentify, diagnose, analyze and optimize the I/O quickly and effectively.

97 MATHEMATICS AND COMPUTING↗

Sierra/SolidMechanics 4.58 User's Guide

Sierra / SolidMechanics (Sierra / SM) is a Lagrangian, three-dimensional code for finite element analysis of solids and structures. It provides capabilities for explicit dynamic, implicit quasistatic and dynamic analyses. The explicit dynamics capabilities allow for the efficient and robust solution of models with extensive contact subjected to large, suddenly applied loads. For implicit problems, Sierra / SM uses a multi-level iterative solver, which enables it to effectively solve problems with large deformations, nonlinear material behavior, and contact. Sierra / SM has a versatile library of continuum and structural elements, an d a large library of material models. The code is written for parallel computing environments enabling scalable solutions of extremely large problems for both implicit and explicit analyses. It is built on the SIERRA Framework, which facilitates coupling with other SIERRA mechanics codes . This document describes the functionality and input syntax for Sierra / SM.

36 MATERIALS SCIENCE↗

Prompt Phrase Ordering Using Large Language Models in HPC: Evaluating Prompt Sensitivity

Large language models (LLMs) have demonstrated effective performance in domain-specific tasks, often requiring a well-designed prompt to guide their responses. However, optimizing the right prompt is challenging due to prompt sensitivity—the phenomenon where small changes in the prompt can lead to significant variations in performance. In this study, we evaluate prompt performance by examining all permutations of independent phrases to investigate prompt sensitivity and robustness. We used two datasets: the GSM8k dataset, which assesses mathematical reasoning, and a custom template prompt for summarizing database metadata. Our goal was to evaluate the performance across all permutations of a sequence of prompt phrases. The study was conducted using the llama3-instruct- 7B model hosted on Ollama, with computations parallelized in a high-performance computing environment. By comparing the average index of phrases in the best and worst-performing prompts, we found that the order of independent phrases within a prompt significantly impacts LLM performance. Additionally, we used Hamming distance to assess changes between phrase orderings, concluding that prompt modifications can dramatically affect scores, often by almost random chance. These findings support existing research on prompt sensitivity. We discuss the challenges of prompt optimization, noting that altering phrases in a successful prompt does not always result in another successful prompt.

97 MATHEMATICS AND COMPUTING↗

pyRMG: A framework for high-throughput, large-cell DFT calculations on supercomputers

Exascale computing delivers the raw power to simulate ever larger and more chemically realistic systems, but realizing this potential requires codes that can efficiently use thousands of processors. Our real-space multigrid (RMG) density functional theory (DFT) code’s grid-decomposition approach scales nearly linearly with the number of graphics processing units (GPUs), even for simulations exceeding thousands of atoms. This scalability makes RMG a compelling tool for high-throughput DFT studies of materials that would otherwise be bottlenecked in other codes (for example, by global fast Fourier transforms in plane-wave DFT). However, the limited workflow infrastructure for RMG has thus far constrained its adoption to a small user community. In this work, we present pyRMG, a Python package designed to streamline the setup and execution of RMG DFT calculations. Built on the pymatgen and ASE (Atomic Simulation Environment) computational materials science Python packages, pyRMG automates input generation and convergence checking, and it integrates with modern job schedulers (e.g., Flux) on leadership-class platforms such as Frontier and Perlmutter. Here, we demonstrate pyRMG for a high-throughput study of strain effects in 2D 2L-Bi 2 Se 3 /2L-NbSe 2 heterostructures, which offers chemical insights into this system and shows that RMG-based workflows can converge with limited user intervention.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Performance evaluation of automated data-driven feature extraction and selection methods for practical and scalable building energy consumption prediction models

Here, this study quantifies the impact of automated feature engineering methods (feature extraction and selection) on the quality and accuracy of machine learning models that predict building energy consumption. The case study compares model performance for three main scenarios: baseline (no feature extraction and selection), feature extraction only, and feature extraction combined with feature selection (filter and/or wrapper methods) for fully trained machine learning models for 200 metered/sub-metered energy measurements across 118 real buildings. For consistency, the same machine learning model architecture (a black box deep learning neural network with probabilistic forecast output) was used for all scenarios. Based on results, all feature engineering methods provided noticeable prediction accuracy improvements (e.g., 29%-68% median prediction improvement) compared to baseline scenarios. However, in this application, feature selection methods provide little practical value due to their limited performance gains and high computational cost. Smarter algorithm development supported by better computational environments will be needed before feature selection methods can reliably and efficiently improve predictive model performance.

97 MATHEMATICS AND COMPUTING↗

NASA ESTO Advanced Information Systems Technology (AIST)

"(Only Talk/No Publication) NASA’s Advanced Information Systems Technology (AIST) Program identifies, develops, and supports adoption of software and information systems, as well as novel computer science technologies expected to be needed by the Earth Science Division in the 5-10-year timeframe. This presentation gives an overview of the AIST Program. AIST’s previous thrusts have been New Observing Strategies (NOS) and Analytic Collaborative Frameworks (ACF). The current vision is to connect these two thrusts and integrate them into the larger concept of Earth System Digital Twins (ESDT). To implement this new vision, the AIST Program is focusing on technologies and innovative concepts with three main objectives: O1. Enable new observation measurements and new observing systems design and operations through intelligent, timely, dynamic, and coordinated distributed sensing; O2. Enable agile science investigations that fully utilize the large amount of diverse observations using advanced analytic tools, visualizations, and computing environments, and that interact seamlessly with relevant observing systems; O3. Enable the development of integrated Earth Science frameworks that mirror the Earth with state-of-the-art models (Earth system models and others), timely and relevant observations, and analytic tools. This thrust will provide technology for enabling near- and long-term science and policy decisions (“science decisions” including planning for the acquisition of new measurements; the development of new models or science analysis; the integration of Earth observations in novel ways; applications to inform choices, support decisions, and guide actions for societal benefit; etc.)."

Mathematical and Computer Sciences (General)↗

Hybrid reduced order modeling for assembly calculations

While the accuracy of assembly calculations has greatly improved due to the increase in computer power enabling more refined description of the phase space and use of more sophisticated numerical algorithms, the computational cost continues to increase which limits the full utilization of their effectiveness for routine engineering analysis. Reduced order modeling is a mathematical vehicle that scales down the dimensionality of large-scale numerical problems to enable their repeated executions on small computing environment, often available to end users. This is done by capturing the most dominant underlying relationships between the model's inputs and outputs. Previous works demonstrated the use of the reduced order modeling for a single physics code, such as a radiation transport calculation. This paper extends those works to coupled code systems as currently employed in assembly calculations. Finally, numerical tests are conducted using realistic SCALE assembly models with resonance self-shielding, neutron transport, and nuclides transmutation/depletion models representing the components of the coupled code system.

97 MATHEMATICS AND COMPUTING↗

DFTTK: Density Functional Theory ToolKit for high-throughput lattice dynamics calculations

In this work, we present a software package in Python for high-throughput first-principles calculations of thermodynamic properties at finite temperatures, which we refer to as DFTTK (Density Functional Theory ToolKit). DFTTK is based on the atomate package and integrates our experiences in the last decades on the development of theoretical methods and computational softwares. It includes task submissions on all major operating systems and task executions on high-performance computing environments. Furthermore, the distribution of the DFTTK package comes with examples of calculations of phonon density of states, heat capacity, entropy, enthalpy, and free energy under the quasi-harmonic phonon scheme for the stoichiometric phases of Al, Ni, Al 3 Ni, AlNi, AlNi 3 , Al 3 Ni 4 , and Al 3 Ni 5 , and the fcc solution phases treated using the special quasirandom structures at the compositions of Al 3 Ni, AlNi, and AlNi 3 .

97 MATHEMATICS AND COMPUTING↗

A Dynamic Waste Isolation Pilot Plant Performance Assessment Tool - 12490

The Waste Isolation Pilot Plant (WIPP) Performance Assessment (PA) methodology comprises a toolbox used to demonstrate regulatory compliance of the repository after facility closure. The PA framework rests upon an extensive suite of computational codes. In some cases, significant alteration of code inputs is a tedious and difficult task. Due to the nature of the application for which they are used, PA codes used in support of WIPP regulatory compliance demonstration must satisfy stringent quality assurance requirements. Consequently, many of the coding practices used during original code development are still implemented today. A more efficient workflow configuration has the potential to alleviate difficulties associated with extensive code input modifications. Here, this potential is assessed via an implementation of a more flexible scientific workflow system for a subset of the codes used in WIPP PA. The scientific workflow approach taken here for a dynamic PA system enables users from disparate backgrounds to dramatically shorten the time between hypothesis and analysis by decreasing the amount of a priori knowledge, from a range of disciplines, needed to execute the code. Having smaller iteration times allows for more ideas to be tested and explored, which leads to safer and more optimized systems. Note that these high-level, dynamic tools are intended only for initial scoping studies on the personal computer of a researcher. Full, regulatory compliance calculations may occur only within a qualified computing environment. However, the WIPP PA tools here may guide future research and indicate regions of the analysis space that are worth further study. This next generation of PA software provides the ability to perform scoping investigations of repository performance quickly and easily, and has an accessible and useful interface to a variety of users, such as fuel cycle systems designers, domain experts such as repository modelers, and policy makers. The purview of this project allows for many opportunities for future work. Foremost among these is the desire to implement the full BRAGFLO suite within the workflow. This will entail porting or wrapping Genmesh, Matset, LHS, and ICSet within Python. Moreover, unifying the two GUIs into a single driver application would be a natural next step. Once the BRAGFLO suite is completed, other portions of WIPP PA could be implemented with corresponding and inter-operable work-flows. Likely first candidates for this are those codes that are similarly computationally intensive, such as the one used to generate complementary cumulative distribution functions used to demonstrate regulatory compliance (code CCDFGF). (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Decaf: Decoupled Dataflows for In Situ High-Performance Workflows

Decaf is a dataflow system for the parallel communication of coupled tasks in an HPC workflow. The dataflow can perform arbitrary data transformations ranging from simply forwarding data to complex data redistribution. Decaf does this by allowing the user to allocate resources and execute custom code in the dataflow. All communication through the dataflow is efficient parallel message passing over MPI. The runtime for calling tasks is entirely message-driven; Decaf executes a task when all messages for the task have been received. Such a messagedriven runtime allows cyclic task dependencies in the workflow graph, for example, to enact computational steering based on the result of downstream tasks. Decaf includes a simple Python API for describing the workflow graph. This allows Decaf to stand alone as a complete workflow system, but Decaf can also be used as the dataflow layer by one or more other workflow systems to form a heterogeneous task-based computing environment. In one experiment, we couple a molecular dynamics code with a visualization tool using the FlowVR and Damaris workflow systems and Decaf for the dataflow. In another experiment, we test the coupling of a cosmology code with Voronoi tessellation and density estimation codes using MPI for the simulation, the DIY programming model for the two analysis codes, and Decaf for the dataflow. Such workflows consisting of heterogeneous software infrastructures exist because components are developed separately with different programming models and runtimes, and this is the first time that such heterogeneous coupling of diverse components was demonstrated in situ on HPC systems.

97 MATHEMATICS AND COMPUTING↗

Hybrid reduced order modeling for assembly calculations

While the accuracy of assembly calculations has considerably improved due to the increase in computer power enabling more refined description of the phase space and use of more sophisticated numerical algorithms, the computational cost continues to increase which limits the full utilization of their effectiveness for routine engineering analysis. Reduced order modeling is a mathematical vehicle that scales down the dimensionality of large-scale numerical problems to enable their repeated executions on small computing environment, often available to end users. This is done by capturing the most dominant underlying relationships between the model's inputs and outputs. Previous works demonstrated the use of the reduced order modeling for a single physics code, such as a radiation transport calculation. This manuscript extends those works to coupled code systems as currently employed in assembly calculations. Numerical tests are conducted using realistic SCALE assembly models with resonance self-shielding, neutron transport, and nuclides transmutation/depletion models representing the components of the coupled code system. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A tool and a methodology to use macros for abstracting variations in code for different computational demands

Scientific software used on high-performance computing platforms is in a phase of transformation because of the combined increase in the heterogeneity and complexity of models and hardware platforms. Having separate implementations for different platforms can easily lead to combinatorial explosions; therefore, the computational science community has been looking for mechanisms to express code through abstractions that can be specialized for different platforms. Most existing approaches use template meta-programming in C++, and are, therefore language specific. Here, we have developed a tool that uses customized expansion of macros to mimic some of C++ behavior in other languages. It enables unification of any code variants that may be necessary to run efficiently on different target architectures and different computational environments through use of macros with multiple alternative definitions and ability to arbitrate on definition selection for expansion. Combined with two other tools, a custom runtime, and a user specified recipe translator, our custom macroprocessor becomes a part of an overall performance portability solution that does not depend on any specific programming language. We also use macros as code-shorthand that lets code snippets become building blocks that allow variations in control flow to explore performance options. We demonstrate use of macros in Flash-X, a multiphysics multicomponent code with many Fortran legacy components derived from an earlier community code FLASH.

Heterogenous computing↗

VIBES: a workflow for annotating and visualizing viral sequences integrated into bacterial genomes

Abstract Bacteriophages are viruses that infect bacteria. Many bacteriophages integrate their genomes into the bacterial chromosome and become prophages. Prophages may substantially burden or benefit host bacteria fitness, acting in some cases as parasites and in others as mutualists. Some prophages have been demonstrated to increase host virulence. The increasing ease of bacterial genome sequencing provides an opportunity to deeply explore prophage prevalence and insertion sites. Here we present VIBES (Viral Integrations in Bacterial genomES), a workflow intended to automate prophage annotation in complete bacterial genome sequences. VIBES provides additional context to prophage annotations by annotating bacterial genes and viral proteins in user-provided bacterial and viral genomes. The VIBES pipeline is implemented as a Nextflow-driven workflow, providing a simple, unified interface for execution on local, cluster and cloud computing environments. For each step of the pipeline, a container including all necessary software dependencies is provided. VIBES produces results in simple tab-separated format and generates intuitive and interactive visualizations for data exploration. Despite VIBES’s primary emphasis on prophage annotation, its generic alignment-based design allows it to be deployed as a general-purpose sequence similarity search manager. We demonstrate the utility of the VIBES prophage annotation workflow by searching for 178 Pf phage genomes across 1072 Pseudomonas spp. genomes.

59 BASIC BIOLOGICAL SCIENCES↗