Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallelization”

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 1,693 records · Page 94
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Discovery of a Ferromagnetic Nickel Chalcogenide Nanocluster Ni 3 S 3 H(PEt 3 ) 5

Atomically precise ligated nanoclusters (NC) are promising cluster-based materials with novel molecular architectures and tunable magnetic properties. Herein, the synthesis and characterization of a nickel sulfide NC Ni 3 S 3 H(PEt 3 ) 5 (PEt 3 = triethylphosphine) with distinct magnetic properties are reported. Magnetization measurements reveal its magnetic moment of 1.5 µ B in the solid phase, consistent with the existence of one unpaired electron predicted by density functional theory (DFT) calculations. Additionally, experimental measurements indicate the presence of ferromagnetic ordering within each Ni 3 S 3 H(PEt 3 ) 5 NC and strong coercivity at temperatures below 20 K. Ion mobility-mass spectrometry is employed in conjunction with DFT calculations and collision cross-section simulations to investigate the structure of the isolated Ni 3 S 3 H(PEt 3 ) 5 . Theoretical studies show that [Ni 3 S 3 H(PEt 3 ) 5 ] + has a planar Ni 3 S 3 core where three Ni atoms are arranged in a triangle with three bridging S atoms residing in the same plane. This structure is preserved in both solution and solid phases, which is confirmed by spectroscopic studies of Ni 3 S 3 H(PEt 3 ) 5 . Additionally, DFT calculations indicate that all spins at the Ni sites are aligned parallel, confirming the presence of ferromagnetic coupling. Overall, this study provides key insights into the structure and magnetic properties of Ni 3 S 3 H(PEt 3 ) 5 , which will facilitate the design of new NC-based magnetic materials.

Nickel sulfide nanocluster↗
DOE OSTI2025

Microscale Metal Additive Manufacturing by Solid‐State Impact Bonding of Shaped Thin Films

The deposition of device-grade inorganic materials is one key challenge toward the implementation of additive manufacturing (AM) in microfabrication, and to that end, a broad range of physico-chemical principles has been explored for 3D fabrication with micro- and nanoscale resolution. Yet, for metals, a process that achieves material quality rivalling that of established thin-film deposition methods, and at the same time, has the potential to combine high throughput production with a broad palette of processable materials, is still lacking. Here, the kinetic, solid-state bonding of metal thin films for the additive assembly of high-purity, high-density metals with micrometer-scale precision is introduced. Indirect laser ablation accelerates micrometer-thick gold films to hundreds of meters per second without their heating or ablation. Their subsequent impact on the substrate above a critical velocity forms a permanent, metallic bond in the solid state. Stacked layers are of high density (>99%). By defining thin-film layers with established lithographic methods prior to launch, a variable feature size (2–50 µm), arbitrary shape of bonded layers, and parallel transfer of up to 36 independent film units in a single shot, is demonstrated. Thus, the solid-state kinetic bonding principle as a viable and potentially versatile route for micro-scale AM of metals is established.

3D printing↗
DOE OSTI2025

Understanding the Effects of Inhomogeneities at the Back Interface of CdTe‐Based Solar Cells Using 2D Modeling

One-dimensional modeling cannot capture lateral inhomogeneities in CdTe-based devices. Here, we use 2D modeling to investigate the role of varying energetics at the back interface. We consider improvements in the back interface layer (BIL) through either reducing back surface recombination velocity (BSRV) or decreasing the downward band bending near the back interface. We show that when the BSRV is reduced, but strong downward band bending remains, there is no change in the device performance until the BSRV of 90% of the back interface is improved by the BIL. On the other hand, any coverage with a BIL that improves band bending results in device improvements. We use band bending, back interface recombination current densities, and voltage dependent current flow through the device to understand these improvements. The modeling shows that lateral flow of carriers greatly affects device performance, which is not captured in parallel diode modeling, and demonstrates improved understanding with 2D modeling.

2D modelling↗
DOE OSTI2020

TeraChem: A graphical processing unit-accelerated electronic structure package for large-scale ab initio molecular dynamics

