Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel, scaling”

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 775 records · Page 43

Dependence of Solar Wind Proton Temperature on the Polarization Properties of Alfvénic Fluctuations at Ion-kinetic Scales

In this work, we use fluctuating magnetic helicity to investigate the polarization properties of Alfvénic fluctuations at ion-kinetic scales in the solar wind as a function of β p , the ratio of proton thermal pressure to magnetic pressure, and θ vB , the angle between the proton flow and local mean magnetic field, B 0 . Using almost 15 yr of Wind observations, we separate the contributions to helicity from fluctuations with wavevectors, k, quasi-parallel and oblique to B 0 , finding that the helicity of Alfvénic fluctuations is consistent with predictions from linear Vlasov theory. This result suggests that the nonlinear turbulent fluctuations at these scales share at least some polarization properties with Alfvén waves. Furthermore, we also investigate the dependence of proton temperature in the β p –θ vB plane to probe for possible signatures of turbulent dissipation, finding that it correlates with θ vB . The proton temperature parallel to B 0 is higher in the parameter space where we measure the helicity of right-handed Alfvénic fluctuations, and the temperature perpendicular to B 0 is higher where we measure left-handed fluctuations. This finding is inconsistent with the general assumption that by sampling different θ vB in the solar wind we can analyze the dependence of the turbulence distribution on θ kB , the angle between k and B 0 . After ruling out both instrumental and expansion effects, we conclude that our results provide new evidence for the importance of local kinetic processes that depend on θ vB in determining proton temperature in the solar wind.

79 ASTRONOMY AND ASTROPHYSICS↗

Distributed X-ray photon correlation spectroscopy data reduction using Hadoop MapReduce

Multi-speckle X-ray photon correlation spectroscopy (XPCS) is a powerful technique for characterizing the dynamic nature of complex materials over a range of time scales. XPCS has been successfully applied to study a wide range of systems. Recent developments in higher-frame-rate detectors, while aiding in the study of faster dynamical processes, creates large amounts of data that require parallel computational techniques to process in near real-time. Here, an implementation of the multi-tau and two-time autocorrelation algorithms using the Hadoop MapReduce framework for distributed computing is presented. In conclusion, the system scales well with regard to the increase in the data size, and has been serving the users of beamline 8-ID-I at the Advanced Photon Source for near real-time autocorrelations for the past five years.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Modeling of Dendritic Evolution of Continuously Cast Steel Billet with Cellular Automaton

In order to predict the dendritic evolution during the continuous steel casting process, a simple mechanism to connect the heat transfer at the macroscopic scale and the dendritic growth at the microscopic scale was proposed in the present work. As the core of the across-scale simulation, a two-dimensional cell automaton (CA) model with a decentered square algorithm was developed and parallelized. Apart from nucleation undercooling and probability, a temperature gradient was introduced to deal with the columnar-to-equiaxed transition (CET) by considering its variation during continuous casting. Based on the thermal history, the dendritic evolution in a 4 mm × 40 mm region near the centerline of a SWRH82B steel billet was predicted. The influences of the secondary cooling intensity, superheat, and casting speed on the dendritic structure of the billet were investigated in detail. The results show that the predicted equiaxed dendritic solidification of Fe-5.3Si alloy and columnar dendritic solidification of Fe-0.45C alloy are consistent with in situ experimental results [Yasuda et al. Int J Cast Metals Res 22:15–21 (2009); Yasuda et al. ISIJ Int 51:402–408 (2011)]. Moreover, the predicted dendritic arm spacing and CET location agree well with the actual results in the billet. The primary dendrite arm spacing of columnar dendrites decreases with increasing secondary cooling intensity, or decreasing superheat and casting speed. Meanwhile, the CET is promoted as the secondary cooling intensity and superheat decrease. However, the CET is not influenced by the casting speed, owing to the adjusting of the flow rate of secondary spray water. Compared with the superheat and casting speed, the secondary cooling intensity can influence the cooling rate and temperature gradient in deeper locations, and accordingly exerts a more significant influence on the equiaxed dendritic structure.

36 MATERIALS SCIENCE↗

Time-dependent behavioral data from zebrafish reveals novel signatures of chemical toxicity using point of departure analysis

