Design evolution and properties of superconducting parallel-bar rf-dipole deflecting and crabbing cavities
Not Available
De Silva, S. U.↗
SEARCH · Engineering Papers
Results for “Parallelism”
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.
Parallel State Estimation Assessment with Practical Data
This paper presents a full-cycle parallel state estimation (PSE) implementation using a preconditioned conjugate gradient algorithm. The developed code is able to solve large-size power system state estimation within 5 seconds using real-world data, comparable to the Supervisory Control And Data Acquisition (SCADA) rate. This achievement allows the operators to know the system status much faster to help improve grid reliability. Case study results of the Bonneville Power Administration (BPA) system with real measurements are presented. The benefits of fast state estimation are also discussed.
State Estimation, Preconditioned Conjugate Gradien↗
Nonparallel transcriptional divergence during parallel adaptation
Abstract How underlying mechanisms bias evolution toward predictable outcomes remains an area of active debate. In this study, we leveraged phenotypic plasticity and parallel adaptation across independent lineages of Trinidadian guppies ( Poecilia reticulata ) to assess the predictability of gene expression evolution during parallel adaptation. Trinidadian guppies have repeatedly and independently adapted to high‐ and low‐predation environments in the wild. We combined this natural experiment with a laboratory breeding design to attribute transcriptional variation to the genetic influences of population of origin and developmental plasticity in response to rearing with or without predators. We observed substantial gene expression plasticity, as well as the evolution of expression plasticity itself, across populations. Genes exhibiting expression plasticity within populations were more likely to also differ in expression between populations, with the direction of population differences more likely to be opposite those of plasticity. While we found more overlap than expected by chance in genes differentially expressed between high‐ and low‐predation populations from distinct evolutionary lineages, the majority of differentially expressed genes were not shared between lineages. Our data suggest alternative transcriptional configurations associated with shared phenotypes, highlighting a role for transcriptional flexibility in the parallel phenotypic evolution of a species known for rapid adaptation.
Fischer, Eva K.↗
Parallel Architectures and Parallel Algorithms for Integrated Vision Systems
Computer vision is regarded as one of the most complex and computationally intensive problems. An integrated vision system (IVS) is a system that uses vision algorithms from all levels of processing to perform for a high level application (e.g., object recognition). An IVS normally involves algorithms from low level, intermediate level, and high level vision. Designing parallel architectures for vision systems is of tremendous interest to researchers. Several issues are addressed in parallel architectures and parallel algorithms for integrated vision systems.
Choudhary, Alok Nidhi↗
Low Mach number parallel and quasi-parallel shocks
The properties of low-Mach-number parallel and quasi-parallel shocks are studied using the results of one-dimensional hybrid simulations. It is shown that both the structure and ion dissipation at the shocks differ considerably. In the parallel limit, the shock remains coupled to the piston and consists of large-amplitude magnetosonic-whistler waves in the upstream, through the shock and into the downstream region, where the waves eventually damp out. These waves are generated by an ion beam instability due to the interaction between the incident and piston-reflected ions. The excited waves decelerate the plasma sufficiently that it becomes stable far into the downstream. The increase in ion temperature along the shock normal in the downstream region is due to superposition of incident and piston-rflected ions. These two populations of ions remain distinct through the downstream region. While they are both gyrophase-bunched, their counterstreaming nature results in a 180-deg phase shift in their perpendicular velocities.
Omidi, N.↗
Bit-parallel arithmetic in a massively-parallel associative processor
A simple but powerful new architecture based on a classical associative processor model is presented. Algorithms for performing the four basic arithmetic operations both for integer and floating point operands are described. For m-bit operands, the proposed architecture makes it possible to execute complex operations in O(m) cycles as opposed to O(m exp 2) for bit-serial machines. A word-parallel, bit-parallel, massively-parallel computing system can be constructed using this architecture with VLSI technology. The operation of this system is demonstrated for the fast Fourier transform and matrix multiplication.
Scherson, Isaac D.↗
MLP: A Parallel Programming Alternative to MPI for New Shared Memory Parallel Systems
Recent developments at the NASA AMES Research Center's NAS Division have demonstrated that the new generation of NUMA based Symmetric Multi-Processing systems (SMPs), such as the Silicon Graphics Origin 2000, can successfully execute legacy vector oriented CFD production codes at sustained rates far exceeding processing rates possible on dedicated 16 CPU Cray C90 systems. This high level of performance is achieved via shared memory based Multi-Level Parallelism (MLP). This programming approach, developed at NAS and outlined below, is distinct from the message passing paradigm of MPI. It offers parallelism at both the fine and coarse grained level, with communication latencies that are approximately 50-100 times lower than typical MPI implementations on the same platform. Such latency reductions offer the promise of performance scaling to very large CPU counts. The method draws on, but is also distinct from, the newly defined OpenMP specification, which uses compiler directives to support a limited subset of multi-level parallel operations. The NAS MLP method is general, and applicable to a large class of NASA CFD codes.
Taft, James R.↗
Processing data communications events by awakening threads in parallel active messaging interface of a parallel computer
Processing data communications events in a parallel active messaging interface (`PAMI`) of a parallel computer that includes compute nodes that execute a parallel application, with the PAMI including data communications endpoints, and the endpoints are coupled for data communications through the PAMI and through other data communications resources, including determining by an advance function that there are no actionable data communications events pending for its context, placing by the advance function its thread of execution into a wait state, waiting for a subsequent data communications event for the context; responsive to occurrence of a subsequent data communications event for the context, awakening by the thread from the wait state; and processing by the advance function the subsequent data communications event now pending for the context.
97 MATHEMATICS AND COMPUTING↗
Adapting the serial Alpgen parton-interaction generator to simulate LHC collisions on millions of parallel threads
As the LHC moves to higher energies and luminosity, the demand for computing resources increases accordingly and will soon outpace the growth of the World- wide LHC Computing Grid. To meet this greater demand, event generation Monte Carlo was targeted for adaptation to run on Mira, the supercomputer at the Argonne Leadership Computing Facility. Alpgen is a Monte Carlo event generation application that is used by LHC experiments in the simulation of collisions that take place in the Large Hadron Collider. This paper details the process by which Alpgen was adapted from a single-processor serial-application to a large-scale parallel-application and the performance that was achieved.
HEP↗
Parallelized Screening of Characterized and DFT-Modeled Bimetallic Colloidal Cocatalysts for Photocatalytic Hydrogen Evolution
Using a newly designed and developed parallelized photoreactor and colorimetric detection method, a large sampling of bimetallic co-catalysts (Pd/Sn, Pd/Mo, Pd/Ru, Pd/Pb, Pd/Ni, Ni/Sn, Mo/Sn and Pt/Sn) for photocatalytic water reduction have been tested in this work. Of these co-catalysts, the combination of palladium and tin showed the highest synergistic behavior and peak hydrogen gas production at a low relative fraction of palladium. The resulting Pd/Sn bimetallic co-catalysts were characterized using high-angle annular dark-field (HAADF) and scanning transmission electron microscopy energy dispersive X-ray spectroscopy (STEM-EDS), and specifically, investigation of the palladium/tin mixture indicated that palladium and tin elements reside within the same particle. The experimental catalytic activity for the palladium/tin mixture was compared to density functional theory-derived energy values associated with the adsorption of hydrogen onto a surface. This comparison demonstrated that the typical peak found in electrochemical Sabatier volcano plots at ΔG H* = ~0 eV was replicated in the experimental photocatalytic system with a peak activity observed at ΔG H* = -0.036 eV. Computational confirmation of the results expressed here demonstrates the efficacy of colorimetric detection of hydrogen in parallel and presents a model for increasingly rapid catalyst screening.
08 HYDROGEN↗
Parallel magnetic field suppresses dissipation in superconducting nanostrips
The motion of Abrikosov vortices in type-II superconductors results in a finite resistance in the presence of an applied electric current. Elimination or reduction of the resistance via immobilization of vortices is the "holy grail" of superconductivity research. Common wisdom dictates that an increase in the magnetic field escalates the loss of energy since the number of vortices increases. Here we show that this is no longer true if the magnetic field and the current are applied parallel to each other. Our experimental studies on the resistive behavior of a superconducting Mo0.79Ge0.21 nanostrip reveal the emergence of a dissipative state with increasing magnetic field, followed by a pronounced resistance drop, signifying a reentrance to the superconducting state. Large-scale simulations of the 3D time-dependent Ginzburg-Landau model indicate that the intermediate resistive state is due to an unwinding of twisted vortices. When the magnetic field increases, this instability is suppressed due to a better accommodation of the vortex lattice to the pinning configuration. Our findings show that magnetic field and geometrical confinement can suppress the dissipation induced by vortex motion and thus radically improve the performance of superconducting materials.
75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication
Sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high-performance graph algorithms as well as for some linear solvers, such as algebraic multigrid. The scaling of existing parallel implementations of SpGEMM is heavily bound by communication. Even though 3D (or 2.5D) algorithms have been proposed and theoretically analyzed in the flat MPI model on Erdös-Rényi matrices, those algorithms had not been implemented in practice and their complexities had not been analyzed for the general case. In this work, we present the first implementation of the 3D SpGEMM formulation that exploits multiple (intranode and internode) levels of parallelism, achieving significant speedups over the state-of-the-art publicly available codes at all levels of concurrencies. We extensively evaluate our implementation and identify bottlenecks that should be subject to further research.
2.5D algorithms↗
A Fast Algorithm for Parallel Computation of Multibody Dynamics on MIMD Parallel Architectures
In this paper the implementation of a parallel O (Log N) algorithm for computation of rigid multibody dynamics on a Hypercube MIMD parallel architecture is presented.
parallel↗
Parallel beamlet dose calculation via beamlet contexts in a distributed multi‐GPU framework
Purpose Dose calculation is one of the most computationally intensive, yet essential tasks in the treatment planning process. With the recent interest in automatic beam orientation and arc trajectory optimization techniques, there is a great need for more efficient model‐based dose calculation algorithms that can accommodate hundreds to thousands of beam candidates at once. Foundational work has shown the translation of dose calculation algorithms to graphical processing units ( GPU s), lending to remarkable gains in processing efficiency. But these methods provide parallelization of dose for only a single beamlet, serializing the calculation of multiple beamlets and under‐utilizing the potential of modern GPU s. In this paper, the authors propose a framework enabling parallel computation of many beamlet doses using a novel beamlet context transformation and further embed this approach in a scalable network of multi‐ GPU computational nodes. Methods The proposed context‐based transformation separates beamlet‐local density and TERMA into distinct beamlet contexts that independently provide sufficient data for beamlet dose calculation. Beamlet contexts are arranged in a composite context array with dosimetric isolation, and the context array is subjected to a GPU collapsed‐cone convolution superposition procedure, producing the set of beamlet‐specific dose distributions in a single pass. Dose from each context is converted to a sparse representation for efficient storage and retrieval during treatment plan optimization. The context radius is a new parameter permitting flexibility between the speed and fidelity of the dose calculation process. A distributed manager‐worker architecture is constructed around the context‐based GPU dose calculation approach supporting an arbitrary number of worker nodes and resident GPU s. Phantom experiments were executed to verify the accuracy of the context‐based approach compared to Monte Carlo and a reference CPU ‐ CCCS implementation for single beamlets and broad beams composed by addition of beamlets. Dose for representative 4 π beam sets was calculated in lung and prostate cases to compare its efficiency with that of an existing beamlet‐sequential GPU ‐ CCCS implementation. Code profiling was also performed to evaluate the scalability of the framework across many networked GPU s. Results The dosimetric accuracy of the context‐based method displays <1.35% and 2.35% average error from the existing serialized CPU ‐ CCCS algorithm and Monte Carlo simulation for beamlet‐specific PDD s in water and slab phantoms, respectively. The context‐based method demonstrates substantial speedup of up to two orders of magnitude over the beamlet‐sequential GPU ‐ CCCS method in the tested configurations. The context‐based framework demonstrates near linear scaling in the number of distributed compute nodes and GPU s employed, indicating that it is flexible enough to meet the performance requirements of most users by simply increasing the hardware utilization. Conclusions The context‐based approach demonstrates a new expectation of performance for beamlet‐based dose calculation methods. This approach has been successful in accelerating the dose calculation process for very large‐scale treatment planning problems ‐ such as automatic 4 π IMRT beam orientation and VMAT arc trajectory selection, with hundreds of thousands of beamlets ‐ in clinically feasible timeframes. The flexibility of this framework makes it as a strong candidate for use in a variety of other very large‐scale treatment planning tasks and clinical workflows.
Neph, Ryan↗
GPU-accelerated Tersoff potentials for massively parallel Molecular Dynamics simulations
The Tersoff potential is one of the empirical many-body potentials that has been widely used in simulation studies at atomic scales. Unlike pair-wise potentials, the Tersoff potential involves three-body terms, which require much more arithmetic operations and data dependency. In this contribution, we have implemented the GPU-accelerated version of several variants of the Tersoff potential for LAMMPS, an open-source massively parallel Molecular Dynamics code. Compared to the existing MPI implementation in LAMMPS, the GPU implementation exhibits a better scalability and offers a speedup of 2.2X when run on 1000 compute nodes on the Titan supercomputer. On a single node, the speedup ranges from 2.0 to 8.0 times, depending on the number of atoms per GPU and hardware configurations. The most notable features of our GPU-accelerated version include its design for MPI/accelerator heterogeneous parallelism, its compatibility with other functionalities in LAMMPS, its ability to give deterministic results and to support both NVIDIA CUDA- and OpenCL-enabled accelerators. Our implementation is now part of the GPU package in LAMMPS and accessible for public use.
Computer Science↗
A generalized parallel replica dynamics
Metastability is a common obstacle to performing long molecular dynamics simulations. Many numerical methods have been proposed to overcome it. One method is parallel replica dynamics, which relies on the rapid convergence of the underlying stochastic process to a quasi-stationary distribution. Two requirements for applying parallel replica dynamics are knowledge of the time scale on which the process converges to the quasi-stationary distribution and a mechanism for generating samples from this distribution. By combining a Fleming–Viot particle system with convergence diagnostics to simultaneously identify when the process converges while also generating samples, we can address both points. This variation on the algorithm is illustrated with various numerical examples, including those with entropic barriers and the 2D Lennard-Jones cluster of seven atoms.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
A parallel domain decomposition-based implicit method for the Cahn–Hilliard–Cook phase-field equation in 3D
We present a numerical algorithm for simulating the spinodal decomposition described by the three dimensional Cahn–Hilliard–Cook (CHC) equation, which is a fourth-order stochastic partial differential equation with a noise term. The equation is discretized in space and time based on a fully implicit, cell-centered finite difference scheme, with an adaptive time-stepping strategy designed to accelerate the progress to equilibrium. At each time step, a parallel Newton–Krylov–Schwarz algorithm is used to solve the nonlinear system. We discuss various numerical and computational challenges associated with the method. The numerical scheme is validated by a comparison with an explicit scheme of high accuracy (and unreasonably high cost). We present steady state solutions of the CHC equation in two and three dimensions. The effect of the thermal fluctuation on the spinodal decomposition process is studied. We show that the existence of the thermal fluctuation accelerates the spinodal decomposition process and that the final steady morphology is sensitive to the stochastic noise. We also show the evolution of the energies and statistical moments. In terms of the parallel performance, it is found that the implicit domain decomposition approach scales well on supercomputers with a large number of processors.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Parallel performance optimizations on unstructured mesh-based simulations
This paper addresses two key parallelization challenges the unstructured mesh-based ocean modeling code, MPAS-Ocean, which uses a mesh based on Voronoi tessellations: (1) load imbalance across processes, and (2) unstructured data access patterns, that inhibit intra- and inter-node performance. Our work analyzes the load imbalance due to naive partitioning of the mesh, and develops methods to generate mesh partitioning with better load balance and reduced communication. Furthermore, we present methods that minimize both inter- and intranode data movement and maximize data reuse. Our techniques include predictive ordering of data elements for higher cache efficiency, as well as communication reduction approaches. We present detailed performance data when running on thousands of cores using the Cray XC30 supercomputer and show that our optimization strategies can exceed the original performance by over 2×. Additionally, many of these solutions can be broadly applied to a wide variety of unstructured grid-based computations.
97 MATHEMATICS AND COMPUTING↗