Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel applications”

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,567 records · Page 87

Simulation-Based Parameter Optimization Framework for Large-Scale Hybrid Smart Grid Communications Systems Design

The design of reliable, dynamic, fault-tolerant hybrid smart grid communication networks is a challenge to achieve for autonomous power grids. Hybrid networks use different communications technologies for different area networks. A simulation-based parameter optimization framework is proposed to tune parameters of hybrid communication technologies to achieve the optimal network performance. It consists of three main components: a parallel executor used to speedup a list of simulations; a sampler running simulations using the parallel executor at each generation; and a hybrid stochastic optimization algorithm for tuning configurable parameters of hybrid designs and applications. The proposed hybrid metaheuristic optimization algorithm combines an evolutionary algorithm with a gradient method to quickly achieve an approximately global optimum solution. Three optimization test functions are employed to train the adjustable parameters of the hybrid algorithm. Results show the proposed parameter optimization framework can help the designer choose the right hybrid architecture with an optimal parameter set for a large-scale broadband PLC-WiMAX hybrid smart grid communication network.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Tutorial: Parallel simulation on supercomputers

This tutorial introduces typical hardware and software characteristics of extant and emerging supercomputing platforms, and presents issues and solutions in executing large-scale parallel discrete-event simulation scenarios on such high performance computing systems. Covered topics include synchronization, model organization, example applications, and observed performance from illustrative large-scale runs.

Perumalla, Kalyan S.↗

OpenSHMEM Application Programming Interface (V.1.0 FINAL)

This document defines the elements of the OpenSHMEM Application Programming Interface. The purpose of the OpenSHMEM API is to provide programmers with a standard interface for writing parallel programs using C, C++ and Fortran with one-sided communication.

99 GENERAL AND MISCELLANEOUS↗

FLC Nomination: Stephen R. Lee

STEM Mentorship Award: Given to an individual who may or may not be a direct employee of a government laboratory or facility in the Mid Continent Region, but has demonstrated exceptional character, mentorship, and creativity in the areas of science and math or by promoting the development of young people in grades K-12 or higher in technical career fields. Contributions must be unique and show measurable benefit to the laboratory, school system/students and must have occurred within the past three calendar years. Stephen R. Lee is the division leader of the Computer, Computational, and Statistical Sciences Division (CCS) at Los Alamos National Laboratory (LANL or the Laboratory). He holds a Bachelor of Science in Physics from New Mexico State University and a Master of Science in Physics from Kansas State University and began his 27-year career at the Laboratory in 1986. As division leader of CCS, Stephen is responsible for the management and oversight of CCS and all of its activities, as well as approximately 200 technical staff engaged in computer and computational, and statistical sciences. His experience and interests include computational algorithm development for largescale parallel computing (peta-scale and beyond), predictive simulations for nuclear weapons, simulation capabilities for non-nuclear weapons applications such as bioscience, homeland defense, nanotechnology, advanced computational platform research and development.

97 MATHEMATICS AND COMPUTING↗

DGaaS: GPU as a Service on Distributed Computing System

In the rapidly evolving landscape of scientific computing, Graphics Processing Units (GPUs) have become indispensable for their unparalleled ability to handle parallel tasks in complex calculations, simulations, and data analysis. Their utility is further magnified in machine learning and AI applications, where they significantly accelerate model training and predictive analytics. Within this context, the Triton Inference Server emerges as a pivotal open-source tool, specializing in AI inferencing and optimizing GPU utilization across various platforms and frameworks. This paper presents an in-depth study on distributed High Throughput Computing (HTC), specifically focusing on the HTCondor framework and its resource provisioning tools, GlideinWMS and HEPCloud. These systems enable large-scale scientific experiments like CMS and DUNE to efficiently access and utilize vast computational resources. The paper explores the core architectural components of GlideinWMS, including jobs, user pools, and worker nodes, and discusses their integration with GPUs and the Triton server. The primary aim of this research is to develop a solution that optimizes GPU utilization by leveraging Glideins and containers. This approach allows computational jobs, particularly those involving AI models, to use GPUs only when essential, thereby facilitating efficient sharing of limited GPU resources. To validate this architecture, the study conducted three key tests involving custom scripts, container-based servers, and Triton server deployments. However, the study faces challenges, notably in locating the Triton server and ensuring secure remote access. To address these issues, future work will focus on developing a proxy mechanism and enhancing security protocols. In conclusion, this study offers a comprehensive roadmap for effective and efficient GPU utilization in distributed High Throughput Computing. It aims to contribute significantly to the scientific community by solving pressing problems and implementing robust solutions in collaboration with the GlideinWMS and HEPCloud teams. The research sets the stage for a more efficient, scalable, and cost-effective paradigm in scientific computing.

