Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallelization efficiency”

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,351 records · Page 75

Multiscale modeling of polyisoprene on graphite

The local dynamics and the conformational properties of polyisoprene next to a smooth graphite surface constructed by graphene layers are studied by a multiscale methodology. First, fully atomistic molecular dynamics simulations of oligomers next to the surface are performed. Subsequently, Monte Carlo simulations of a systematically derived coarse-grained model generate numerous uncorrelated structures for polymer systems. A new reverse backmapping strategy is presented that reintroduces atomistic detail. Finally, multiple extensive fully atomistic simulations with large systems of long macromolecules are employed to examine local dynamics in proximity to graphite. Polyisoprene repeat units arrange close to a parallel configuration with chains exhibiting a distribution of contact lengths. Efficient Monte Carlo algorithms with the coarse-grain model are capable of sampling these distributions for any molecular weight in quantitative agreement with predictions from atomistic models. Furthermore, molecular dynamics simulations with well-equilibrated systems at all length-scales support an increased dynamic heterogeneity that is emerging from both intermolecular interactions with the flat surface and intramolecular cooperativity. This study provides a detailed comprehensive picture of polyisoprene on a flat surface and consists of an effort to characterize such systems in atomistic detail.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Hydrogen molecule on lithium adsorbed graphene: A DFT study

Electronic structure calculations for the adsorption of molecular hydrogen on lithium (Li) decorated and pristine graphene have been studied systematically using SIESTA code [1] within the framework of the first-principle DFT under the Perdew-Burke-Ernzerhof (PBE) form of the generalized gradient approximation (GGA)[2], including spin polarization. The energy of adsorption of hydrogen molecule on graphene is always enhanced by the presence of co-adsorbed lithium. The most efficient adsorption configuration is when H{sub 2} is lying parallel to lithium adsorbed graphene which is in contrast to its adsorption on pristine graphene (PG) where it prefers perpendicular orientation.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

ELECTRON ACCELERATION BY CASCADING RECONNECTION IN THE SOLAR CORONA. I. MAGNETIC GRADIENT AND CURVATURE DRIFT EFFECTS

We investigate the electron acceleration by magnetic gradient and curvature drift effects in cascading magnetic reconnection of a coronal current sheet via a test particle method in the framework of the guiding center approximation. After several Alfvén transit times, most of the electrons injected at the current sheet are still trapped in the magnetic islands. A small fraction of the injected electrons precipitate into the chromosphere. The acceleration of trapped electrons is dominated by the magnetic curvature drifts, which change the parallel momentum of the electron, and appears to be more efficient than the acceleration of precipitating electrons, which is dominated by the perpendicular momentum change caused by the magnetic gradient drifts. With the resulting trapped energetic electron distribution, the corresponding hard X-ray (HXR) radiation spectra are calculated using an optically thin Bremsstrahlung model. Trapped electrons may explain flare loop top HXR emission as well as the observed bright spots along current sheets trailing coronal mass ejections. The asymmetry of precipitating electrons with respect to the polarity inversion line may contribute to the observed asymmetry of footpoint emission.

79 ASTRONOMY AND ASTROPHYSICS↗

Low power on-chip data transmission for wafer-scale monolithic active pixel sensors

Here, this paper details the implementation of the digital pulse shaping subsystem within the Backbone Transmission Line Encoding (BTLE) driver, a low-power, long-distance on-chip data transmission solution designed in a 65 nm CMOS process. Digital pulse shaping is critical for minimizing inter-symbol interference (ISI) caused by bandwidth limitations of on-chip interconnects, especially in wafer-scale monolithic active pixel sensors (MAPS). A duobinary encoder coupled with a parallelized polyphase finite impulse response (FIR) filter is used for efficient shaping of the transmitted signal spectrum. This reconfigurable architecture achieves reliable 160 Mb/s data transfer over a 10 cm on-chip link, as validated by simulations demonstrating low power consumption (FoM 37.3 fJ/bit/mm of transmission line length) and effective ISI mitigation.

47 OTHER INSTRUMENTATION↗

Scalable Static and Dynamic Community Detection Using Grappolo

Graph clustering, popularly known as community detection, is a fundamental kernel for several applications of relevance to the Defense Advanced Research Projects Agency’s (DARPA) Hierarchical Identify Verify Exploit (HIVE) Pro- gram. Clusters or communities represent natural divisions within a network that are densely connected within a cluster and sparsely connected to the rest of the network. The need to compute clustering on large scale data necessitates the development of efficient algorithms that can exploit modern architectures that are fundamentally parallel in nature. How- ever, due to their irregular and inherently sequential nature, many of the current algorithms for community detection are challenging to parallelize. In response to the HIVE Graph Challenge, we present several parallelization heuristics for fast community detection using the Louvain method as the serial template. We implement all the heuristics in a software library called Grappolo. Using the inputs from the HIVE Challenge, we demonstrate superior performance and high quality solutions based on four parallelization heuristics. We use Grappolo on static graphs as the first step towards community detection on streaming graphs.