TeraChem was born in 2008 with the goal of providing fast on-the-fly electronic structure calculations to facilitate ab initio molecular dynamics studies of large biochemical systems such as photoswitchable proteins and multichromophoric antenna complexes. Originally developed for videogaming applications, graphics processing units (GPUs) offered a low-cost parallel computer architecture that became more accessible for general-purpose GPU computing with the release of CUDA in 2007. The evaluation of the electron repulsion integrals (ERIs) is a major bottleneck in electronic structure codes and provides an attractive target for acceleration on GPUs. Thus, highly efficient routines for evaluation of and contractions between the ERIs and density matrices were implemented in TeraChem. Here, electronic structure methods were developed and implemented to leverage these integral contraction routines, resulting in the first quantum chemistry package designed from the ground up for GPUs. This GPU acceleration makes TeraChem capable of performing large-scale ground and excited state calculations in the gas and condensed phase. Today, TeraChem's speed forms the basis for a suite of quantum chemistry applications, including optimization and dynamics of proteins, automated and interactive chemical discovery tools, and large-scale nonadiabatic dynamics simulations.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2023

Robust multi‐loop control of a floating wind turbine

Abstract A principal challenge facing the control of floating offshore wind turbines (FOWTs) is the problem of instability, or “negative damping,” when using blade pitch feedback to control generator speed. This closed‐loop instability can be attributed to non‐minimum phase zeros in the transfer function from blade pitch to generator speed. Standard approaches to improving stability and performance include robust tuning of control gains and introducing multiple feedback loops to respond to platform motion. Combining these approaches is nontrivial because multiple control loops complicate the impact of coupling in the system dynamics. The single‐loop approach to analyzing stability robustness neglects inter‐loop coupling, while a simplistic multi‐loop approach is highly sensitive to dimensional scaling and overestimates the robustness of the single‐loop controller. This work proposes a sensitivity representation that separates some of the natural FOWT dynamic coupling into a parallel feedback loop in the sensitivity function loop to address both of these concerns. The modified robustness measure is used with a simplified linear FOWT model to optimize scheduled multi‐loop control parameters in an automated tuning procedure. This controller is implemented for the 10‐MW Ultraflexible Smart FLoating Offshore Wind Turbine (USFLOWT) and compared against conventional single‐ and multi‐loop controllers tuned using frequency‐domain analysis and high‐fidelity OpenFAST simulations. The multi‐loop robust controller shows the highest overall performance in generator speed regulation and tower load reduction, though consideration of power quality, actuator usage, and other structural loading leads to additional trade‐offs.

Stockhouse, David↗
DOE OSTI2025

AMR-Wind: A Performance-Portable, High-Fidelity Flow Solver for Wind Farm Simulations

We present AMR-Wind, a verified and validated high-fidelity computational-fluid-dynamics code for wind farm flows. AMR-Wind is a block-structured, adaptive-mesh, incompressible-flow solver that enables predictive simulations of the atmospheric boundary layer and wind plants. It is a highly scalable code designed for parallel high-performance computing with a specific focus on performance portability for current and future computing architectures, including graphical processing units (GPUs). In this paper, we detail the governing equations, the numerical methods, and the turbine models. Establishing a foundation for the correctness of the code, we present the results of formal verification and validation. The verification studies, which include a novel actuator line test case, indicate that AMR-Wind is spatially and temporally second-order accurate. The validation studies demonstrate that the key physics capabilities implemented in the code, including actuator disk models, actuator line models, turbulence models, and large eddy simulation (LES) models for atmospheric boundary layers, perform well in comparison to reference data from established computational tools and theory. We conclude with a demonstration simulation of a 12-turbine wind farm operating in a turbulent atmospheric boundary layer, detailing computational performance and realistic wake interactions.

17 WIND ENERGY↗
DOE OSTI2023

Synthesis, crystal and electronic structure of the Zintl phase Ba 16 Sb 11 . A case study uncovering greater structural complexity via monoclinic distortion of the tetragonal Ca 16 Sb 11 structure type

The binary Zintl phase Ba 16 Sb 11 has been synthesized and structurally characterized. Detailed studies via single-crystal X-ray diffraction methods indicate that although Ba 16 Sb 11 appears to crystallize in the tetragonal Ca 16 Sb 11 structure type (space group $P\bar{4}2_1$m with a=13.5647(9) Å, c=12.4124(12)Å, Z=2, R 1 = 3.14%; wR 2 = 4.77%), there exists an extensive structural disorder. Some Ba 16 Sb 11 crystals were found to be monoclinic and the structure was solved and refined in space group P2 1 (a=18.3929(12) Å, b=13.5233(8) Å, c=18.3978(12) Å, β=94.6600(10)°; Z=4, R 1 =5.84 %; wR 2 =9.58 %). The latter corresponds to a 2-fold superstructure of the tetragonal one, which provides a disorder-free structural model. In both descriptions, the disordered tetragonal and the ordered monoclinic superstructure, the basic building units that make up the structure of this Ba-rich compound are pairs of face-shared square antiprisms of Ba atoms, which are centered by Sb atoms. The dimerized antiprisms are linked into parallel chains via square prisms of Ba atoms, which are also centered by Sb atoms. The Zintl concept can be applied in a straightforward manner and as result, the structure of Ba 32 Sb 22 (=2×Ba 16 Sb 11 ) can be rationalized as (Ba 2+ ) 32 (Sb 3– ) 20 [Sb 2 ] 4– . Notably, the partitioning of the valence electrons is done taking into an account the homoatomic Sb–Sb contacts (d=3.01 Å), which can be clearly distinguished in the lower symmetry space group. Electronic structure calculations of Ba 16 Sb 11 are in good accordance with the Zintl rationalization and predict a semiconductor with a band gap of 0.77 eV.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Multifrontal Non-negative Matrix Factorization