97 MATHEMATICS AND COMPUTING↗

Experiences with SYCL on AMD GPUs with Kokkos

With the recent diversification of the hardware landscape in the high-performance computing (HPC) community, performance-portability solutions are becoming more and more important. One of the most popular choices is Kokkos, which recently became a Linux Foundation project. Most of its development is supported by the US Department of Energy and the French Alternative Energies and Atomic Energy Commission. Kokkos is implemented as a C++ library with multiple backends to support CPUs as well as various GPU architectures. These backends include OpenMP, CUDA, HIP, and also SCYL. This approach enables users to leverage the preferred vendor toolchain for the respective platform (e.g. CUDA, ROCm, OneAPI). The SYCL backend is used to target Intel GPUs, in particular to support the Aurora exascale supercomputer. However, SYCL itself also offers a large degree of portability, and in fact Kokkos’ CI for SYCL has been running on NVIDIA hardware due to a lack of access to Intel GPUs. In this report, we describe our experience with using Kokkos SYCL backend on AMD GPUs targeting the Frontier supercomputer at Oak Ridge National Laboratory. The two major SYCL implementations are DPC++ and AdaptiveCpp. While the Kokkos SYCL backend has been implemented using the former, the latter was the first implementation to target AMD GPUs. We will discuss the experience with both of these SYCL implementations in terms of functionality and performance. Using Kokkos to evaluate SYCL toolchains has a number of benefits. Kokkos’ use of SYCL is fairly complex, exercising features such as graphs, relocatable device functions, atomics – including for non-arithmetic types, as well as pinned and page migratable memory allocations. Kokkos also needs to implement capabilities such as Kokkos’ hierarchical parallelism that are not a straight-forward mapping to SYCL capabilities. Furthermore, a large number of libraries and applications that represent diverse use cases are implemented in Kokkos, providing readily available test cases for a toolchain evaluation. Preliminary results show that support for AMD GPUs in DPC++ is much less mature than for NVIDIA GPUs or Intel GPUs. While the situation has improved significantly over the last year, we still encounter many runtime failures, dispatching problems, and code generation issues. With AdaptiveCpp the challenges arise even earlier in the evaluation process. Since Kokkos’ SYCL implementation is largely focused on supporting Intel GPUs, we opted to leverage SYCL extensions which are available in DPC++ but not in AdaptiveCpp. Furthermore, AdaptiveCpp appears to be less conformant with the SYCL2020 standard which Kokkos relies on. In some cases, we are able to work around the lack of feature support, in other cases we have to disable certain Kokkos capabilities to evaluate the toolchain. Our evaluation will leverage Kokkos’ unit tests to establish basic functionality and feature completeness. We then use simple benchmarks for components of a CG implementation as a measure of usability and performance of the SYCL toolchains.

97 MATHEMATICS AND COMPUTING↗

The Linearly Scaling 3D Fragment Method for Large Scale Electronic Structure Calculations

The Linearly Scaling three-dimensional fragment (LS3DF) method is an O(N) ab initio electronic structure method for large-scale nano material simulations. It is a divide-and-conquer approach with a novel patching scheme that effectively cancels out the artificial boundary effects, which exist in all divide-and-conquer schemes. This method has made ab initio simulations of thousand-atom nanosystems feasible in a couple of hours, while retaining essentially the same accuracy as the direct calculation methods. The LS3DF method won the 2008 ACM Gordon Bell Prize for algorithm innovation. Our code has reached 442 Tflop/s running on 147,456 processors on the Cray XT5 (Jaguar) at OLCF, and has been run on 163,840 processors on the Blue Gene/P (Intrepid) at ALCF, and has been applied to a system containing 36,000 atoms. In this paper, we will present the recent parallel performance results of this code, and will apply the method to asymmetric CdSe/CdS core/shell nanorods, which have potential applications in electronic devices and solar cells.

97 MATHEMATICS AND COMPUTING↗