High-content imaging of embryonic zebrafish behavior can be used as a screening approach to rapidly evaluate the relative potential for chemicals to cause toxicity. However, most statistical methods applied to these data so far transform movement values to incidence-based “hits” and calculate lowest effect levels (LELs), which loses individual fish resolution of behavior and defies hazard ranking due to reliance on applied dose levels. Here, we have developed and parallelized a workflow to calculate benchmark dose (BMD) values from dynamic, high-content zebrafish behavior data that scales for high-throughput chemical screening. To appropriately capture the dynamics of zebrafish response from light to dark stimulus, we summarized time-dependent data using both area under the curve and immediate change at the transition point into two novel metrics that characterized abnormal behavior as a function of chemical concentration. The BMD workflow was applied to calculate BMD 10 values of 1,060 ToxCast chemicals for 24 zebrafish endpoints, including behavior, mortality and morphology. The BMD 10 values provided better precision and separation than LELs for clustering chemicals since they were derived from models that best-fit their concentration-response curves. Clustering analysis revealed behavioral signatures as the most sensitive endpoints. High concordance in chemical activity was observed between ToxCast assays and zebrafish behavioral endpoints, however ToxPi analysis indicated that rankings based on in vitro data was not a reliable predictor of in vivo rankings for lower potency chemicals. The methods developed in this work will enable the use of high-content zebrafish behavioral screening data for BMD analysis in toxicological hazard assessment.

59 BASIC BIOLOGICAL SCIENCES↗

Energy-efficient mapping of large-scale workflows under deadline constraints in big data computing systems

Large-scale workflows for big data analytics have become a main consumer of energy in data centers where moldable parallel computing models such as MapReduce are widely applied to meet high computational demands with time-varying computing resources. The granularity of task partitioning in each moldable job of such big data workflows has a significant impact on energy efficiency, which remains largely unexplored. In this paper, we analyze the properties of moldable jobs and formulate a workflow mapping problem to minimize the dynamic energy consumption of a given workflow request under a deadline constraint in big data systems. Since this problem is strongly NP-hard, we design a fully polynomial-time approximation scheme (FPTAS) for a special case with a pipeline-structured workflow on a homogeneous cluster and a heuristic for the generalized problem with an arbitrary workflow on a heterogeneous cluster. The performance superiority of the proposed solution in terms of dynamic energy saving and deadline missing rate is illustrated by extensive simulation results in comparison with existing algorithms, and further validated by real-life workflow implementation and experimental results in Hadoop/YARN systems.

97 MATHEMATICS AND COMPUTING↗

Dual-pace transient heat conduction in vertically aligned carbon nanotube arrays induced by structure separation

Vertically aligned arrays of carbon nanotubes (CNTs) are attractive for a wide range of macroscopic applications which can exploit the remarkable properties of individual nanotubes. In this work, an abnormal behavior of CNT bundles in heat conduction is discovered under the transient electro-thermal characterization. The measured voltage change over the sample shows a dual-pace thermal response (DTR), which could not be fitted using a single thermal diffusivity heat transfer model. Instead, two thermal diffusivities are determined from the DTR phenomenon. Three rounds of cryogenic experiments are conducted to investigate the physics behind DTR phenomenon. It starts to emerge when the temperature is reduced to a certain level. After two rounds of cryogenic experiments, the DTR phenomenon becomes permanent from 295 K to 10 K. The nano-scale structure separation induced by the increased thermal strain leads to macroscale structure separation, which results in two parallel heat conduction paths responsible for the DTR phenomenon. By building a new parallel heat transfer model taking both the transient and steady-state electrical and thermal response into consideration, the area ratio of separated CNTs is determined. Furthermore, this result uncovers the existence of coiled morphology and nano-structure evolution of CNTs under cryogenic state and its effect on thermal and electrical transport, especially on their transient behaviors. Knowledge of the thermal transport in these CNTs arrays is important considering the fact that transient thermal response strongly affects their mechanical, optical, and electrical behaviors.

42 ENGINEERING↗

The LSBmax algorithm for boosting resilience of electric grids post (N‐2) contingencies