Non-negative matrix factorization (Nmf) is an important tool in high-performance large scale data analytics with applications ranging from community detection, recommender system, feature detection and linear and non-linear unmixing. While traditional Nmf works well when the data set is relatively dense, however, it may not extract sufficient structure when the data is extremely sparse. Specifically, traditional Nmf fails to exploit the structured sparsity of the large and sparse data sets resulting in dense factors. We propose a new algorithm for performing Nmf on sparse data that we call multifrontal Nmf (Mf-Nmf) since it borrows several ideas from the multifrontal method for unconstrained factorization (e.g. LU and QR). We also present an efficient shared memory parallel implementation of Mf-Nmf and discuss its performance and scalability. We conduct several experiments on synthetic and realworld datasets and demonstrate the usefulness of the algorithm by comparing it against standard baselines. We obtain a speedup of 1.2x to 19.5x on 24 cores with an average speed up of 10.3x across all the real world datasets.

Sao, Piyush↗
DOE OSTI2021

Prospects for Surrogate Neutron Capture Measurements with Radioactive Ion Beams and GODDESS

Neutron capture reactions are responsible for the synthesis of almost all of the elements heavier than iron through the slow s-process, that proceeds close to the line of stability, and the rapid r-process, with very neutron-rich waiting points. Uncertainties in (n,γ) rates in neutron rich nuclei, especially near closed neu- tron shells, can have significant impact [1] on the predictions of final abundances for different astrophysical scenarios for the r process. Understanding (n,γ) rates on neutron-rich fission fragments is also important for nuclear forensics and stockpile stewardship science. Ratkiewicz et al. [2 and references therein] has recently demonstrated that the (d,pγ) reaction is a valid surrogate for (n,γ), where the formation of the compound nucleus from the breakup of the deuteron has been calculated in a reaction model and the subsequent measured gamma-decay probabilities are reproduced with standard level density and strength functions in a Bayesian approach. In parallel to the surrogate validation efforts, we have demonstrated that the (d,pγ) reaction can be measured in inverse kinematics with Gammasphere ORRUBA: Dual Detectors for Experimental Structure Studies (GODDESS) [3] where the Gammasphere array of Compton-suppressed HPGe detectors is coupled to the Oak Ridge Rutgers University Barrel Array of position-sensitive silicon strip detectors. During the commissioning campaign we measured the (d,pγ) reaction with 134 Xe and 95 Mo beams, the latter to demonstrate the surrogate method in inverse kinematics. The present talk will present preliminary results from this campaign including γ-decay probabilities and prospects for surrogate (n,γ) measurements with 143 Ba fission-fragment beams.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Scalable Data-Intensive Geocomputation: A Design for Real-Time Continental Flood Inundation Mapping

The convergence of data-intensive and extreme-scale computing enables an integrated software and data ecosystem for scientific discovery. Developments in this realm will fuel transformative research in data-driven interdisciplinary domains. Geocomputation provides computing paradigms in Geographic Information Systems (GIS) for interactive computing of geographic data, processes, models, and maps. Because GIS is data-driven, the computational scalability of a geocomputation workflow is directly related to the scale of the GIS data layers, their resolution and extent, as well as the velocity of the geo-located data streams to be processed. Unique in high user interactivity and low end-to-end latency requirements, geocomputation applications will dramatically benefit from the convergence of high-end data analytics (HDA) and high-performance computing (HPC). The application level challenge, however, is to identify and eliminate computational bottlenecks that arise along a geocomputation workflow. Indeed, poor scalability at any of the workflow components is detrimental to the entire end-to-end pipeline. Here, we study a large geocomputation use case in flood inundation mapping that handles multiple national-scale geospatial datasets and targets low end-to-end latency. We discuss benefits and challenges for harnessing both HDA and HPC for data-intensive geospatial data processing and intensive numerical modeling of geographic processes. We propose an HDA+HPC geocomputation architecture design that couples HDA (e.g., Spark)-based spatial data handling and HPC-based parallel data modeling. Key techniques for coupling HDA and HPC to bridge the two different software stacks are reviewed and discussed.