The linearly scaling 3D fragment method for large scale electronic structure calculations

The Linearly Scaling three-dimensional fragment (LS3DF) method is an O(N) ab initio electronic structure method for large-scale nano material simulations. It is a divide-and-conquer approach with a novel patching scheme that effectively cancels out the artificial boundary effects, which exist in all divide-and-conquer schemes. This method has made ab initio simulations of thousand-atom nanosystems feasible in a couple of hours, while retaining essentially the same accuracy as the direct calculation methods. The LS3DF method won the 2008 ACM Gordon Bell Prize for algorithm innovation. Our code has reached 442 Tflop/s running on 147,456 processors on the Cray XT5 (Jaguar) at OLCF, and has been run on 163,840 processors on the Blue Gene/P (Intrepid) at ALCF, and has been applied to a system containing 36,000 atoms. In this paper, we will present the recent parallel performance results of this code, and will apply the method to asymmetric CdSe/CdS core/shell nanorods, which have potential applications in electronic devices and solar cells.

36 MATERIALS SCIENCE↗

Imaging doped silicon test structures using low energy electron microscopy.

This document is the final SAND Report for the LDRD Project 105877 - 'Novel Diagnostic for Advanced Measurements of Semiconductor Devices Exposed to Adverse Environments' - funded through the Nanoscience to Microsystems investment area. Along with the continuous decrease in the feature size of semiconductor device structures comes a growing need for inspection tools with high spatial resolution and high sample throughput. Ideally, such tools should be able to characterize both the surface morphology and local conductivity associated with the structures. The imaging capabilities and wide availability of scanning electron microscopes (SEMs) make them an obvious choice for imaging device structures. Dopant contrast from pn junctions using secondary electrons in the SEM was first reported in 1967 and more recently starting in the mid-1990s. However, the serial acquisition process associated with scanning techniques places limits on the sample throughput. Significantly improved throughput is possible with the use of a parallel imaging scheme such as that found in photoelectron emission microscopy (PEEM) and low energy electron microscopy (LEEM). The application of PEEM and LEEM to device structures relies on contrast mechanisms that distinguish differences in dopant type and concentration. Interestingly, one of the first applications of PEEM was a study of the doping of semiconductors, which showed that the PEEM contrast was very sensitive to the doping level and that dopant concentrations as low as 10{sup 16} cm{sup -3} could be detected. More recent PEEM investigations of Schottky contacts were reported in the late 1990s by Giesen et al., followed by a series of papers in the early 2000s addressing doping contrast in PEEM by Ballarotto and co-workers and Frank and co-workers. In contrast to PEEM, comparatively little has been done to identify contrast mechanisms and assess the capabilities of LEEM for imaging semiconductor device strictures. The one exception is the work of Mankos et al., who evaluated the impact of high-throughput requirements on the LEEM designs and demonstrated new applications of imaging modes with a tilted electron beam. To assess its potential as a semiconductor device imaging tool and to identify contrast mechanisms, we used LEEM to investigate doped Si test structures. In section 2, Imaging Oxide-Covered Doped Si Structures Using LEEM, we show that the LEEM technique is able to provide reasonably high contrast images across lateral pn junctions. The observed contrast is attributed to a work function difference ({Delta}{phi}) between the p- and n-type regions. However, because the doped regions were buried under a thermal oxide ({approx}3.5 nm thick), e-beam charging during imaging prevented quantitative measurements of {Delta}{phi}. As part of this project, we also investigated a series of similar test structures in which the thermal oxide was removed by a chemical etch. With the oxide removed, we obtained intensity-versus-voltage (I-V) curves through the transition from mirror to LEEM mode and determined the relative positions of the vacuum cutoffs for the differently doped regions. Although the details are not discussed in this report, the relative position in voltage of the vacuum cutoffs are a direct measure of the work function difference ({Delta}{phi}) between the p- and n-doped regions.

36 MATERIALS SCIENCE↗

Distributed Reinforcement Learning with ADMM-RL

