Search NASA⌕ Search

SEARCH · Search NASA

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,423 records · Page 79

A Comparison of Shared Memory Parallel Programming Models

The dominant parallel programming models for shared memory computers, Pthreads and OpenMP, are both thread-centric in that they are based on explicit management of tasks and enforce data dependencies and output ordering through task management. By comparison, the Cray XMT programming model is data-centric where the primary concern of the programmer is managing data dependencies, allowing threads to progress in a data flow fashion. The XMT implements this programming model by associating tag bits with each word of memory, affording efficient fine grained data synchronization independent of the number of processors or how tasks are scheduled. When task management is implicit and synchronization is abundant, efficient, and easy to use, programmers have viable alternatives to traditional thread-centric algorithms. In this paper we compare the amount of available parallelism relative to the amount of work in a variety of different algorithms and data structures when synchronization does not need to be rationed, as well as identify opportunities for platform and performance portability of the data-centric programming model on multi-core processors.

99 GENERAL AND MISCELLANEOUS↗

A massively parallel semi-Lagrangian algorithm for solving the transport equation

The scalar transport equation underpins many models employed in science, engineering, technology and business. Application areas include, but are not restricted to, pollution transport, weather forecasting, video analysis and encoding (the optical flow equation), options and stock pricing (the Black-Scholes equation) and spatially explicit ecological models. Unfortunately finding numerical solutions to this equation which are fast and accurate is not trivial. Moreover, finding such numerical algorithms that can be implemented on high performance computer architectures efficiently is challenging. In this paper the authors describe a massively parallel algorithm for solving the advection portion of the transport equation. We present an approach here which is different to that used in most transport models and which we have tried and tested for various scenarios. The approach employs an intelligent domain decomposition based on the vector field of the system equations and thus automatically partitions the computational domain into algorithmically autonomous regions. The solution of a classic pure advection transport problem is shown to be conservative, monotonic and highly accurate at large time steps. Additionally we demonstrate that the algorithm is highly efficient for high performance computer architectures and thus offers a route towards massively parallel application.

54 ENVIRONMENTAL SCIENCES↗

Parallel electron heating in the magnetospheric inflow region: Electron Heating in Reconnection

We analyzed 20 reconnection events observed by the Magnetosphere MultiScale mission, finding that in a subregion of the magnetospheric inflow, the electron temperature parallel to the magnetic field (T e|| ) decreases toward the separatrix with increasing densities. Such Te|| variation is not consistent with the heating through the parallel potential mechanism for magnetospheric electrons. Associated with the change in T e|| , low-energy gyrotropic magnetosheath-like electrons are observed. These electrons may come from the magnetosheath, penetrate to the magnetospheric side possibly due to waves in the lower hybrid frequency range, and do not experience as much energization as those from deeper in the magnetosphere. In addition, as T e|| decreases, the high-energy field-aligned phase-space densities decrease or fluctuate significantly over time. Wave-particle interaction might produce energy conversion and cause the high-energy phase-space density variations.

79 ASTRONOMY AND ASTROPHYSICS↗

Breaking Parallel Orientation of Rods via a Dendritic Architecture toward Diverse Supramolecular Structures

Abstract Self‐assembled nanostructures of rod‐like molecules are commonly limited to nematic or layered smectic structures dominated by the parallel arrangement of the rod‐like components. Distinct self‐assembly behavior of four categories of dendritic rods constructed by placing a tri(hydroxy) group at the apex of dendritic oligo‐fluorenes is observed. Designed hydrogen bonding and dendritic architecture break the parallel arrangement of the rods, resulting in molecules with specific (fan‐like or cone‐like) shapes. While the fan‐shaped molecules tend to form hexagonal packing cylindrical phases, the cone‐shaped molecules could form spherical motifs to pack into various ordered structures, including the Frank–Kasper A15 phase and dodecagonal quasicrystal. This study provides a model system to engineer diverse supramolecular structures by rod‐like molecules and sheds new light into the mechanisms of the formation of unconventional spherical packing structures in soft matter.

Zhang, Ruimeng↗

Breaking Parallel Orientation of Rods via a Dendritic Architecture toward Diverse Supramolecular Structures

