Engineering PapersSearch

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.

At least 199 records · Page 11

Studies of whistler propagation along a plasma density gradient that is parallel to the magnetic field

Low frequency plasma wave generation in space is important for both scientific and practical applications. One of the most promising techniques for doing this is to directly inject whistler waves into the space environment from an antenna onboard one or more satellites. This technique has been discussed for years, but there are still open questions about the best way to generate plasma waves. So far, most theoretical [Kondrat92], lab based [Pribyl2010, Stenzel2016] and space-based experiments [DSX] have focused on studying the generation of whistler waves from an electric dipole antenna. However, a dipole antenna is very inefficient because it puts a lot of energy in waves that are not effective for most applications. Theoretical [Kondrat92] and lab experimental [Stenzel2016] results indicate that a loop antenna is much more efficient at generating whistler waves than a dipole antenna. A satellite experiment will need to be developed to demonstrate that whistler waves can be generated from a loop antenna in the space environment. The challenge is that to efficiently transmit whistler modes in the natural plasma environment of space, the loop antenna will have to be very large. For example, at L=2 (one earth radius away from the surface of the earth) a loop antenna would need a radius on the order of ~200 m to radiate efficiently, as shown in fig. 1, left. The antenna size and complexity would require a prohibitively large and expensive satellite mission. Our proposed innovation is to exploit the fact that the characteristic wavelength of whistler waves decreases in more dense plasma, which reduces the size needed for an antenna to radiate efficiently. Fortunately, a technique already exists for enhancing the local plasma density in space, called a plasma contactor [Kovaleski2001]. A plasma contactor can be used to create a local environment where the plasma density is enhanced around the satellite, which in turn reduces the size of an antenna that is needed to radiate efficiently (Fig. 1, right).

42 ENGINEERING

Tuning Shinkarev’s Bicycle: Separating the Parallel Cycles of Photosystem II Using Empirical Wavelet Transform

The oxygen-evolving complex (OEC) of Photosystem II (PSII) catalyzes light-driven water oxidation, a process necessary to sustain Earth’s atmospheric oxygen. Oxygen yields measured during single-turnover flash sequences exhibit period-four oscillations, which form the basis of the Joliot–Kok (S-state) model. However, when the oscillations of other processes contribute to the measured oxygen yield, fitting methods can conflate these signals and distort estimates of inefficiencies and initial S-state populations. To address this, we applied the empirical wavelet transform (EWT) as a model-independent method to separate overlapping oscillators and capture damping dynamics that are not well represented in Fourier analysis. We tested this framework on polarographic flash-oxygen traces from both our Synechocystis sp. PCC 6803 thylakoid membrane preparations and archival datasets on Chlorella and isolated chloroplasts. EWT consistently resolves the expected period-four component alongside a distinct binary oscillation. Simulations suggest that fitting this isolated period-four signal recovers VZAD parameters more accurately than analysis of raw traces, yielding different estimates for S-state distributions and transition probabilities. Notably, this binary oscillation aligns closely with semiquinone dynamics predicted solely from period-four fit parameters. These findings indicate that EWT can effectively distinguish complex signals in oxygen evolution, offering a framework potentially applicable to other spectroscopic probes of the S-state cycle.

Ferrari, Nicholas [Louisiana State Univ., Baton Ro

OPER: Optimality-Guided Embedding Table Parallelization for Large-scale Recommendation Model

With the sharp increasing volume of user data, Deep Learning Recommendation Model (DLRM) becomes an indispensable infrastructure in large technology companies. However, large-scale DLRM on the multi-GPU platform is still inefficient due to unbalanced workload partitioning and intensive inter-GPU communication. To this end, we propose OPER, an OPtimality guided Embedding table placement for large-scale Recommendation model training and inference. OPER explores the potential of mitigating remote memory access latency in DLRM through fine-grained embedding table placement. Specifically, OPER proposes a theoretical modeling that builds up the relationship between EMT placement and the embedding communication latency in both training and inference. OPER proves the NP hardness of finding the optimal embedding table placement and proposes a heuristic algorithm that yields near optimal placement. OPER implements a SHMEM-based embedding table training system and a unified embedding index mapping to support fine-grained embedding table sharding and placement. Comprehensive experiments reveal that OPER achieves on average 3.4× and 5.1× speedup on training and inference respectively over state-of-the-art DLRM frameworks.

Wang, Zheng

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

Unorthodox Parallelization for Bayesian Quantum State Estimation

Bayesian inference enables informationally efficient quantum state tomography (QST) yet is challenging to scale computationally. We demonstrate a parallelizable Bayesian QST method that, although unorthodox, proves remarkably practical, attaining significant speedups in multiqubit state estimation.

Nguyen, Hanson H. [Arizona State University] (ORCI

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallel-in-time methods, with the most common method, parareal, diverging in many cases. The current state of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be further researched and improved (including with a new relaxation method inspired by on Least Squares Shadowing (LSS)) and explored for more complicated problems.

97 MATHEMATICS AND COMPUTING

T-FSM: A Scalable Distributed Task-Based System for Frequent Subgraph Pattern Mining from a Big Graph

Finding frequent subgraph patterns in a big graph is an important problem with many applications such as classifying chemical compounds and building indexes to speed up graph queries. Since this problem is NP-hard, some recent parallel and distributed systems have been developed to accelerate the mining. However, they often have a huge memory cost, very long running time, suboptimal load balancing, poor scale-out capability, and possibly inaccurate results. In this article, we propose an efficient system called T-FSM for parallel mining of frequent subgraph patterns in a big graph. T-FSM supports a new anti-monotonic frequentness measure called Fraction-Score, which is more accurate than the widely used MNI measure. The execution engine of T-FSM supports both intra-machine parallelism and inter-machine parallelism. For intra-machine parallelism, T-FSM adopts a novel task-based execution model to ensure high multithreading concurrency, bounded memory consumption, and effective load balancing. For inter-machine parallelism, T-FSM ensures good scale-out performance with a lightweight pattern rebalancing approach that reduces workload skewness of pattern evaluations among machines. To avoid recomputing the contexts for migrated patterns, we design a novel context cache table to support concurrent and asynchronous requesting and caching of remote context data, which can timely evict and garbage collect used pattern contexts that are no longer needed to keep memory consumption bounded. Extensive experiments show that T-FSM is orders of magnitude faster than existing state-of-the-art parallel systems (more than 10×, 51×, 131×, 55× speedup over ScaleMine, DistGraph, Pangolin and Peregrine, respectively) and distributed systems (more than 42× and 88× over ScaleMine and DistGraph, respectively) for frequent subgraph pattern mining, and it scales out satisfactorily to 512 CPU cores on the Polaris supercomputer at Argonne National Laboratory.

97 MATHEMATICS AND COMPUTING