This paper presents a new algorithm for distributed Reinforcement Learning (RL). RL is an artificial intelligence (AI) control strategy such that controls for highly nonlinear systems over multi-step time horizons may be learned by experience, rather than directly computed on the fly by optimization. Here we introduce ADMM-RL, a combination of the Alternating Direction Method of Multipliers (ADMM) and reinforcement learning that allows for integrating learned controllers as subsystems in generally convergent distributed control applications. ADMM has become the workhorse algorithm for distributed control, combining the advantages of dual decomposition (namely, enabling decoupled, parallel, distributed solution) with the advantages of the method of multipliers (namely, convexification/stability). Our ADMM-RL algorithm replaces one or more of the subproblems in ADMM with several steps of RL. When the nested iterations converge, we are left with a pretrained subsolver that can potentially increase the efficiency of the deployed distributed controller by orders of magnitude. We illustrate ADMM-RL in both distributed wind farm yaw control and distributed grid-aware demand aggregation for water heaters.

ADMM↗

DMA engine for repeating communication patterns

A parallel computer system is constructed as a network of interconnected compute nodes to operate a global message-passing application for performing communications across the network. Each of the compute nodes includes one or more individual processors with memories which run local instances of the global message-passing application operating at each compute node to carry out local processing operations independent of processing operations carried out at other compute nodes. Each compute node also includes a DMA engine constructed to interact with the application via Injection FIFO Metadata describing multiple Injection FIFOs where each Injection FIFO may containing an arbitrary number of message descriptors in order to process messages with a fixed processing overhead irrespective of the number of message descriptors included in the Injection FIFO.

Chen, Dong↗

Hardware Architectures for Data-Intensive Computing Problems: A Case Study for String Matching

DNA analysis is an emerging application of high performance bioinformatic. Modern sequencing machinery are able to provide, in few hours, large input streams of data, which needs to be matched against exponentially growing databases of known fragments. The ability to recognize these patterns effectively and fastly may allow extending the scale and the reach of the investigations performed by biology scientists. Aho-Corasick is an exact, multiple pattern matching algorithm often at the base of this application. High performance systems are a promising platform to accelerate this algorithm, which is computationally intensive but also inherently parallel. Nowadays, high performance systems also include heterogeneous processing elements, such as Graphic Processing Units (GPUs), to further accelerate parallel algorithms. Unfortunately, the Aho-Corasick algorithm exhibits large performance variability, depending on the size of the input streams, on the number of patterns to search and on the number of matches, and poses significant challenges on current high performance software and hardware implementations. An adequate mapping of the algorithm on the target architecture, coping with the limit of the underlining hardware, is required to reach the desired high throughputs. In this paper, we discuss the implementation of the Aho-Corasick algorithm for GPU-accelerated high performance systems. We present an optimized implementation of Aho-Corasick for GPUs and discuss its tradeoffs on the Tesla T10 and he new Tesla T20 (codename Fermi) GPUs. We then integrate the optimized GPU code, respectively, in a MPI-based and in a pthreads-based load balancer to enable execution of the algorithm on clusters and large sharedmemory multiprocessors (SMPs) accelerated with multiple GPUs.

Tumeo, Antonino↗

DESIGN & DEVELOPMENT OF A SECURE SELF-LEVELING WIRELESS RECHARGING PLATFORM FOR AN AERIAL DRONE ON AN UNMANNED SURFACE VESSEL

The Design and Development of an automated recharging station for an aerial drone, onboard a small, unmanned surface vessel, is described. Drones require a landing surface that is level within five degrees of the surrounding terrain for repeated reliable landing and takeoff. System constraints and at-sea application necessitate a compact, lightweight, and secure solution. A passive self-leveling platform and an accompanying automated parallel-pusher drone restraint mechanism have been designed and fabricated to aid in achieving a level landing surface and holding the drone in place while it charges. The self-leveling mechanism has been analyzed and subjected to initial laboratory tests. The testing of the drone restraint mechanism to verify its weight capacity and closing time, and the integration of the platform with a custom conductive contact wireless charging pad are identified as future work. The resulting cohesive unit will be tested for performance optimization and implementation onboard the unmanned surface vehicle.

McKinney, Adriana↗

Magnetic properties of Ni-Fe nanowire arrays: effect of template material and deposition conditions