Liu, Yan↗
DOE OSTI2021

Phoenix: A Scalable Streaming Hypergraph Analysis Framework

We present Phoenix, a scalable hypergraph analytics framework for data analytics and knowledge discovery that was implemented on the leadership class computing platforms at Oak Ridge National Laboratory (ORNL). Our software framework comprises a distributed implementation of a streaming server architecture which acts as a gateway for various hypergraph generators/external sources to connect. Phoenix has the capability to utilize diverse hypergraph generators, including HyGen, a very large-scale hypergraph generator developed by ORNL. Phoenix incorporates specific algorithms for efficient data representation by exploiting hidden structures of the hypergraphs. Our experimental results demonstrate Phoenix’s scalable and stable performance on massively parallel computing platforms. Phoenix’s superior performance is due to the merging of high-performance computing with data analytic.

Kurte, Kuldeep↗
DOE OSTI2022

Lessons Learned on the Interface Between Quantum and Conventional Networking

The future Quantum Internet is expected to be based on a hybrid architecture with core quantum transport capabilities complemented by conventional networking. Practical and foundational considerations indicate the need for conventional control and data planes that (i) utilize extensive existing telecommunications fiber infrastructure, and (ii) provide parallel conventional data channels needed for quantum networking protocols. We propose a quantum-conventional network (QCN) harness to implement a new architecture to meet these requirements. The QCN control plane carries the control and management traffic, whereas its data plane handles the conventional and quantum data communications. We established a local area QCN connecting three quantum laboratories over dedicated fiber and conventional network connections. We describe considerations and tradeoffs for layering QCN functionalities, informed by our recent quantum entanglement distribution experiments conducted over this network.

Alshowkan, Muneer↗
DOE OSTI2022

Building an Integrated Ecosystem of Computational and Observational Facilities to Accelerate Scientific Discovery

Future scientific discoveries will rely on flexible ecosystems that incorporate modern scientific instruments, high performance computing resources, parallel distributed data storage, and performant networks across multiple, independent facilities. In addition to connecting physical resources, such an ecosystem presents many challenges in logistics and accessibility, especially in orchestrating computations and experiments that span across leadership computing systems and experimental instruments. Past efforts have typically been application-specific or limited to interfaces for computing resources. This paper proposes a general framework for integrating computation resources and instrument operations, addressing challenges in code development/execution, data staging and collection, software stack, control mechanisms, resource authorization and governance, and hardware integration. We also describe a demonstration use case wherein a Bayesian optimization algorithm running on an edge computing resource guides a scanning probe microscope to autonomously and intelligently characterize a material sample. This science edge ecosystem framework will provide a blueprint for federating multi-institutional, disparate resources and orchestrating scientific workflows across them to enable next-generation discoveries.

Somnath, Suhas↗
DOE OSTI2022

OpenMP Target Task: Tasking and Target Offloading on Heterogeneous Systems

This work evaluated the use of OpenMP tasking with target GPU offloading as a potential solution for programming productivity and performance on heterogeneous systems. Also, it is proposed a new OpenMP specification to make the implementation of heterogeneous codes simpler by using OpenMP target task, which integrates both OpenMP tasking and target GPU offloading in a single OpenMP pragma. As a test case, the authors used one of the most popular and widely used Basic Linear Algebra Subprogram Level-3 routines: triangular solver (TRSM). To benefit from the heterogeneity of the current high-performance computing systems, the authors propose a different parallelization of the algorithm by using a nonuniform decomposition of the problem. This work used target GPU offloading inside OpenMP tasks to address the heterogeneity found in the hardware. This new approach can outperform the state-of-the-art algorithms, which use a uniform decomposition of the data, on both the CPU-only and hybrid CPU-GPU systems, reaching speedups of up to one order of magnitude. The performance that this approach achieves is faster than the IBM ESSL math library on CPU and competitive relative to a highly optimized heterogeneous CUDA version. One node of Oak Ridge National Laboratory’s supercomputer, Summit, was used for performance analysis.

Valero Lara, Pedro↗
DOE OSTI2022

MAPredict: Static Analysis Driven Memory Access Prediction Framework for Modern CPUs