Abstract A computationally improved algorithm is presented to find the best transmission switching (TS) candidate for boosting resilience of electricity grids subject to ( N ‐2) contingencies. Here, resilience is computed as the reduction in load shed after the above‐mentioned ( N‐ ) contingencies. TS is a planned line outage, and past research shows that changing the transmission system's topology changes the power flow and removes post contingency violations. Finding the best TS candidate in a computationally suitable time for effectively boosting resilience is a challenge. The best TS candidate is found using a novel heuristic method by decreasing the search space based on proximity to the bus with the maximum load shedding (LSB). The LSB algorithm is faster than existing algorithms in the literature; and, it is compatible with both the AC and DC optimal power flow formulations. To validate the authors' claims of speedup and accuracy, two metrics are used to analyze the results from the IEEE 39‐bus and 118‐bus systems. Finally, the inherent parallelism of the LSB algorithm is leveraged on a high‐performance computing platform and applied to the large‐scale Polish 2383‐bus test system to validate scalability in both size and speedup in computation time.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Flowing plasma rearrangement in the presence of static perturbing fields

Charged particles interacting with electromagnetic waves have a portion of their energy tied up in wave-driven oscillations. When these waves are localized to the exhaust of linear magnetic confinement systems, this ponderomotive effect can be utilized to enhance particle confinement. The same effect can be derived for particles moving via an E×B drift into a region of a static perturbation to the electromagnetic fields which has a large wave vector component in the direction of the motion. In this work, we use a simplified slab model to self-consistently solve for the electromagnetic fields within the fluid flowing plasma of a static flute-like (k∥=0) perturbation and evaluate the resulting ponderomotive potential. We find that two types of perturbations can exist within the flowing plasma, which are an O wave and an X wave in the frame moving with the fluid. In the case of tenuous plasma, these perturbations are magnetostatic or electrostatic multipole-analog perpendicular to the guiding magnetic field in the lab frame, respectfully. For denser plasmas, the O wave-like perturbation is screened at the electron skin depth scale, and the X wave-like perturbation is a combination of a similar perpendicular electric perturbation and parallel magnetic perturbation. The ponderomotive potential generated in the X wave-like case is gyrofrequency-dependent and can be used as either potential barriers or potential wells, depending on the direction of the flow velocity.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

AI-optimized detector design for the future Electron-Ion Collider: the dual-radiator RICH case

Advanced detector R&D requires performing computationally intensive and detailed simulations as part of the detector-design optimization process. Here, we propose a general approach to this process based on Bayesian optimization and machine learning that encodes detector requirements. As a case study, we focus on the design of the dual-radiator Ring Imaging Cherenkov (dRICH) detector under development as a potential component of the particle-identification system at the future Electron-Ion Collider (EIC). The EIC is a US-led frontier accelerator project for nuclear physics, which has been proposed to further explore the structure and interactions of nuclear matter at the scale of sea quarks and gluons. We show that the detector design obtained with our automated and highly parallelized framework outperforms the baseline dRICH design within the assumptions of the current model. Our technique can be applied to any detector R&D, provided that realistic simulations are available.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Preparing sparse solvers for exascale computing

Sparse solvers provide essential functionality for a wide variety of scientific applications. Highly parallel sparse solvers are essential for continuing advances in high-fidelity, multi-physics and multi-scale simulations, especially as we target exascale platforms. This paper describes the challenges, strategies and progress of the US Department of Energy Exascale Computing project towards providing sparse solvers for exascale computing platforms. We address the demands of systems with thousands of high-performance node devices where exposing concurrency, hiding latency and creating alternative algorithms become essential. The efforts described here are works in progress, highlighting current success and upcoming challenges.

97 MATHEMATICS AND COMPUTING↗

HDF5 As a Vehicle for in Transit Data Movement