Community Detection↗

Winding Schemes for Wide Constant Power Range of Double Stator Transverse Flux Machine

Different ring winding schemes for double sided transverse flux machines are investigated in this paper for wide speed operation. The windings under investigation are based on two inverters used in parallel. At higher power applications this arrangement improves the drive efficiency. The new winding structure through manipulation of the end connection splits individual sets into two and connects the partitioned turns from individual stator sets in series. This configuration offers the flexibility of torque profiling and a greater flux weakening region. At low speeds and low torque only one winding set is capable of providing the required torque thus providing greater fault tolerance. At higher speeds one set is dedicated to torque production and the other for flux control. The proposed method improves the machine efficiency and allows better flux weakening which is desirable for traction applications.

17 WIND ENERGY↗

Rapid Calculation of Max-Min Fair Rates for Multi-Commodity Flows in Fat-Tree Networks

Max-min fairness is often used in the performance modeling of interconnection networks. Existing methods to compute max-min fair rates for multi-commodity flows have high complexity and are computationally infeasible for large networks. In this paper, we show that by considering topological features, this problem can be solved efficiently for the fat-tree topology that is widely used in data centers and high performance compute clusters. Several efficient new algorithms are developed for this problem, including a parallel algorithm that can take advantage of multi-core and shared-memory architectures. Using these algorithms, we demonstrate that it is possible to find the max-min fair rate allocation for multi-commodity flows in fat-tree networks that support tens of thousands of nodes. We evaluate the run-time performance of the proposed algorithms and show improvement in orders of magnitude over the previously best known method. Finally, we further demonstrate a new application of max-min fair rate allocation that is only computationally feasible using our new algorithms.

97 MATHEMATICS AND COMPUTING↗

A Parallel Cut-Cell Algorithm for the Free-Boundary Grad--Shafranov Problem

A parallel cut-cell algorithm is described to solve the free-boundary problem of the Grad--Shafranov equation. The algorithm reformulates the free-boundary problem in an irregular bounded domain and its important aspects include a searching algorithm for the magnetic axis and separatrix, a surface integral along the irregular boundary to determine the boundary values, an approach to optimize the coil current based on a targeting plasma shape, Picard iterations with Aitken's acceleration for the resulting nonlinear problem, and a Cartesian grid embedded boundary method to handle the complex geometry. Here the algorithm is implemented in parallel using a standard domain-decomposition approach and a good parallel scaling is observed. Numerical results verify the accuracy and efficiency of the free-boundary Grad--Shafranov solver.

97 MATHEMATICS AND COMPUTING↗

Caffeine v0.1.0

Caffeine is the CoArray Fortran Framework of Efficient Interfaces to Network Environments. Caffeine aims to produce a parallel runtime library that will support Fortran compilers with a programming-model-agnostic application binary interface (ABI) to various lower-level communication libraries. The current version of Caffeine uses the GASNet-EX networking middleware, also developed at Berkeley Lab. On many combinations of applications and platforms, GASNet-EX outperforms the widely used Message Passing Interface (MPI). Through GASNet-EX's support for communicating between graphics processing units (GPU), GASNet-EX has features that specifically target the emerging, leading-edge exascale computing platforms.

Rouson, Damian↗

Three-dimensional induced polarization data inversion for complex resistivity

The conductive and capacitive material properties of the subsurface can be quantified through the frequency-dependent complex resistivity. However, the routine three-dimensional (3D) interpretation of voluminous induced polarization (IP) data sets still poses a challenge due to large computational demands and solution nonuniqueness. We have developed a flexible methodology for 3D (spectral) IP data inversion. Our inversion algorithm is adapted from a frequency-domain electromagnetic (EM) inversion method primarily developed for large-scale hydrocarbon and geothermal energy exploration purposes. The method has proven to be efficient by implementing the nonlinear conjugate gradient method with hierarchical parallelism and by using an optimal finite-difference forward modeling mesh design scheme. The method allows for a large range of survey scales, providing a tool for both exploration and environmental applications. We experimented with an image focusing technique to improve the poor depth resolution of surface data sets with small survey spreads. The algorithm's underlying forward modeling operator properly accounts for EM coupling effects; thus, traditionally used EM coupling correction procedures are not needed. The methodology was applied to both synthetic and field data. We tested the benefit of directly inverting EM coupling contaminated data using a synthetic large-scale exploration data set. Afterward, we further tested the monitoring capability of our method by inverting time-lapse data from an environmental remediation experiment near Rifle, Colorado. Similar trends observed in both our solution and another 2D inversion were in accordance with previous findings about the IP effects due to subsurface microbial activity.

15 GEOTHERMAL ENERGY↗

Energy scaling advantages of resistive memory crossbar based computation and its application to sparse coding