Abstract Self‐assembled nanostructures of rod‐like molecules are commonly limited to nematic or layered smectic structures dominated by the parallel arrangement of the rod‐like components. Distinct self‐assembly behavior of four categories of dendritic rods constructed by placing a tri(hydroxy) group at the apex of dendritic oligo‐fluorenes is observed. Designed hydrogen bonding and dendritic architecture break the parallel arrangement of the rods, resulting in molecules with specific (fan‐like or cone‐like) shapes. While the fan‐shaped molecules tend to form hexagonal packing cylindrical phases, the cone‐shaped molecules could form spherical motifs to pack into various ordered structures, including the Frank–Kasper A15 phase and dodecagonal quasicrystal. This study provides a model system to engineer diverse supramolecular structures by rod‐like molecules and sheds new light into the mechanisms of the formation of unconventional spherical packing structures in soft matter.

Zhang, Ruimeng↗

A switch from parallel to antiparallel strand orientation in a coiled-coil X-ray structure via two core hydrophobic mutations

The coiled-coil is one of the most ubiquitous and well studied protein structural motifs. Significant effort has been devoted to dissecting subtle variations of the typical heptad repeat sequence pattern that can designate larger topological features such as relative α-helical orientation and oligomer size. Here in this paper we report the X-ray structure of a model coiled-coil peptide, HA2-Del-L2seM, which forms an unanticipated core antiparallel dimer with potential sites for discrete higher-order multimerization (trimer or tetramer). In the X-ray structure, a third, partially-ordered α-helix is weakly associated with the antiparallel dimer and analytical ultracentrifugation experiments indicate the peptide forms a well-defined tetramer in solution. The HA2-Del-L2seM sequence is closely related to a parent model peptide, HA2-Del, which we previously reported adopts a parallel trimer; HA2-Del-L2seM differs by only hydrophobic leucine to selenomethione mutations and thus this subtle difference is sufficient to switch both relative α-helical topology and number of α-helices participating in the coiled-coil. Comparison of the X-ray structures of HA2-Del-L2seM (reported here) with the HA2-Del parent (reported previously) reveals novel interactions involving the selenomethionine residues that promote antiparallel coiled-coil configuration and preclude parallel trimer formation. Finally, these novel atomic insights are instructive for understanding subtle features that can affect coiled-coil topology and provide additional information for design of antiparallel coiled-coils.

59 BASIC BIOLOGICAL SCIENCES↗

Genetic algorithm based task reordering to improve the performance of batch scheduled massively parallel scientific applications

The growth in size of networked high performance computers along with novel accelerator-based node architectures has further emphasized the importance of communication efficiency in high performance computing. The world's largest high performance computers are usually operated as shared user facilities due to the costs of acquisition and operation. Applications are scheduled for execution in a shared environment and are placed on nodes that are not necessarily contiguous on the interconnect. Furthermore, the placement of tasks on the nodes allocated by the scheduler is sub-optimal, leading to performance loss and variability. Here, we investigate the impact of task placement on the performance of two massively parallel application codes on the Titan supercomputer, a turbulent combustion flow solver (S3D) and a molecular dynamics code (LAMMPS). Benchmark studies show a significant deviation from ideal weak scaling and variability in performance. The inter-task communication distance was determined to be one of the significant contributors to the performance degradation and variability. A genetic algorithm-based parallel optimization technique was used to optimize the task ordering. This technique provides an improved placement of the tasks on the nodes, taking into account the application's communication topology and the system interconnect topology. As a result, application benchmarks after task reordering through genetic algorithm show a significant improvement in performance and reduction in variability, therefore enabling the applications to achieve better time to solution and scalability on Titan during production.

97 MATHEMATICS AND COMPUTING↗

A performance spectrum for parallel computational frameworks that solve PDEs

Summary Important computational physics problems are often large‐scale in nature, and it is highly desirable to have robust and high performing computational frameworks that can quickly address these problems. However, it is no trivial task to determine whether a computational framework is performing efficiently or is scalable. The aim of this paper is to present various strategies for better understanding the performance of any parallel computational frameworks for solving PDEs. Important performance issues that negatively impact time‐to‐solution are discussed, and we propose a performance spectrum analysis that can enhance one's understanding of critical aforementioned performance issues. As proof of concept, we examine commonly used finite element simulation packages and software and apply the performance spectrum to quickly analyze the performance and scalability across various hardware platforms, software implementations, and numerical discretizations. It is shown that the proposed performance spectrum is a versatile performance model that is not only extendable to more complex PDEs such as hydrostatic ice sheet flow equations but also useful for understanding hardware performance in a massively parallel computing environment. Potential applications and future extensions of this work are also discussed.

