Engineering Papers⌕ Search

Engineering topics

Lu, Hao

Publications and source records attributed to Lu, Hao.

At least 37 records · Page 2

Performance Evaluation of Python Based Data Analytics Frameworks in Summit: Early Experiences

The explosion in the volumes of data generated from ever-larger simulation campaigns and experiments or observations necessitates competent tools for data wrangling and analysis). While the Oak Ridge Leadership Computing Facility (OLCF) provides a variety of tools to perform data wrangling and data analysis tasks, Python based tools often lack scalability, or the ability to fully exploit the computational capability of OLCF’s Summit supercomputer. NVIDIA RAPIDS and Dask offer a promising solution to accelerate and distribute data analytics workloads from personal computers to heterogeneous supercomputing systems. We discuss early performance evaluation results of RAPIDS and Dask on Summit to understand their capabilities, scalability, and limitations. Our evaluation includes a subset of RAPIDS libraries, i.e., cuDF, cuML, and cuGraph, and Chainer’s CuPy, and their multi-GPU variants when available.We also draw on the observed trends from the performance evaluation results to discuss best practices for maximizing performance.

Hernandez Arreguin, Benjamin↗

Scalable Knowledge Graph Analytics at 136 Petaflop/s

We are motivated by newly proposed methods for data mining large-scale corpora of scholarly publications, such as the full biomedical literature, which may consist of tens of millions of papers spanning decades of research. In this setting, analysts seek to discover how concepts relate to one another. They construct graph representations from annotated text databases and then formulate the relationship-mining problem as one of computing all-pairs shortest paths (APSP), which becomes a significant bottleneck. In this context, we present a new high-performance algorithm and implementation of the Floyd-Warshall algorithm for distributed-memory parallel computers accelerated by GPUs, which we call DSNAPSHOT (Distributed Accelerated Semiring All-Pairs Shortest Path). For our largest experiments, we ran DSNAPSHOT on a connected input graph with millions of vertices using 4, 096nodes (24,576GPUs) of the Oak Ridge National Laboratory's Summit supercomputer system. We find DSNAPSHOT achieves a sustained performance of 136×1015 floating-point operations per second (136petaflop/s) at a parallel efficiency of 90% under weak scaling and, in absolute speed, 70% of the best possible performance given our computation (in the single-precision tropical semiring or “min-plus” algebra). Looking forward, we believe this novel capability will enable the mining of scholarly knowledge corpora when embedded and integrated into artificial intelligence-driven natural language processing workflows at scale.

Kannan, Ramakrishnan {ramki}↗

Polycation ionic liquid tailored PEO-based solid polymer electrolytes for high temperature lithium metal batteries

Poly(ethylene oxide) (PEO)-based polymer electrolytes are promising candidates for solid-state electrolytes in safer, next generation lithium metal batteries. Despite their benefits however, PEO-based electrolyte exhibits highly crystalline ethylene oxide chains that provide poor ionic conductivity and, thus severely limit its practical application. Here, we report the use of hydroxypropyl trimethylammonium bis(trifluoromethane) sulfonimide chitosan salt (HACC-TFSI), which is an amorphous poly(ionic liquid) based biomass chitosan derivative, as a modifier for PEO-based solid polymer electrolytes (SPEs) to address these deficiencies. Hybrid SPEs with HACC-TFSI display enlarged amorphous regions with enhanced ionic conductivity. Interactions between quaternary ammonium cations and TFSI-anions in hybrid SPEs are also found to promote dissociation between Li + and TFSI - , which further increases ionic mobility. Moreover, the electrochemical stability, mechanical strength, and thermal stability of hybrid SPEs are collectively superior to blank SPEs without HACC-TFSI. LiFePO 4 /SPEs/Li full-cells assembled using 10wt% HACC-TFSI in PEO (10%HACC-TFSI/SPEs) electrolyte provide a capacity of 161.3 mAh g -1 and operate with excellent cycle performances at 0.2 C and 60 C. Finally, even when the temperature is increased to 150 C, LiFePO 4 /SPEs/Li cells with 10%HACC-TFSI/SPEs still display remarkable cycle performance with 73% capacity retention after 100 cycles at 1 C rate.

25 ENERGY STORAGE↗

