Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics
This presentation explores parallel computing dynamics and its application in materials science.
SEARCH · Search NASA
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.
This presentation explores parallel computing dynamics and its application in materials science.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
We propose high-order hypergraph walks as a framework to generalize graph-based network science techniques to hypergraphs. Edge incidence in hypergraphs is quantitative, yielding hypergraph walks with both length and width. Graph methods which then generalize to hypergraphs include connected component analyses, graph distance-based metrics such as closeness centrality, and motif-based measures such as clustering coefficients. We apply high-order analogs of these methods to real world hypernetworks, and show they reveal nuanced and interpretable structure that cannot be detected by graph-based methods. Lastly, we apply three generative models to the data and find that basic hypergraph properties, such as density and degree distributions, do not necessarily control these new structural measurements. Our work demonstrates how analyses of hypergraph-structured data are richer when utilizing tools tailored to capture hypergraph-native phenomena, and suggests one possible avenue towards that end.
At the CERN LHC, the task of jet tagging, whose goal is to infer the origin of a jet given a set of final-state particles, is dominated by machine learning methods. Graph neural networks have been used to address this task by treating jets as point clouds with underlying, learnable, edge connections between the particles inside. We explore the decision-making process for one such state-of-the-art network, ParticleNet, by looking for relevant edge connections identified using the layerwise-relevance propagation technique. As the model is trained, we observe changes in the distribution of relevant edges connecting different intermediate clusters of particles, known as subjets. The resulting distribution of subjet connections is different for signal jets originating from top quarks, whose subjets typically correspond to its three decay products, and background jets originating from lighter quarks and gluons. This behavior indicates that the model is using traditional jet substructure observables, such as the number of prongs -- energetic particle clusters -- within a jet, when identifying jets.
In the study of chemical processes, visualizing reaction networks is pivotal for identifying crucial compounds and transformations. Traditional methods, such as network schematics and reaction path linear plots, often struggle to effectively represent complex reaction networks due to their size and intricate connectivity. Alternatives capable of leading with complexity include graph methods, but they are not user-friendly, lacking simplicity and modularity, which hinders their integration with widely-used research software. This work introduces rNets an innovative tool designed for the efficient visualization of reaction networks with a user-friendly interface, modularity, and seamless integration with existing software packages. The effectiveness of rNets is demonstrated through its application in analyzing three catalytic reactions, showcasing its potential to significantly enhance research both in homogeneous and heterogeneous catalysis fields. This tool not only simplifies the visualization process but also opens new avenues for exploring complex reaction networks in diverse research contexts.
Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.
A new method is presented for obtaining network functions in which some, none, or all of the network elements are represented by symbolic parameters (i.e., symbolic network functions). Unlike the topological tree enumeration or signal flow graph methods generally used to derive symbolic network functions, the proposed procedure employs fast, efficient, numerical-type algorithms to determine the contribution of those network branches that are not represented by symbolic parameters. A computer program called NAPPE (for Network Analysis Program using Parameter Extractions) and incorporating all of the concepts discussed has been written. Several examples illustrating the usefulness and efficiency of NAPPE are presented.
The scalability of unstructured mesh based applications depends on partitioning methods that quickly balance the computational work while reducing communication costs. Zhou et al. [SIAM J. Sci. Comput., 32 (2010), pp. 3201{3227; J. Supercomput., 59 (2012), pp. 1218{1228] demonstrated the combination of (hyper)graph methods with vertex and element partition improvement for PHASTA CFD scaling to hundreds of thousands of processes. Our work generalizes partition improvement to support balancing combinations of all the mesh entity dimensions (vertices, edges, faces, regions) in partitions with imbalances exceeding 70%. Improvement results are then presented for multiple entity dimensions on up to one million processes on meshes with over 12 billion tetrahedral elements.
Economic competitiveness and national security depend increasingly on the insightful analysis of large data sets. The diversity of real-world data sources and analytic workflows impose challenging hardware and software requirements for parallel graph platforms. The irregular nature of graph methods is not supported well by the deep memory hierarchies of conventional distributed systems, requiring new processor and runtime system designs to tolerate memory and synchronization latencies. Moreover, the efficiency of relational table operations and matrix computations are not attainable when data is stored in common graph data structures. In this paper, we present HAGGLE, a high-performance, scalable data analytics platform. The platform’s hybrid data model supports a variety of distributed, thread-safe data structures, parallel programming constructs, and persistent and streaming data. An abstract runtime layer enables us to map the stack to conventional, distributed computer systems with accelerators. The runtime uses multithreading, active messages, and data aggregation to hide memory and synchronization latencies on large-scale systems.
Simple practical approach to estimate thermodynamic properties of strongly coupled Yukawa systems, in both fluid and solid phases, is presented. The accuracy of the approach is tested by extensive comparison with direct computer simulation results (for fluids and solids) and the recently proposed shortest-graph method (for solids). Possible applications to other systems of softly repulsive particles are briefly discussed.
Abstract We present a benchmark test suite and an automated machine learning procedure for evaluating supervised machine learning (ML) models for predicting properties of inorganic bulk materials. The test suite, Matbench, is a set of 13 ML tasks that range in size from 312 to 132k samples and contain data from 10 density functional theory-derived and experimental sources. Tasks include predicting optical, thermal, electronic, thermodynamic, tensile, and elastic properties given a material’s composition and/or crystal structure. The reference algorithm, Automatminer, is a highly-extensible, fully automated ML pipeline for predicting materials properties from materials primitives (such as composition and crystal structure) without user intervention or hyperparameter tuning. We test Automatminer on the Matbench test suite and compare its predictive power with state-of-the-art crystal graph neural networks and a traditional descriptor-based Random Forest model. We find Automatminer achieves the best performance on 8 of 13 tasks in the benchmark. We also show our test suite is capable of exposing predictive advantages of each algorithm—namely, that crystal graph methods appear to outperform traditional machine learning methods given ~10 4 or greater data points. We encourage evaluating materials ML algorithms on the Matbench benchmark and comparing them against the latest version of Automatminer.
The Intergovernmental Panel on Climate Change (IPCC) has reported that in the southeastern US and eastern China, the general greenhouse warming due to anthropogenic gaseous emissions is dominated by the cooling effect of anthropogenic aerosols. To verify this model prediction in eastern China and southeastern US, we analyzed regional patterns of climate changes at 72 stations in eastern China during 1951- 94 (44 years), and at 52 stations in the southeastern US during 1949-94 (46 years) to detect the fingerprint of aerosol radiative forcing. It was found that the mean rates of change of annual mean daily, maximum, minimum temperatures and diurnal temperature range (DTR) in eastern China were 0.8, -0.2, 1.8, and -2.0 C/100 years respectively, while the mean rates of change of annual mean daily, maximum, minimum temperatures and DTR in the southeastern US were -0.2, -0.6, 0.2, and -0.8 C/100 years, respectively. This indicates that the high rate of increase in annual mean minimum temperature in eastern China results in a slightly warming trend of daily temperature, while the high rate of decrease in annual mean maximum temperature and low rate of increase in annual mean minimum temperature lead to the cooling trend of daily temperature in the southeastern US. We found that the warming from the longwave forcing due to both greenhouse gases and aerosols was completely counteracted by the shortwave aerosol forcing in the southeastern US in the past 46 years. A slightly overall warming trend in eastern China is evident; winters have become milder. This finding is explained by hypothesizing that increasing energy usage during the past 44 years has resulted in more coal and biomass burning, thus increasing the emission of absorbing soot and organic aerosols in eastern China. Such emissions, in addition to well-known Asia dust and greenhouse gases, may be responsible for the winter warming trend in eastern China that we have reported here. The sensitivity of aerosol radiative properties to aerosol composition, size distribution, relative humidity (RH) is examined for the following aerosol systems: inorganic and organic ions (Cl-, Br-, NO3 -, SO4 2-, Na+, NH4 +, K+, Ca2+, Mg2+, HCOO-, CH3COO-, CH3CH2COO-, CH3COCOO-, OOCCOO2-, MSA-1); water-insoluble inorganic and organic compounds (elemental carbon, n-alkanes, SiO2, Al2O3, Fe2O3 and other organic compounds). The partial molar refraction method was used to calculate the real part of the refractive index. It was found that the asymmetry factor increased by approximately 48% with the real part varying from 1.40 to 1.65, and the single scattering albedo decreased by 24% with the imaginary part varying from -0.005 to -0.1. The asymmetry factor increased by 5.4 times with the geometric standard deviation varying from 1.2 to 3.0. The radiation transmission is very sensitive to the change in size distribution; other factors are not as significant. To determine the aerosol direct radiative forcing (ADRF), the aerosol optical depth (AOD) values at the three operational wavelengths (415, 500 and 673 nm) were determined at a regionally representative site, namely, Mt. Gibbs (35.78 deg N, 82.29 deg W, elevation 2006 m) in Mt. Mitchell State Park, NC, and a site located in an adjacent valley (Black Mountain, 35.66 deg N, 82.38 deg W, elevation 951 m) in the southeastern US. The two sites are separated horizontally by 10 km and vertically by 1 km. It was found that the representative total AOD values at 500 nm at the valley site for highly polluted (HP), marine (M) and continental (C) air masses were 0.68 +/- 0.33, 0.29 +/- 0.19 and 0.10 +/- 0.04, respectively. A search-graph method was used to retrieve the columnar size distribution (number concentration N, effective radius reff and geometric standard deviation=?g) from the optical depth observations at three operational wavelengths. The ground albedo, single scattering albedo and imaginary part of the refractive index were calculated using a mathematically unique procedure involving a Mie code and a radiative transfer code in conjunction with the retrieved aerosol size distribution, AOD, and diffuse-direct irradiance ratio. It was found that N, r(eff) and sigma(g) were in the ranges of 10 to 1.7 x 10(exp 4)/cubic cm, 0.09 to 0.68 micrometers and 1.12 to 2.95, respectively. The asymmetry factor and single scattering albedo were in the ranges of 0.63 to 0.75 and 0.74 to 0.97 respectively. The ground albedo for the forested terrain and imaginary part of refractive index were found to be in the ranges of 0.06 to 0.29 and 0.005 to 0.051 respectively. On the basis of these aerosol radiative properties obtained at the research sites and computations using the Column Radiation Model (CRM) of National Center of Atmospheric Research (NCAR) Community Climate Model (CCM3), it was found that the average cloud-free 24-hour ADRF values were -13 +/- 8, -8 +/- 3, -33 +/- 16 W/square m for marine, continental, and polluted air masses, respectively. On the assumption that the fractional coverage of clouds is 0.61, it was estimated that the annual mean ADRF was 7 +/- 2 W/square m in the southeastern US. The review with respect to the current knowledge of organic acids shows that aerosol formate and acetate concentrations range from 0.02 to 5.3 nmol/cubic m and from 0.03 to 12.4 nmol/cubic m respectively, and that between 34% to 77% of formate and between 21% to 66% of acetate are present in the fine fraction of aerosols. It was found that although most (98-99%) of these volatile organic acids were present in the gas phase, their concentrations in the aerosol particles were sufficient to make them a good candidate for cloud condensation nuclei (CCN). It is hypothesized that organic acids are at least one of the primary sources of CCN in the atmosphere due to their ubiquitous presence in the troposphere, especially over the continental forested areas. The results of our measurements at Palmer Station, Antarctica show that the daily average CCN concentrations at 0.3% and 1% supersaturations ranged from 0.3 to 160/cubic cm and from 4 to 168/cubic cm, respectively, during the period from 17 January to 26 February, 1994. New evidence for substantial and definitive CCN enhancement near and within cloud has been observed at Mt. Mitchell, North Carolina. The results show that the average monthly CCN concentrations were 460 +/- 217, 386 +/- 286, 429 +/- 228 and 238 +/- 134/cubic cm for in-cloud, overcast, clear and rainy conditions, respectively. The typical CCN spectra show that there were a lot of small CCN produced and the ion concentrations (especially H+ and SO4 2-) were very high during the CCN enhancement period. The significantly positive correlation between black carbon (BC) and CCN at 1% supersaturation indicates that a percentage of the BC measured at the site may be in the form of an internal mixture and participated in the formation of CCN.
Aortic aneurysm segmentation remains a challenge. Manual segmentation is a time-consuming process which is not practical for routine use. To address this limitation, several automated segmentation techniques for aortic aneurysm have been developed, such as edge detection-based methods, partial differential equation methods, and graph partitioning methods. However, automatic segmentation of aortic aneurysm is difficult due to high pixel similarity to adjacent tissue and a lack of color information in the medical image, preventing previous work from being applicable to difficult cases. This paper uses uses a variable neighborhood search that alternates between intensity-based and gradient-based segmentation techniques. By alternating between intensity and gradient spaces, the search can escape from local optima of each space. The experimental results demonstrate that the proposed method outperforms the other existing segmentation methods in the literature, based on measurements of dice similarity coefficient and jaccard similarity coefficient at the pixel level. In addition, it is shown to perform well for cases that are difficult to segment.
An experimental research program providing basic knowledge and establishing a database on the fluctuating pressure loads produced on aerodynamic surfaces beneath three dimensional shock wave/boundary layer interactions is described. Such loads constitute a fundamental problem of critical concern to future supersonic and hypersonic flight vehicles. A turbulent boundary layer on a flat plate is subjected to interactions with swept planar shock waves generated by sharp fins at angle of attack. Fin angles from 10 to 20 deg at freestream Mach numbers of 3 and 4 produce a variety of interaction strengths from weak to very strong. Miniature Kulite pressure transducers flush-mounted in the flat plate are used to measure interaction-induced wall pressure fluctuations. The distributions of properties of the pressure fluctuations, such as their ring levels, amplitude distributions, and power spectra, are also determined. Measurements were made for the first time in the aft regions of these interactions, revealing fluctuating pressure levels as high as 160 dB. These fluctuations are dominated by low frequency (0-5 kHz) signals. The maximum ring levels in the interactions show an increasing trend with increasing interaction strength. On the other hand, the maximum ring levels in the forward portion of the interactions decrease linearly with increasing interaction sweep back. These ring pressure distributions and spectra are correlated with the features of the interaction flowfield. The unsteadiness of the off-surface flowfield is studied using a new, non-intrusive technique based on the shadow graph method. The results indicate that the entire lambda-shock structure generated by the interaction undergoes relatively low-frequency oscillations. Some regions where particularly strong fluctuations are generated were identified. Fluctuating pressure measurements are also made along the line of symmetry of an axisymmetric jet impinging upon a flat plate at an angle. This flow was chosen as a simple analog to the impinging jet region found in the rear portion of the shock wave/boundary layer interactions under study. It is found that a sharp peak in ring pressure level exists at or near the mean stagnation point. It is suggested that the phenomena responsible for this peak may be active in the swept interactions as well, and may cause the extremely high fluctuating pressures observed in the impinging jet region in the present experimental program.
A viewgraph presentation on centrifuge rotor models with a comparison using Euler-Lagrange and bond graph methods is shown. The topics include: 1) Objectives; 2) MOdeling Approach Comparisons; 3) Model Structures; and 4) Application.
RDF databases have emerged as one of the most relevant way for organizing, integrating, and managing expo- nentially growing, often heterogeneous, and not rigidly structured data for a variety of scientific and commercial fields. In this paper we discuss the solutions integrated in GEMS (Graph database Engine for Multithreaded Systems), a software framework for implementing RDF databases on commodity, distributed-memory high-performance clusters. Unlike the majority of current RDF databases, GEMS has been designed from the ground up to primarily employ graph-based methods. This is reflected in all the layers of its stack. The GEMS framework is composed of: a SPARQL-to-C++ compiler, a library of data structures and related methods to access and modify them, and a custom runtime providing lightweight software multithreading, network messages aggregation and a partitioned global address space. We provide an overview of the framework, detailing its component and how they have been closely designed and customized to address issues of graph methods applied to large-scale datasets on clusters. We discuss in details the principles that enable automatic translation of the queries (expressed in SPARQL, the query language of choice for RDF databases) to graph methods, and identify differences with respect to other RDF databases.
An apparatus and a method for vulnerability and reliability modeling are provided. The method generally includes constructing a graph model of a physical network using a computer, the graph model including a plurality of terminating vertices to represent nodes in the physical network, a plurality of edges to represent transmission paths in the physical network, and a non-terminating vertex to represent a non-nodal vulnerability along a transmission path in the physical network. The method additionally includes evaluating the vulnerability and reliability of the physical network using the constructed graph model, wherein the vulnerability and reliability evaluation includes a determination of whether each terminating and non-terminating vertex represents a critical point of failure. The method can be utilized to evaluate wide variety of networks, including power grid infrastructures, communication network topologies, and fluid distribution systems.