Chang, J.↗

A PETSc Parallel-in-Time Solver based on MGRIT algorithm

We address the development of a modular implementation of the MGRIT (MultiGrid-In-Time) algorithm to solve linear and nonlinear systems that arise from the discretization of evolutionary models with a parallel-in-time approach in the context of the PETSc (the Portable, Extensible Toolkit for Scientific computing) library. Our aim is to give the opportunity of predicting the performance gain achievable when using the MGRIT approach instead of the Time Stepping integrator (TS). To this end, we analyze the performance parameters of the algorithm that provide a-priori the best number of processing elements and grid levels to use to address the scaling of MGRIT, regarded as a parallel iterative algorithm proceeding along the time dimension.

Mele, Valeria↗

Parallel membership queries on very large scientific data sets using bitmap indexes

© 2019 John Wiley & Sons, Ltd. Many scientific applications produce very large amounts of data as advances in hardware fuel computing and experimental facilities. Managing and analyzing massive quantities of scientific data is challenging as data are often stored in specific formatted files, such as HDF5 and NetCDF, which do not offer appropriate search capabilities. In this research, we investigated a special class of search capability, called membership query, to identify whether queried elements of a set are members of an attribute. Attributes that naturally have classification values appear frequently in scientific domains such as category and object type as well as in daily life such as zip code and occupation. Because classification attribute values are discrete and require random data access, performing a membership query on a large scientific data set creates challenges. We applied bitmap indexing and parallelization to membership queries to overcome these challenges. Bitmap indexing provides high performance not only for low cardinality attributes but also for high cardinality attributes, such as floating-point variables, electric charge, or momentum in a particle physics data set, due to compression algorithms such as Word-Aligned Hybrid. We conducted experiments, in a highly parallelized environment, on data obtained from a particle accelerator model and a synthetic data set.

Yildiz, Beytullah↗

OpenGraphGym: A Parallel Reinforcement Learning Framework for Graph Optimization Problems

This paper presents an open-source, parallel AI environment (named OpenGraphGym) to facilitate the application of reinforcement learning (RL) algorithms to address combinatorial graph optimization problems. This environment incorporates a basic deep reinforcement learning method, and several graph embeddings to capture graph features, it also allows users to rapidly plug in and test new RL algorithms and graph embeddings for graph optimization problems. This new open-source RL framework is targeted at achieving both high performance and high quality of the computed graph solutions. This RL framework forms the foundation of several ongoing research directions, including 1) benchmark works on different RL algorithms and embedding methods for classic graph problems; 2) advanced parallel strategies for extreme-scale graph computations, as well as 3) performance evaluation on real-world graph solutions.

Zheng, Weijian↗

Checkpoint/restart-enabled parallel debugging

Debugging is often the most time consuming part of software development. HPC applications prolong the debugging process by adding more processes interacting in dynamic ways for longer periods of time. Checkpoint/restart- enabled parallel debugging returns the developer to an intermediate state closer to the bug. This focuses the debugging process, saving developers considerable amounts of time, but requires parallel debuggers cooperating with MPI implementations and checkpointers. This paper presents a design specification for such a cooperative relationship. Additionally, this paper discusses the application of this design to the GDB and DDT debuggers, Open MPI, and BLCR projects. © 2010 Springer-Verlag.

97 MATHEMATICS AND COMPUTING↗

A 2nd Generation Parallel Advancing Front Grid Generator

A scalable, parallel advancing grid generation technique has been developed for complex geometries and meshes with large size variations. The key innovation compared to previous techniques is the use of a domain-defining grid that has the same fine surface triangulation as the final mesh desired, but a much coarser interior mesh. In this way, the domain to be gridded is uniquely defined, overcoming a shortcoming of previous approaches. This domain-defining grid is then partitioned according to the estimated number of elements to be generated, allowing for a balanced distribution of work among the processors. The domain defining grid is also used to redistribute the elements and points after grid generation, and during the subsequent mesh improvement. Timings show that the proposed approach is scalable and able to produce large grids of high quality in a modest amount of clocktime. With the proposed parallel grid generator, a major impediment to a completely scalable simulation pipeline (grid generation, solvers, post-processing) has been removed, opening the way for truly large-scale computations using unstructured, body-fitted grids.

Grid Generation↗

ViennaX: a parallel plugin execution framework for scientific computing