Size effect on the growth and pulverization behavior of Si nanodomains in SiO anode

Silicon monoxide (SiO) as a promising silicon-based anode electrode of lithium-ion batteries (LIBs) has been the subject of many recent investigations. However, the complex microstructural features of SiO hinder attempts to link the microstructure changes in SiO with its electrochemical performances upon electrochemical cycling. This study employs X-ray pair distribution function (PDF), with a high-resolution transmission electron microscope (HRTEM), to investigate the microstructure of Si nanodomains in SiO and its structural evolution over the electrochemical cycling process. The experiment results reveal the size evolution of Si nanodomains in SiO during the electrochemical cycling and find it highly dependent on the initial Si domain size in SiO. If the initial Si domain size is too large, the average size of Si nanodomains would increase at first and then decrease after a certain number of cycles, which indicates the pulverization of Si domains after the electrochemical-driven growth of Si nanodomains reaches a critical point. Furthermore, these results suggest that an optimal initial Si nanodomain size of 4-6 nm for SiO anode materials is essential to retard the growth and subsequent pulverization process of Si nanodomains and thus to improve the cyclability of SiO during long-term cycling.

25 ENERGY STORAGE↗

An Iron-Decorated Carbon Aerogel for Rechargeable Flow and Flexible Zn–Air Batteries

Mechanically stable and foldable air cathodes with exceptional oxygen reduction reaction (ORR) and oxygen evolution reaction (OER) activities are key components of wearable metal-air batteries. Herein, a directional freeze-casting and annealing approach is reported for the construction of a 3D honeycomb nanostructured, N,P-doped carbon aerogel incorporating in situ grown FeP/Fe 2 O 3 nanoparticles as the cathode in a flexible Zn-air battery (ZAB). The aqueous rechargeable Zn-air batteries assembled with this carbon aerogel exhibit a remarkable specific capacity of 648 mAh g -1 at a current density of 20 mA cm -2 with a good long-term durability, outperforming those assembled with commercial Pt/C+RuO 2 catalyst. Furthermore, such a foldable carbon aerogel with directional channels can serve as a freestanding air cathode for flexible solid-state Zn-air batteries without the use of carbon paper/cloth and additives, giving a specific capacity of 676 mAh g -1 and an energy density of 517 Wh kg -1 at 5 mA cm -2 together with good cycling stability. This work offers a new strategy to design and synthesize highly effective bifunctional air cathodes to be applied in electrochemical energy devices.

25 ENERGY STORAGE↗

Scalable All-pairs Shortest Paths for Huge Graphs on Multi-GPU Clusters

We present an optimized Floyd-Warshall (Floyd-Warshall) algorithm that computes the All-pairs shortest path (APSP) for GPU accelerated clusters. The Floyd-Warshall algorithm due to its structural similarities to matrix-multiplication is well suited for highly parallel GPU architectures. To achieve high parallel efficiency, we address two key algorithmic challenges: reducing high communication overhead and addressing limited GPU memory. To reduce high communication costs, we redesign the parallel (a) to expose more parallelism, (b) aggressively overlap communication and computation with pipelined and asynchronous scheduling of operations, and (c) tailored MPI-collective. To cope with limited GPU memory, we employ an offload model, where the data resides on the host and is transferred to GPU on-demand. The proposed optimizations are supported with detailed performance models for tuning. Our optimized parallel Floyd-Warshall implementation is up to 5x faster than a strong baseline and achieves 8.1 PetaFLOPS/sec on 256~nodes of the Summit supercomputer at Oak Ridge National Laboratory. This performance represents 70% of the theoretical peak and 80% parallel efficiency. The offload algorithm can handle 2.5x larger graphs with a 20% increase in overall running time.

Sao, Piyush↗

A modular apparatus for use in high-precision measurements of parity violation in polarized eV neutron transmission