The objective of this work is to study the magnetic properties of arrays of Ni-Fe nanowires electrodeposited in different template materials such as porous silicon, polycarbonate and alumina. Magnetic properties were studied as a function of template material, applied magnetic field (parallel and perpendicular) during deposition, wire length, as well as magnetic field orientation during measurement. The results show that application of magnetic field during deposition strongly influences the c-axis preferred orientation growth of Ni-Fe nanowires. The samples with magnetic field perpendicular to template plane during deposition exhibits strong perpendicular anisotropy with greatly enhanced coercivity and squareness ratio, particularly in Ni-Fe nanowires deposited in polycarbonate templates. In case of polycarbonate template, as magnetic field during deposition increases, both coercivity and squareness ratio also increase. The wire length dependence was also measured for polycarbonate templates. As wire length increases, coercivity and squarness ratio decrease, but saturation field increases. Such magnetic behavior (dependence on template material, magnetic field, wire length) can be qualitatively explained by preferential growth phenomena, dipolar interactions among nanowires, and perpendicular shape anisotropy in individual nanowires.

36 MATERIALS SCIENCE↗

Experiments with Memory-to-Memory Coupling for End-to-End fusion Simulation Workflows

Scientific applications are striving to accurately simulate multiple interacting physical processes that comprise complex phenomena being modeled. Efficient and scalable parallel implementations of these coupled simulations present challenging interaction and coordination requirements, especially when the coupled physical processes are computationally heterogeneous and progress at different speeds. In this paper, we present the design, implementation and evaluation of a memory-to-memory coupling framework for coupled scientific simulations on high-performance parallel computing platforms. The framework is driven by the coupling requirements of the Center for Plasma Edge Simulation, and it provides simple coupling abstractions as well as efficient asynchronous (RDMA-based) memory-to-memory data transport mechanisms that complement existing parallel programming systems and data sharing frameworks. The framework enables flexible coupling behaviors that are asynchronous in time and space, and it supports dynamic coupling between heterogeneous simulation processes without enforcing any synchronization constraints. We evaluate the performance and scalability of the coupling framework using a specific coupling scenario, on the Jaguar Cray XT5 system at Oak Ridge National Laboratory.

99 GENERAL AND MISCELLANEOUS↗

DAKOTA : a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis. Version 5.0, user's manual.

The DAKOTA (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. DAKOTA contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic finite element methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the DAKOTA toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the DAKOTA software and provides capability overviews and procedures for software execution, as well as a variety of example studies.

97 MATHEMATICS AND COMPUTING↗

Image Gradient Decomposition for Parallel and Memory-Efficient Ptychographic Reconstruction

Ptychography is a popular microscopic imaging modality for many scientific discoveries and sets the record for highest image resolution. Unfortunately, the high image resolution for ptychographic reconstruction requires significant amount of memory and computations, forcing many applications to compromise their image resolution in exchange for a smaller memory footprint and a shorter reconstruction time. In this paper, we propose a novel image gradient decomposition method that significantly reduces the memory footprint for ptychographic reconstruction by tessellating image gradients and diffraction measurements into tiles. In addition, we propose a parallel image gradient decomposition method that enables asynchronous point-to-point communications and parallel pipelining with minimal overhead on a large number of GPUs. Our experiments on a Titanate material dataset (PbTiO3) with 16632 probe locations show that our Gradient Decomposition algorithm reduces memory footprint by 51 times. In addition, it achieves time-to-solution within 2.2 minutes by scaling to 4158 GPUs with a super-linear strong scaling efficiency at 364% compared to runtimes at 6 GPUs. This performance is 2.7 times more memory efficient, 9 times more scalable and 86 times faster than the state-of-the-art algorithm.

Wang, Xiao↗

A parallel-kinetic-perpendicular-moment model for magnetised plasmas

We describe a new model for the study of weakly collisional, magnetised plasmas derived from exploiting the separation of the dynamics parallel and perpendicular to the magnetic field. This unique system of equations retains the particle dynamics parallel to the magnetic field while approximating the perpendicular dynamics through a spectral expansion in the perpendicular degrees of freedom, analogous to moment-based fluid approaches. In so doing, a hybrid approach is obtained that is computationally efficient enough to allow for larger-scale modelling of plasma systems while eliminating a source of difficulty in deriving fluid equations applicable to magnetised plasmas. We connect this system of equations to historical asymptotic models and discuss advantages and disadvantages of this approach, including the extension of this parallel-kinetic-perpendicular moment beyond the typical region of validity of these more traditional asymptotic models. This paper forms the first of a multi-part series on this new model, covering the theory and derivation, alongside demonstration benchmarks of this approach that include shocks and magnetic reconnection.

astrophysical plasmas↗