Performance of parallel FDTD method for shared- and distributed-memory architectures: Application tobioelectromagnetics
Not Available
Ruiz-Cabello N., Miguel (ORCID:0000000190396181)↗
SEARCH · Search NASA
Results for “parallel methods”
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.
Device and Method for Parallel Measurement of Phosphoproteome and Proteome from Single Cells
We present the development of an immobilized metal affinity chromatography (IMAC) chip designed to enable nanoscale phosphopeptide enrichment within microfabricated nanowells. This novel platform leverages surface chemistry to immobilize high-density Nickel-Nitrilotriacetic Acid (Ni-NTA) molecules on nanowells, followed by applying Fe 3+ . The nanowell surface serves as a capture media to enrich phosphopeptides based on IMAC. The system's efficiency was validated using ß-casein as a model protein, demonstrating the chip’s capability to significantly enrich phosphopeptides. Future applications of this technology are anticipated to enable the detection of over 100 phosphopeptides from individual cells and more than 500 phosphopeptides from pools of 100 cells, offering exciting potential for single-cell phosphoproteomics. We will next apply an integrated proteomics workflow to perform multi-omics measurements, including single-cell isolation, protein digestion, and phosphopeptide enrichment, followed by LC-MS analysis of both the global proteome and phosphoproteome. Future research will explore the use of this technology to study phosphorylation dynamics in cancer cells, enhancing our understanding of cellular signaling and disease mechanisms.
59 BASIC BIOLOGICAL SCIENCES↗
Parallel Multiway Methods for Compression of Massive Data and Other Applications.
Abstract not provided.
Kolda, Tamara G.↗
Large Scale Parallel Solution Methods for Electromagnetic Simulations.
Abstract not provided.
Hu, Jonathan J.↗
Using Kokkos to Manage Memory and Parallelism for Method of Moments.
Abstract not provided.
Zinser, Brian Frederick↗
System and method for parallel two-photon lithography using a metalens array
A metalens array is disclosed for controllably modifying a phase of a wavefront of an optical beam. The metalens array may have a substrate having at least first and second metalens unit cells, and forming a single integrated structure with no stitching being required of the first and second metalens unit cells. The first metalens unit cell has a first plurality of nanoscale features and is configured to modify a phase of a first portion of a wavefront of an optical signal incident thereon in accordance with a first predetermined phase pattern to create at least one first focal voxel within an image plane. The second metalens unit cell has a second plurality of nanoscale features configured to modify the phase of a second portion of the wavefront of the optical signal incident thereon, in accordance with a second predetermined phase pattern, to simultaneously create at least one second focal voxel within the image plane. Each metalens unit cell also has an overall diameter of no more than about 200 microns.
Xia, Xiaoxing↗
Parallelized hybrid optimization methods for nonsmooth problems using NOMAD and linesearch
Two parallelized hybrid methods are presented for single-function optimization problems with side constraints. The optimization problems are difficult not only due to possible existence of local minima and nonsmoothness of functions, but also due to the fact that objective function and constraint values for a solution vector can only be obtained by querying a black box whose execution requires considerable computational effort. Examples are optimization problems in Engineering where objective function and constraint values are computed via complex simulation programs, and where local minima exist and smoothness of functions is not assured. The hybrid methods consist of the well-known method NOMAD and two new methods called DENCON and DENPAR that are based on the linesearch scheme CS-DFN. The hybrid methods compute for each query a set of solution vectors that are evaluated in parallel. The hybrid methods have been tested on a set of difficult optimization problems produced by a certain seeding scheme for multiobjective optimization. We compare computational results with solution by NOMAD, DENCON, and DENPAR as stand-alone methods. It turns out that among the stand-alone methods, NOMAD is significantly better than DENCON and DENPAR. However, the hybrid methods are definitely better than NOMAD.
97 MATHEMATICS AND COMPUTING↗
Advanced Computing is at the Forefront of a New “Moonshot” Revolutionizing the North American Power Grid
In the 50+ years since the first humans landed on the moon, computing has grown at breakneck speed. We are faced with another challenge that is just as daunting, and just as important to overcome-modernizing the North American electric power grid-and high-performance computing (HPC) systems with specialized software will be an important element in rising to this challenge. We describe at a high level how software developed in the ExaSGD project addresses this "moonshot" goal by utilizing exascale computing and a novel high performance solver software stack to support the mission of decarbonizing power grid operations in an environment of uncertain weather and climate. To reach the exascale benchmark the team has made a number of first-of-their-kind innovations, including novel method for stochastic optimization, fine grained parallel methods for modeling power systems, and GPU resident sparse numerical linear solvers.
17 WIND ENERGY↗
Hybrid massively parallel fast sweeping method for static Hamilton–Jacobi equations
The fast sweeping method is a popular algorithm for solving a variety of static Hamilton–Jacobi equations. Fast sweeping algorithms for parallel computing have been developed, but are severely limited. In this work, we present a multilevel, hybrid parallel algorithm that combines the desirable traits of two distinct parallel methods. The fine and coarse grained components of the algorithm take advantage of heterogeneous computer architecture common in high performance computing facilities. We present the algorithm and demonstrate its effectiveness on a set of example problems including optimal control, dynamic games, and seismic wave propagation. We give results for convergence, parallel scaling, and show state-of-the-art speedup values for the fast sweeping method.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
1st Computational Physics School for Fusion Research (2019 CPS-FR)
The rising number of applications of machine learning and computational statistics in fusion energy research requires flexibility in adopting a growing variety of tools. The Computational Physics School for Fusion Research (CPS-FR) aims at providing young researchers with critical skill sets to deal with modern fusion energy research challenges. The School aims at covering essentials of: Computational Statistics, Machine Learning, Deep Learning and optimization methods, Parallel Programming and HPC. As the first edition of the CPS-FR just concluded, this report highlights its main results and summarizes its contents.
70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
Scalable Adaptive Multilevel Solvers for Multiphysics Problems
In this project, we carried out many studies on adaptive and parallel multilevel methods for numerical modeling for various applications, including Magnetohydrodynamics (MHD) and complex fluids. We have made significant efforts and advances in adaptive multilevel methods of the multiphysics problems: multigrid methods, adaptive finite element methods, and applications.
97 MATHEMATICS AND COMPUTING↗
Parallel replica dynamics method for bistable stochastic reaction networks: Simulation and sensitivity analysis
Stochastic reaction networks that exhibit bistable behavior are common in systems biology, materials science, and catalysis. Sampling of stationary distributions is crucial for understanding and characterizing the long-time dynamics of bistable stochastic dynamical systems. However, simulations are often hindered by the insufficient sampling of rare transitions between the two metastable regions. In this paper, we apply the parallel replica method for a continuous time Markov chain in order to improve sampling of the stationary distribution in bistable stochastic reaction networks. The proposed method uses parallel computing to accelerate the sampling of rare transitions. Furthermore, it can be combined with the path-space information bounds for parametric sensitivity analysis. With the proposed methodology, we study three bistable biological networks: the Schlögl model, the genetic switch network, and the enzymatic futile cycle network. We demonstrate the algorithmic speedup achieved in these numerical benchmarks. More significant acceleration is expected when multi-core or graphics processing unit computer architectures and programming tools such as CUDA are employed
97 MATHEMATICS AND COMPUTING↗
Multiply accelerated ReaxFF molecular dynamics: coupling parallel replica dynamics with collective variable hyper dynamics
To address the time scales required to study complex chemical reactions, methods performing accelerated molecular dynamics are necessary even with the recent advancement in high-performance computing. A number of different acceleration techniques are available. Here we explore potential synergies between two popular acceleration methods – Parallel Replica Dynamics (PRD) and Collective Variable Hyperdynamics (CVHD), by analysing the speedup obtained for the pyrolysis of n-dodecane. We determine that PRD + CVHD provides additional speedup to CVHD by reaching the required time scales for the reaction at an earlier wall-clock time. Although some speedup is obtained with the additional replicas, we found that the effectiveness of the inclusion of PRD is depreciated for systems where there is a dramatic increase in reaction rates induced by CVHD. Similar observations were made in the simulation of ethylene-carbonate/Li system, which is inherently more reactive than pyrolysis, suggest that the speedup obtained via the combination of the two acceleration methods can be generalised to most practical chemical systems.
42 ENGINEERING↗
DyG-DPCD: A Distributed Parallel Community Detection Algorithm for Large-Scale Dynamic Graphs
Dynamic (Temporal) graphs capture the valuable evolution of real-world systems, from the continuously evolving patterns of social interactions and genetic pathways to the dynamic fluctuations of economic forces. Detecting communities for such evolving networks poses unique challenges. Detecting and analyzing the evolution of communities within dynamic graphs unlocks valuable insights into the underlying structural and temporal patterns of real-world systems. However, the sheer volume of modern graph data and the inherent complexity of the temporal dimension pose significant challenges to scalable community detection algorithms. Addressing this gap, our work explores the limited landscape of scalable distributed-memory parallel methods specifically designed for dynamic network community detection. We propose a novel parallel algorithm, DyG-DPCD (Dynamic Graph Distributed Parallel Community Detection), to detect communities in dynamic networks using the Message Passing Interface (MPI) framework. We present a vertex-centric approach, allowing us to detect communities through local optimization. Furthermore, we enhance our baseline algorithm by incorporating three heuristics, which improve the algorithm’s performance significantly while maintaining the quality of the solutions. We demonstrate the efficiency of our algorithm by experimenting on several real-world large-scale networks with hundreds of millions of edges spanning diverse domains. Notably, DyG-DPCD achieves speedups between 25× and 30× for large networks that we experimented on using NERSC compute nodes. In conclusion, our algorithm outperforms the STINGER parallel re-agglomeration algorithm by 30×.
97 MATHEMATICS AND COMPUTING↗
SU-D-207-04: GPU-Based 4D Cone-Beam CT Reconstruction Using Adaptive Meshing Method
Purpose: Due to the limited number of projections at each phase, the image quality of a four-dimensional cone-beam CT (4D-CBCT) is often degraded, which decreases the accuracy of subsequent motion modeling. One of the promising methods is the simultaneous motion estimation and image reconstruction (SMEIR) approach. The objective of this work is to enhance the computational speed of the SMEIR algorithm using adaptive feature-based tetrahedral meshing and GPU-based parallelization. Methods: The first step is to generate the tetrahedral mesh based on the features of a reference phase 4D-CBCT, so that the deformation can be well captured and accurately diffused from the mesh vertices to voxels of the image volume. After the mesh generation, the updated motion model and other phases of 4D-CBCT can be obtained by matching the 4D-CBCT projection images at each phase with the corresponding forward projections of the deformed reference phase of 4D-CBCT. The entire process of this 4D-CBCT reconstruction method is implemented on GPU, resulting in significantly increasing the computational efficiency due to its tremendous parallel computing ability. Results: A 4D XCAT digital phantom was used to test the proposed mesh-based image reconstruction algorithm. The image Result shows both bone structures and inside of the lung are well-preserved and the tumor position can be well captured. Compared to the previous voxel-based CPU implementation of SMEIR, the proposed method is about 157 times faster for reconstructing a 10 -phase 4D-CBCT with dimension 256×256×150. Conclusion: The GPU-based parallel 4D CBCT reconstruction method uses the feature-based mesh for estimating motion model and demonstrates equivalent image Result with previous voxel-based SMEIR approach, with significantly improved computational speed.
60 APPLIED LIFE SCIENCES↗
Parallel adaptive wavelet collocation method for PDEs
A parallel adaptive wavelet collocation method for solving a large class of Partial Differential Equations is presented. The parallelization is achieved by developing an asynchronous parallel wavelet transform, which allows one to perform parallel wavelet transform and derivative calculations with only one data synchronization at the highest level of resolution. The data are stored using tree-like structure with tree roots starting at a priori defined level of resolution. Both static and dynamic domain partitioning approaches are developed. For the dynamic domain partitioning, trees are considered to be the minimum quanta of data to be migrated between the processes. This allows fully automated and efficient handling of non-simply connected partitioning of a computational domain. Dynamic load balancing is achieved via domain repartitioning during the grid adaptation step and reassigning trees to the appropriate processes to ensure approximately the same number of grid points on each process. The parallel efficiency of the approach is discussed based on parallel adaptive wavelet-based Coherent Vortex Simulations of homogeneous turbulence with linear forcing at effective non-adaptive resolutions up to 2048{sup 3} using as many as 2048 CPU cores.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