We describe a modular apparatus for use in parity-violation measurements in epithermal neutron–nucleus resonances with high instantaneous neutron fluxes at the Manuel Lujan Jr. Neutron Scattering Center at Los Alamos National Laboratory. This apparatus is designed to conduct high-precision measurements of the parity-odd transmission asymmetry of longitudinally polarized neutrons through targets containing nuclei with p-wave neutron–nucleus resonances in the 0.1–10 eV energy regime and to accommodate a future search for time reversal violation in polarized neutron transmission through polarized nuclear targets. The apparatus consists of an adjustable neutron and gamma collimation system, a 3 He- 4 He ion chamber neutron flux monitor, two identical cryostats for target cooling, an adiabatic eV-neutron spin flipper, a near-unit efficiency 6 Li- 7 Li scintillation detector operated in current mode, a flexible CAEN data acquisition system, and a neutron spin filter based on spin-exchange optical pumping of 3 He gas. We describe the features of the apparatus design devoted to the suppression of systematic errors in parity-odd asymmetry measurements. We describe the configuration of the apparatus used to conduct a precision measurement of parity violation at the 0.7 eV p-wave resonance in 139 La which employs two identical 139 La targets, one to polarize the beam on the p-wave resonance using the weak interaction and one to analyze the polarization.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Scalable Proximity-Based Methods for Large-Scale Analysis of Atom Probe Data

Powered by recent advances in data acquisition technologies, today's state-of-the-art atom probe microscopes yield data sets with sizes ranging from a few million atoms to billions of atoms. Analysis of these atomic data sets within rea-sonable turnaround times is a pressing data analysis challenge for material scientists currently equipped with software systems that do not scale to these massive data sets. Here, we present the shared memory component of a larger ongoing effort to develop a multi-feature data analysis framework capable of analyzing atom probe data of all sizes and scales from desktop multicore machines to large-scale high-performance computing platforms with hybrid (shared and distributed memory) architectures. Our focus here is on a broad class of popular atom probe data analysis methods that rely on core time-consuming k-NN queries. We present a scalable, heuristic algorithm for k-NN queries using three-dimensional range trees. To demonstrate its efficacy, the k-NN algorithm is integrated with two use cases of atom probe data analysis methods and the resulting analysis times are shown to speedup by over 20X on a 32-core Cray XC40 node using workloads up to 8 million atoms, which is already beyond the at-scale capabilities of existing atom probe software. Using this k-NN algorithm, we also introduce a novel parameter estimation method for a class of cluster finding methods, called friends-of-friends (FoF) methods, to completely bypass their expensive pre-processing steps. In each case, we validate the results on a variety of control data sets.

Lu, Hao↗

Fractal analysis of Mo and Nb effects on grain boundary character and hot cracking behavior for Ni-Cr-Fe alloys

Highlights: • Cross section of the weld with lower RHGB fractal dimension exhibited higher DDC susceptibility than the surface section. • Mo and Nb addition induced tortuous GB character to increase fractal dimension and improve cracking resistance. • GROD maps indicated that the local strain increased within the grains close to RGBs till cracking. • At 1050 °C deformation recrystallized grains nucleated adjacent to DDC and blocked the crack propagation. - Abstract: In this paper, two filler metals of alloy 690 were evaluated on their hot cracking resistance based on the fractal analysis of random high-angle grain boundary (RHGB) morphologies. A grain reference orientation deviation (GROD) map based on EBSD technique was conducted to investigate the polycrystalline strain distribution on different RHGB network. It was found that for the 52M weld metal, specimen from the cross section with straight dendritic GBs exhibited lower fractal dimension, showing higher DDC susceptibility than the specimen from the surface section with higher fractal dimension due to equiaxed grains with tortuous GBs. With Mo and more Nb adding to the filler metal 52MSS, smaller grains nucleated and fractal dimension of the RHGB network increased, thus the cracking resistance was greatly improved. The GROD results revealed that local strain commonly concentrated around RHGB at high temperatures, especially near long and straight RHGB. The dense and tortuous RHGB network, resulting in the higher fractal dimension, could bear a more uniform strain distribution and balance the deformation between GB and grains, leading to better performance on cracking resistance. Moreover, dynamic recrystallized grains were observed beside GBs and their amount increases where there was cracking at 1050 °C, especially for the 52MSS. As a result, crack propagation path was blocked and fractal dimension increased as well.

36 MATERIALS SCIENCE↗

Distributed Louvain Algorithm for Graph Community Detection