We present the free open source plugin execution framework ViennaX for modularizing and parallelizing scientific simulations. In general, functionality is abstracted by the notion of a task, which is implemented as a plugin. The plugin system facilitates the utilization of both, already available functionality as well as new implementations. Each task can define arbitrary data dependencies which are used by ViennaX to build a task graph. The framework supports the execution of this dependence graph based on the message passing interface in either a serial or a parallel fashion. The applied modular approach allows for defining highly flexible simulations, as plugins can be easily exchanged. The framework's general design as well as implementation details are discussed. Applications based on the Mandelbrot set and the solution of a partial differential equation are investigated, and performance results are shown.

Weinbub, Josef↗

Parallel anisotropic mesh adaptation with boundary layers for automated viscous flow simulations

This paper presents a set of parallel procedures for anisotropic mesh adaptation accounting for mixed element types used in boundary layer meshes, i.e., the current procedures operate in parallel on distributed boundary layer meshes. The procedures accept anisotropic mesh metric field as an input for the desired mesh size field and apply local mesh modifications to adapt the mesh to match/satisfy the specified mesh size field. The procedures fully account for the parametric geometry of curved domains and maintain the semi-structured nature of the boundary layer elements. The effectiveness of the procedures is demonstrated on three viscous flow examples that include the ONERA M6 wing, a heat transfer manifold, and a scramjet engine.

Sahni, Onkar↗

Parallel Radioisotope Collection and Analysis in Response to the Fukushima Release

Two independent air samplers were operated at Pacific Northwest National Laboratory in parallel during the collection of samples from the Fukushima reactor releases. One system is an automated aerosol collection and analysis unit, while the other was a manual sampler of higher daily air volume. The samples collected each day showed excellent correlation in radionuclide activity, although some variations were seen. These variations illustrate the reproducibility of the air sample radionuclide measurements made by the Comprehensive Nuclear-Test-Ban Treaty International Monitoring System (IMS) and show a simple way to acquire useful parallel samples for scientific purposes. In particular, a party wishing to have a “copy” of a sample acquired by the verification regime of the treaty could employ this method and have results similar to the IMS station at low cost and even higher sensitivity.

Atmospheric Aerosol Sampling↗

Commuting embeddings for parallel strategies in non-local games

Non-local games provide a versatile framework for probing quantum correlations and for benchmarking the power of entanglement. In finite dimensions, the standard method for playing several games in parallel requires a tensor product of the local Hilbert spaces, which scales additively in the number of qubits. In this work, we show that this additive cost can be reduced by exploiting algebraic embeddings. We introduce two forms of compressions. First, when a referee selects one game from a finite collection of games at random, the game quantum strategy can be implemented using a maximally entangled state of dimension equal to the largest individual game, thereby eliminating the need for repeated state preparations. Second, we establish conditions under which several games can be played simultaneously in parallel on fewer qubits than the tensor product baseline. These conditions are expressed in terms of commuting embeddings of the game algebras. Moreover, we provide a constructive framework for building such embeddings. Using tools from Lie theory, we show that aligning the various game algebras into a common Cartan decomposition enables such a qubit reduction. Beyond the theoretical contribution, our framework casts NLGs as algebraic primitives for distributed and resource-constrained quantum computations and suggested NLGs as a comparable device-independent dimension witness.

Commuting embeddings↗

Parallel and interacting stochastic approximation annealing algorithms for global optimisation

We present the parallel and interacting stochastic approximation annealing (PISAA) algorithm, a stochastic simulation procedure for global optimisation, that extends and improves the stochastic approximation annealing (SAA) by using population Monte Carlo ideas. The efficiency of standard SAA algorithm crucially depends on its selfadjusting mechanism which presents stability issues in high dimensional or rugged optimisation problems. The proposed algorithm involves simulating a population of SAA chains that interact each other in a manner that significantly improves the stability of the self-adjusting mechanism and the search for the global optimum in the sampling space, as well as it inherits SAA desired convergence properties when a square-root cooling schedule is used. It can be implemented in parallel computing environments in order to mitigate the computational overhead. As a result, PISAA can address complex optimisation problems that it would be difficult for SAA to satisfactory address. We demonstrate the good performance of the proposed algorithm on challenging applications including Bayesian network learning and protein folding. Our numerical comparisons suggest that PISAA outperforms the simulated annealing, stochastic approximation annealing, and annealing evolutionary stochastic approximation Monte Carlo.

Local trap↗