Application memory access patterns are crucial in deciding how much traffic is served by the cache and forwarded to the dynamic random-access memory (DRAM). However, predicting such memory traffic is difficult because of the interplay of prefetchers, compilers, parallel execution, and innovations in manufacturer-specific micro-architectures. This research introduced MAPredict, a static analysis-driven framework that addresses these challenges to predict last-level cache (LLC)-DRAM traffic. By exploring and analyzing the behavior of modern Intel processors, MAPredict formulates cache-aware analytical models. MAPredict invokes these models to predict LLC-DRAM traffic by combining the application model, machine model, and user-provided hints to capture dynamic information. MAPredict successfully predicts LLC-DRAM traffic for different regular access patterns and provides the means to combine static and empirical observations for irregular access patterns. Evaluating 130 workloads from six applications on recent Intel micro-architectures, MAPredict yielded an average accuracy of 99% for streaming, 91% for strided, and 92% for stencil patterns. By coupling static and empirical methods, up to 97% average accuracy was obtained for random access patterns on different micro-architectures.

Monil, M. A. H.↗
DOE OSTI2023

Adrastea: An Efficient FPGA Design Environment for Heterogeneous Scientific Computing and Machine Learning

We present Adrastea, an efficient FPGA design environment for developing scientific machine learning applications. FPGA development is challenging, from deployment, proper toolchain setup, programming methods, interfacing FPGA kernels, and more importantly, the need to explore design space choices to get the best performance and area usage from the FPGA kernel design. Adrastea provides an automated and scalable design flow to parameterize, implement, and optimize complex FPGA kernels and associated interfaces. We show how virtualization of the development environment via virtual machines is leveraged to simplify the setup of the FPGA toolchain while deploying the FPGA boards and while scaling up the automated design space exploration to leverage multiple machines concurrently. Adrastea provides an automated build and test environment of FPGA kernels. By exposing design space hyper-parameters, Adrastea can automatically search the design space in parallel to optimize the FPGA design for a given metric, usually performance or area. Adrastea simplifies the task of interfacing with the FPGA kernels with a simplified interface API. To demonstrate the capabilities of Adrastea, we implement a complex random forest machine learning kernel with 10,000 input features while achieving extremely low computing latency without loss of prediction accuracy, which is required by a scientific edge application at SNS. We also demonstrate Adrastea using an FFT kernel and show that for both applications Adrastea is able to systematically and efficiently evaluate different design options, which reduced the time and effort required to develop the kernel from months of manual work to days of automatic builds.

Young, Aaron↗
DOE OSTI2023

Towards a Standard Process Management Infrastructure for Workflows Using Python

Orchestrating the execution of ensembles of processes lies at the core of scientific workflow engines on large scale parallel platforms. This is usually handled using platform-specific command line tools, with limited process management control and potential strain on system resources. The PMIx standard provides a uniform interface to system resources. The low level C implementation of PMIx has hampered its use in workflow engines, leading to the development of Python binding that has yet to gain traction. In this paper, we present our work to harden the PMIx Python client, demonstrating its usability using a prototype Python driver to orchestrate the execution of an ensemble of processes. We present experimental results using the prototype on the Summit supercomputer at Oak Ridge National Laboratory. This work lays the foundation for wider adoption of PMIx for workflow engines, and encourages wider support of more PMIx functionality in vendor provided system software stacks.

Elwasif, Wael↗
DOE OSTI2023

Developing Ultrahigh-Resolution E3SM Land Model for GPU Systems

Designing and refactoring complex scientific code, such as the E3SM land model (ELM), for new computing architectures is challenging. This paper presents design strategies and technical approaches to develop a data-oriented, GPU-ready ELM model using compiler directives (OpenACC/OpenMP). We first analyze the datatypes and processes in the original ELM code. Then we present design considerations for ultrahigh-resolution ELM (uELM) development for massive GPU systems. These techniques include the global data-oriented simulation workflow, domain partition, code porting and data copy, memory reduction, parallel loop restructure and flattening, and race condition detection. We implemented the first version of uELM using OpenACC targeting the NVidia GPUs in the Summit supercomputer at Oak Ridge National Laboratory. During the implementation, we developed a software tool (named SPEL) to facilitate code generation, verification, and performance tuning using these techniques. The first uELM implementation for Nvidia GPUs on Summit delivered promising results: 1) over 98% of the ELM code was automatically generated and tuned by scripts. Most ELM modules had better computational performances than the original ELM code for CPUs. The GPU-ready uELM is more scalable than the CPU code on fully-loaded Summit nodes. Example profiling results from several modules are also presented to illustrate the performance improvements and race condition detection. The lessons learned and toolkit developed in the study are also suitable for further uELM deployment using OpenMP on the first US exascale computer, Frontier, equipped with AMD CPUs and GPUs.

Schwartz, Peter↗