In most real-world networks, the nodes/vertices tend to be organized into tightly-knit modules known as communities or clusters, such that nodes within a community are more likely to be “related” to one another than they are to the rest of the network. The goodness of partitioning into communities is typically measured using a well known measure called modularity. However, modularity optimization is an NP-complete problem. In 2008, Blondel, et al. introduced a multi-phase, iterative heuristic for modularity optimization, called the Louvain method. Owing to its speed and ability to yield high quality communities, the Louvain method continues to be one of the most widely used tools for serial community detection. In this paper, we present the design of a distributed memory implementation of the Louvain algorithm for parallel community detection. Our approach begins with an arbitrarily partitioned distributed graph input, and employs several heuristics to speedup the computation of the different steps of the Louvain algorithm. We evaluate our implementation and its different variants using real-world networks from various application domains (including internet, biology, social networks). Our MPI+OpenMP implementation yields about 7x speedup (on 4K processes) for soc-friendster network (1.8B edges) over a state-of-the-art shared-memory multicore implementation (on 64 threads), without compromising output quality. Furthermore, our distributed implementation was able to process a larger graph (uk-2007; 3.3B edges) in 32 seconds on 1K cores (64 nodes) of NERSC Cori, when the state-of-the-art shared-memory implementation failed to run due to insufficient memory on a single Cori node containing 128 GB.

High performance computing, graph algorithms, Dist↗

Efficient, Parallel At-scale Correlation Analysis for Atom Probe Tomography on Hybrid Architectures

Atom probe tomography (APT) is a material probing technique that has undergone dramatic improvements in its capability to map individual atoms within a material sample resulting in data files with hundreds of millions of atoms. Understanding the nano-structural features hidden in these massive amounts of atomic data is a crucial analysis task for materials scientists. However, fast analysis capabilities for large APT workloads remains a critical bottleneck. In this paper, we present the design, implementation and detailed performance evaluations of a parallel software capable of efficiently performing extremely time-consuming correlation analyses of massive high density APT data. Starting with shared memory implementations to motivate our design choices, we extend the implementation to hybrid architectures keeping realistic APT workloads in mind. Detailed performance analyses of three different parallel implementations of the software are supported by empirical results on a Cray XC30 and a Cray XC40 architecture. Its usefulness is demonstrated by reducing the turnaround time of an end-to-end APT correlation analysis on 100 millions atoms by three orders of magnitude using 2048 MPI ranks on 1024 nodes (24 cores per node) of a Cray XC30. The software reported here equips material scientists for the first time with a high-speed scalable capability for efficient and timely analyses of massive APT data.

Lu, Hao↗

Transiting Exoplanet Monitoring Project (TEMP). III. On the Relocation of the Kepler-9 b Transit

The Kepler-9 system harbors three known transiting planets. The system holds significant interest for several reasons. First, the outer two planets exhibit a period ratio that is close to a 2:1 orbital commensurability, with attendant dynamical consequences. Second, both planets lie in the planetary mass "desert" that is generally associated with the rapid gas agglomeration phase of the core accretion process. Third, there exist attractive prospects for accurately measuring both the sky-projected stellar spin-orbit angles as well as the mutual orbital inclination between the planets in the system. Following the original Kepler detection announcement in 2010, the initially reported orbital ephemerides for Kepler-9 b and c have degraded significantly, due to the limited time base-line of observations on which the discovery of the system rested. Here, we report new ground-based photometric observations and extensive dynamical modeling of the system. These efforts allow us to photometrically recover the transit of Kepler-9 b and thereby greatly improve the predictions for upcoming transit mid-times. Accurate ephemerides of this system are important in order to confidently schedule follow-up observations of this system, for both in-transit Doppler measurements as well as for atmospheric transmission spectra taken during transit.

79 ASTRONOMY AND ASTROPHYSICS↗

Spherical Region Queries on Multicore Architectures

In this short paper, we report the performance of multiple thread-parallel algorithms for spherical region queries on multicore architectures motivated by a challenging data analytics application in materials science. Performances of two tree-based algorithms and a naive algorithm are compared to identify the length scales at which these approaches perform optimally. The optimal algorithm is then used to scale the driving materials science application, which is shown to deliver over 17X speedup using 32 OpenMP threads on data sets containing many millions of atoms.

Lu, Hao↗

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↗