For in transit processing, one of the fundamental challenges is the efficient movement of data from producers to consumers. Exploiting the flexibility offered by the SENSEI generic in situ framework, we have developed a number of different in transit data transport mechanisms. In this work, we focus on the transport mechanism that leverages the HDF5 parallel I/O library, and investigate the performance characteristics of this transport mechanism. For in transit use cases at scale on HPC platforms, one might expect that an in transit data transport mechanism that uses faster layers of the storage hierarchy, such as DRAM memory, would always outperform a transport that uses slower layers of the storage hierarchy, such as an NVRAM-based persistent storage presented as a distributed file system. However, our test results show that the performance of the transport using NVRAM is competitive with the transport that uses socket-based data movement across varying levels of producer and consumer concurrency.}, booktitle = {Proceedings of the Workshop on In Situ Infrastructures for Enabling Extreme-Scale Analysis and Visualization

Gu, Junmin↗

HydraGNN v3.0

New or improved capabilities included in v3.0 release are as follows: 1. Enhancement in message passing layers through generalization of the class inheritance to enable the inclusion of a broader set of message passing policies Inclusion of equivariant message passing layers from the original implementations of: SchNet (https://pubs.aip.org/aip/jcp/article/148/24/241722/962591/SchNet-A-deep-learning-architecture-for-molecules); DimeNet++ (https://arxiv.org/abs/2011.14115); EGNN models (https://arxiv.org/pdf/2102.09844.pdf) 2. Restructuring of class inheritance for data management 3. Support of DDStore https://github.com/ORNL/DDStore capabilities for improved distributed data parallelism on large volumes of data that cannot fit on intra-node memory capacities 4. Large-scale system support for OLCF-Crusher and OLCF-Frontier

Lupo Pasini, Massimiliano [Oak Ridge National Labo↗

Theoretically and practically efficient parallel nucleus decomposition

This paper studies the nucleus decomposition problem, which has been shown to be useful in finding dense substructures in graphs. We present a novel parallel algorithm that is efficient both in theory and in practice. Our algorithm achieves a work complexity matching the best sequential algorithm while also having low depth (parallel running time), which significantly improves upon the only existing parallel nucleus decomposition algorithm (Sariyüce et al. , PVLDB 2018). The key to the theoretical efficiency of our algorithm is a new lemma that bounds the amount of work done when peeling cliques from the graph, combined with the use of a theoretically-efficient parallel algorithms for clique listing and bucketing. We introduce several new practical optimizations, including a new multi-level hash table structure to store information on cliques space-efficiently and a technique for traversing this structure cache-efficiently. On a 30-core machine with two-way hyper-threading on real-world graphs, we achieve up to a 55x speedup over the state-of-the-art parallel nucleus decomposition algorithm by Sariyüce et al. , and up to a 40x self-relative parallel speedup. We are able to efficiently compute larger nucleus decompositions than prior work on several million-scale graphs for the first time.

Computer Science↗

Refueling Infrastructure Scoping and Feasibility Assessment for Hydrogen Rail Applications

The feasibility and component cost of hydrogen rail refueling infrastructure is examined. Example reference stations can inform future studies on components and systems specifically for hydrogen rail refueling facilities. All of the 5 designs considered assumed the bulk storage of liquid hydrogen on-site, from which either gaseous or liquid hydrogen would be dispensed. The first design was estimated to refuel 10 multiple unit trains per day, each train containing 260 kg of gaseous hydrogen at 350 bar on-board. The second base design targeted the refueling of 50 passenger locomotives, each with 400 kg of gaseous hydrogen on-board at 350 bar. Variations from this basic design were made to consider the effect of two different filling times, two different hydrogen compression methods, and two different station design approaches. For each design variation, components were sized, approximate costs were estimated for major components, and physical layouts were created. For both gaseous hydrogen-dispensing base designs, the design of direct-fill using a cryopump design was the lowest cost due to the high cost of the cascade storage system and gas compressor. The last three base designs all assumed that liquid hydrogen was dispensed into tender cars for freight locomotives that required 7,500 kg of liquid hydrogen, and the three different designs assumed that 5, 50, or 200 tender cars were refueled every day. The total component costs are very different for each design, because each design has a very different dispensing capacity. The total component cost for these three designs are driven by the cost of the liquid hydrogen tank; additionally, delivering that much liquid hydrogen to the refueling facility may not be practical. Many of the designs needed the use of multiple evaporators, compressors, and cryopumps operating in parallel to meet required flow rates. In the future, the components identified here can be improved and scaled-up to better fit the needs of heavy-duty refueling facilities. This study provides basic feasibility and first-order design guidance for hydrogen refueling facilities serving emerging rail applications.

08 HYDROGEN↗

A Computationally Improved Heuristic Algorithm for Transmission Switching Using Line Flow Thresholds for Load Shed Reduction

We present a computationally improved heuristic algorithm for transmission switching (TS) to recover load shed. Research from the past showed that changing power system topology may control power flows and remove line congestion. Hence, TS may reduce the required load shed. One of the main challenges is to find a potential TS candidate in a suitable time. Here, we propose a novel heuristic method that is capable of finding the potential TS candidate faster than existing algorithms in literature. The proposed method is compatible with both the AC and DC optimal power flows (OPF). Three metrics are used to compare the proposed algorithm with the state-of-the-art from literature to show the speedup and accuracy achieved. The proposed method is implemented on the IEEE 30-bus system, PEGASE 89-bus system, IEEE 118-bus system, and Polish 2383- bus system. The results on the large-scale Polish 2383-bus system shows that the proposed algorithm is scalable to large real-world systems. Parallel computing is implemented to further improve the computational performance of the proposed algorithm.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Scaled experiments on cavity confined explosions in limestone and poly(methyl methacrylate)

A scaled experiment comprising a laser-driven explosion in a cavity is used to characterize the coupling of mechanical energy into the surrounding solid material. Experiments are performed using poly(methyl methacrylate) and dry Salem limestone as the explosion containment blocks materials, in which are milled scaled spherical cavities of various dimensions. Measurements of the coupled shock, taken with fiber optic probes at the cavity wall, show the critical radius where wall deformation transitions from plastic to elastic deformation. These measurements also provide a diagnostic of the air blast, which is validated against GEODYN simulation code. The measurement of the coupled shock amplitude taken farther from the wall in the linear region indicates increased coupling efficiency in small cavities over the range of scaled cavity radii from 6 to 20 m/kt 1/3 , a phenomenon not previously observed in experiments. A comparison of results taken in this experiment with a parallel experiment using high explosive (HE) as the source shows that coupled shocks generated with HE are characteristically different with much larger amplitude than those produced by a high energy density laser-driven source with the same yield. This experimental technique potentially provides a rapid and cost-effective method to analyze the consequences of a full-scale, low yield, buried explosion.

58 GEOSCIENCES↗

A year in the life of a parallel file system

I/O performance is a critical aspect of data-intensive scientific computing. We seek to advance the state of the practice in understanding and diagnosing I/O performance issues through investigation of a comprehensive I/O performance data set that captures a full year of production storage activity at two leadership-scale computing facilities. We demonstrate techniques to identify regions of interest, perform focused investigations of both long-term trends and transient anomalies, and uncover the contributing factors that lead to performance fluctuation. We find that a year in the life of a parallel file system is comprised of distinct regions of long-term performance variation in addition to short-term performance transients. We demonstrate how systematic identification of these performance regions, combined with comprehensive analysis, allows us to isolate the factors contributing to different performance maladies at different time scales. From this, we present specific lessons learned and important considerations for HPC storage practitioners.

Lockwood, GK↗

Parallel accelerated Custom Correlation Coefficient calculations for genomics applications

The massive quantities of genomic data being made available through gene sequencing techniques are enabling breakthroughs in genomic science in many areas such as medical advances in the diagnosis and treatment of diseases. Analyzing this data, however, is a computational challenge insofar as the computational costs of the relevant algorithms can grow with quadratic, cubic or higher complexity—leading to the need for leadership scale computing. In this paper we describe a new approach to calculations of the Custom Correlation Coefficient (CCC) between Single Nucleotide Polymorphisms (SNPs) across a population, suitable for parallel systems equipped with graphics processing units (GPUs) or Intel Xeon Phi processors. We describe the mapping of the algorithms to accelerated processors, techniques used for eliminating redundant calculations due to symmetries, and strategies for efficient mapping of the calculations to many-node parallel systems. Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than nine quadrillion (9 × 10 15 ) elementwise comparisons achieved per second with the latest optimized code on the ORNL Titan system, this being orders of magnitude faster than rates achieved using other codes and platforms as reported in the literature. Also it is estimated that as many as 90 quadrillion (90 × 10 15 ) comparisons per second may be achievable on the upcoming ORNL Summit system, an additional 10X performance increase. Finally, in a companion paper we describe corresponding techniques applied to calculations of the Proportional Similarity metric for comparative genomics applications.

97 MATHEMATICS AND COMPUTING↗