In this study, the exponential increase in data over the last decade presents a significant challenge to analytics efforts that seek to process and interpret such data for various applications. Neural-inspired computing approaches are being developed in order to leverage the computational properties of the analog, low-power data processing observed in biological systems. Analog resistive memory crossbars can perform a parallel read or a vector-matrix multiplication as well as a parallel write or a rank-1 update with high computational efficiency. For an N × N crossbar, these two kernels can be O(N) more energy efficient than a conventional digital memory-based architecture. If the read operation is noise limited, the energy to read a column can be independent of the crossbar size (O(1)). These two kernels form the basis of many neuromorphic algorithms such as image, text, and speech recognition. For instance, these kernels can be applied to a neural sparse coding algorithm to give an O(N) reduction in energy for the entire algorithm when run with finite precision. Sparse coding is a rich problem with a host of applications including computer vision, object tracking, and more generally unsupervised learning.

97 MATHEMATICS AND COMPUTING↗

Experiences with Cray multi-tasking

The issues involved in modifying an existing code for multitasking is explored. They include Cray extensions to FORTRAN, an examination of the application code under study, designing workable modifications, specific code modifications to the VAX and Cray versions, performance, and efficiency results. The finished product is a faster, fully synchronous, parallel version of the original program. A production program is partitioned by hand to run on two CPUs. Loop splitting multitasks three key subroutines. Simply dividing subroutine data and control structure down the middle of a subroutine is not safe. Simple division produces results that are inconsistent with uniprocessor runs. The safest way to partition the code is to transfer one block of loops at a time and check the results of each on a test case. Other issues include debugging and performance. Task startup and maintenance (e.g., synchronization) are potentially expensive.

Miya, E. N.↗

An iterative method for systems of nonlinear hyperbolic equations

An iterative algorithm for the efficient solution of systems of nonlinear hyperbolic equations is presented. Parallelism is evident at several levels. In the formation of the iteration, the equations are decoupled, thereby providing large grain parallelism. Parallelism may also be exploited within the solves for each equation. Convergence of the interation is established via a bounding function argument. Experimental results in two-dimensions are presented.

Scroggs, Jeffrey S.↗

Spectral element simulations of laminar and turbulent flows in complex geometries

Spectral element methods are high-order weighted residual techniques based on spectral expansions of variables and geometry for the Navier-Stokes (NS) and transport equations. Here, practical aspects of these methods and their efficient implementation are examined, and several examples of flows in truly complex geometries are presented. The spectral element discretization for NS equations is introduced, and the convergence of the method is addressed. An efficient data management scheme is discussed in the context of parallel processing computations. The method is validated by comparing the spectral element solutions with the exact eigensolutions for the Orr-Sommerfeld equations in two and three dimensions. Computer-aided flow visualizations are presented for an impulsive flow past a sharp edge wedge. Three-dimensional states of channel flow disrupted by an array of cylindrical eddy promoters are studied, and the results of a direct simulation of the turbulent flow in a plane channel are presented.

Karniadakis, George EM↗

PARTI primitives for unstructured and block structured problems

Described here is a set of primitives (PARTI) developed to efficiently execute unstructured and block structured problems on distributed memory parallel machines. We present experimental data from a 3-D unstructured Euler solver run on the Intel Touchstone Delta to demonstrate the usefulness of our methods.

Sussman, Alan↗

Unstructured mesh algorithms for aerodynamic calculations

The use of unstructured mesh techniques for solving complex aerodynamic flows is discussed. The principle advantages of unstructured mesh strategies, as they relate to complex geometries, adaptive meshing capabilities, and parallel processing are emphasized. The various aspects required for the efficient and accurate solution of aerodynamic flows are addressed. These include mesh generation, mesh adaptivity, solution algorithms, convergence acceleration, and turbulence modeling. Computations of viscous turbulent two-dimensional flows and inviscid three-dimensional flows about complex configurations are demonstrated. Remaining obstacles and directions for future research are also outlined.

Mavriplis, D. J.↗

Unstructured mesh algorithms for aerodynamic calculations

The use of unstructured mesh techniques for solving complex aerodynamic flows is discussed. The principle advantages of unstructured mesh strategies, as they relate to complex geometries, adaptive meshing capabilities, and parallel processing are emphasized. The various aspects required for the efficient and accurate solution of aerodynamic flows are addressed. These include mesh generation, mesh adaptivity, solution algorithms, convergence acceleration, and turbulence modeling. Computations of viscous turbulent two-dimensional flows and inviscid three-dimensional flows about complex configurations are demonstrated. Remaining obstacles and directions for future research are also outlined.

Mavriplis, D. J.↗

PARTI primitives for unstructured and block structured problems

Described here is a set of primitives (PARTI) developed to efficiently execute unstructured and block structured problems on distributed memory parallel machines. We present experimental data from a 3-D unstructured Euler solver run on the Intel Touchstone Delta to demonstrate the usefulness of our methods.

Sussman, A.↗