Impact of recent COMPASS data on polarized parton distributions and structure functions
Not Available
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
SEARCH · Engineering Papers
Results for “distributed data structures”
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.
A Full-Stack Exploration of Language-Based Parallelism in Fortran 2023
This poster explores native parallel features in Fortran 2023 through the lens of supporting applications with libraries, compilers, and parallel runtimes. The language revision informally named Fortran 2008 introduced parallelism in the form of Single Program Multiple Data (SPMD) execution with two broad feature sets: (1) loop-level parallelism via do concurrent and (2) a Partitioned Global Address Space (PGAS) comprised of distributed “coarray” data structures. Fortran’s native parallelism has demonstrated high performance [1] and reduced the burden of inserting what sometimes amounts to more directives than code. Several compilers support both feature sets, typically by translating do concurrent into serial do loops annotated by parallel directives and by translating SPMD/PGAS features into direct calls to a communication library. Our research focuses primarily on two questions: (1) can the compiler’s parallel runtime library be developed in the language being compiled (Fortran) and (2) can we define an interface to the runtime that liberates compilers from being hardwired to one runtime and vice versa. We are answering these questions by developing the Parallel Runtime Interface for Fortran (PRIF) [2] and the Co-Array Fortran Framework of Efficient Interfaces to Network Environments (Caffeine) [3]. Caffeine is initially targeting adoption by LLVM Flang, a new open-source Fortran compiler developed by a broad community in industry, academia, and government labs. We are also exploring the use of these features in Inference-Engine, a deep learning library designed to facilitate neural network training and inference for high-performance computing applications written in modern Fortran.
Rasmussen, Katherine↗
Influence of Alkyne Precursor Structure on Carbon Nanotube Chiral Distribution: Data-Dense Analysis Across Multiple Catalyst Types
Carbon nanotubes (CNTs) are a desirable material in the field of optoelectronics and semiconductors due to electronic properties (e.g., bandgap) that are dependent upon their chirality, defined by their diameter and lattice angle. Unfortunately, industrial-scale syntheses have yet to realize growth of a single desired chirality and instead rely on postsynthetic separation techniques to refine a chiral mixture, which increases process complexity and cost. Here, we studied the influence of precursor structure on chiral distribution, using a series of terminal alkyne precursors (acetylene, methylacetylene, vinylacetylene, 1-butyne, two enantiomers of 3-butyn-2-ol and a racemic mixture thereof) to grow CNTs across five transition-metal catalysts (Fe, FeMo, and three proportions of CoMo). Multiwavelength Raman spectroscopy on 5,145 spots (5 catalysts, 7 precursors, 3 lasers, and 49 distinct substrate locations on each) determined that acetylene grew the smallest diameter CNTs, while vinylacetylene produced fewer subnanometer CNTs. Though precursor structure did not dictate a uniform chiral shift, it was shown to broaden or narrow chiral distribution, while catalyst structure played a dominant role. In conclusion, this is consistent with metal-precursor binding occurring through unsaturated bonds in the hydrocarbons via the alkyne polymerization mechanism.
Carbon nanotubes↗
Per-page control of physical address space distribution among memory modules
Systems, apparatuses, and methods for implementing per-page control of physical address space distribution among memory modules are disclosed. A computing system includes a plurality of processing units coupled to a plurality of memory modules. A determination is made as to which physical address space distribution granularity to implement for physical memory pages allocated for a first data structure. The determination can be made on a per-data-structure basis (e.g., file, page, block, etc.) or on a per-application-basis. A physical address space distribution granularity is encoded as a property of each physical memory page allocated for the first data structure, and physical memory pages of the first data structure distributed across the plurality of memory modules based on a selected physical address space distribution granularity. Page table entries (PTEs) may be annotated with the selected physical address space distribution granularity, using an addressing mapping granularity (AMG) field of a page table entry, where the granularity may be, for example, a fine-grain distribution granularity or a coarse-grain distribution granularity.
Jayasena, Nuwan S.↗
cuTS: Scaling Subgraph Isomorphism on Distributed Multi-GPUSystems Using Trie Based Data Structure
Subgraph isomorphism is a pattern-matching algorithm widely used in many domains such as chem-informatics, bioinformatics, databases, and social network analysis. It is computationally expensive and is a proven NP-hard problem. The massive parallelism offered by the GPU hardware is well suited for solving the subgraph isomorphism. However, current GPU implementations are far from the achievable performance. Moreover, the enormous memory requirement of current approaches limits the problem size that can be handled. This work analyzes the fundamental challenges associated with processing the subgraph isomorphism on GPUs and develops an efficient GPU hardware-aware implementation. We also develop a new GPU-friendly trie-based data structure to drastically reduce the intermediate storage space requirement. Hence, our approach runs larger benchmarks than the competitors. We also develop the first distributed sub-graph isomorphism algorithm for GPUs. Our experimental evaluation section demonstrates the efficacy of our approach by comparing the execution time and number of cases that we can handle against the state-of-the-art GPU implementations.
Xiang, Lizhi↗
A Parallel Graph Environment for Real-World Data Analytics Workflows
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.
Graph Analytics↗
A Sparse Distributed Gigascale Resolution Material Point Method
In this paper, we present a four-layer distributed simulation system and its adaptation to the Material Point Method (MPM). The system is built upon a performance portable C++ programming model targeting major High-Performance-Computing (HPC) platforms. A key ingredient of our system is a hierarchical block-tile-cell sparse grid data structure that is distributable to an arbitrary number of Message Passing Interface (MPI) ranks. We additionally propose strategies for efficient dynamic load balance optimization to maximize the efficiency of MPI tasks. Our simulation pipeline can easily switch among backend programming models, including OpenMP and CUDA, and can be effortlessly dispatched onto supercomputers and the cloud. Finally, we construct benchmark experiments and ablation studies on supercomputers and consumer workstations in a local network to evaluate the scalability and load balancing criteria. We demonstrate massively parallel, highly scalable, and gigascale resolution MPM simulations of up to 1.01 billion particles for less than 323.25 seconds per frame with 8 OpenSSH-connected workstations.
97 MATHEMATICS AND COMPUTING↗
Deconvolving distribution of relaxation times, resistances and inductance from electrochemical impedance spectroscopy via statistical model selection: Exploiting structural-sparsity regularization and data-driven parameter tuning
The distribution of relaxation times (DRT) has drawn increasing attention for interpreting electrochemical impedance spectroscopy (EIS). Deconvolution of DRT from EIS is a challenging ill-posed problem that requires regularization methods. In this work, we formulate DRT reconstruction task as a statistical model selection problem with structural-sparsity penalties. We utilize the Elastic net regularization that simultaneously benefits from Ridge and Lasso regularizations with optimal tuning parameter automatically determined by the information criteria. We benchmark our approach on four synthetic experiments (a ZARC element, ZARC mixtures, a RC circuit and a Fractal element) and two real EIS datasets of a Lithium ion battery and an organic-inorganic halide class of perovskites in oxygen environment at different gas pressures. We demonstrate the superiority of proposed model selection procedure, that is capable of eliminating pseudo peaks and representing asymmetries in DRT as well as precisely estimating resistances. Here, we highlight our approach is robust to reducing and subsampling EIS frequency range, making it a promising tool for timing-resolved, localized and large scale EIS data analysis. For the Lithium ion battery data analysis, we extend the classical DRT model to incorporate the inductive effect and illustrate DRT as a guidance for equivalent circuit modeling to refine impedance reconstruction at low risks of overfitting. Furthermore, the structural-sparsity regularization could be extended for multidimensional and Bayesian EIS data analysis.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Scaling neural simulations in STACS
Abstract As modern neuroscience tools acquire more details about the brain, the need to move towards biological-scale neural simulations continues to grow. However, effective simulations at scale remain a challenge. Beyond just the tooling required to enable parallel execution, there is also the unique structure of the synaptic interconnectivity, which is globally sparse but has relatively high connection density and non-local interactions per neuron. There are also various practicalities to consider in high performance computing applications, such as the need for serializing neural networks to support potentially long-running simulations that require checkpoint-restart. Although acceleration on neuromorphic hardware is also a possibility, development in this space can be difficult as hardware support tends to vary between platforms and software support for larger scale models also tends to be limited. In this paper, we focus our attention on Simulation Tool for Asynchronous Cortical Streams (STACS), a spiking neural network simulator that leverages the Charm++ parallel programming framework, with the goal of supporting biological-scale simulations as well as interoperability between platforms. Central to these goals is the implementation of scalable data structures suitable for efficiently distributing a network across parallel partitions. Here, we discuss a straightforward extension of a parallel data format with a history of use in graph partitioners, which also serves as a portable intermediate representation for different neuromorphic backends. We perform scaling studies on the Summit supercomputer, examining the capabilities of STACS in terms of network build and storage, partitioning, and execution. We highlight how a suitably partitioned, spatially dependent synaptic structure introduces a communication workload well-suited to the multicast communication supported by Charm++. We evaluate the strong and weak scaling behavior for networks on the order of millions of neurons and billions of synapses, and show that STACS achieves competitive levels of parallel efficiency.
59 BASIC BIOLOGICAL SCIENCES↗
Global distributed file append using log-structured file system
Techniques are provided for globally appending data from a group of distributed processes to a shared file using a log-structured file system. Data generated by a plurality of processes in a parallel computing system are appended to a shared file by storing the data to the shared file using a log-structured file system (such as a Parallel Log-Structured File System (PLFS)); and generating an index entry for the data, the index entry comprising a logical offset entry and a timestamp entry indicating a time of the storage, wherein the logical offset entry is resolved at read time. The logical offset entry can be populated with an append placeholder that is resolved when the shared file is read. At read time, a plurality of the index entries associated with the shared file can be sorted using the timestamp entry to deliver the requested shared file to a requesting application.
97 MATHEMATICS AND COMPUTING↗
Pele: An Exascale-Ready Suite of Combustion Codes
High fidelity simulations of realistic combustion devices are extremely demanding computationally because of the requirements to capture complex fuel chemical decomposition, its intricate interactions with turbulent, often multiphase, flows, and the wide separation of space and time scales between the thin flame and the device boundaries. Software required to carry out such computations tends to be extremely complex, particularly when designed to exploit hardware accelerators, and can be difficult to port and maintain. We present Pele, a performance portable suite of tools for the simulation of combustion systems, including codes to evolve reactive multiphase configurations in the low Mach number and compressible flow regimes, along with a set of inter-compatible post processing and in situ analysis tools. The Pele suite of tools is built on top of the AMReX framework for block-structured adaptive mesh refinement, which provides efficient data structures and algorithms that enable the development of a wide variety of efficient mesh and particle based PDE integration schemes. A hierarchical MPI+X parallelism scheme supports CPU-only and accelerated architectures, where X can be OpenMP, CUDA, and HIP based approaches for intra-node computational work distribution. The algorithms and data structures underlying the Pele simulation and analysis tools are highly scalable and performant across a wide variety of high-performance computing platforms, including DOEs newest exascale-class machines, Frontier and Aurora. The simulation and analysis tools are fully documented and freely distributed as open source via GitHub. We present key algorithmic and software challenges, solution strategies, performance and resulting set of capabilities.
AMReX↗
Uncertainty quantification of machine learning models to improve streamflow prediction under changing climate and environmental conditions
Machine learning (ML) models, and Long Short-Term Memory (LSTM) networks in particular, have demonstrated remarkable performance in streamflow prediction and are increasingly being used by the hydrological research community. However, most of these applications do not include uncertainty quantification (UQ). ML models are data driven and can suffer from large extrapolation errors when applied to changing climate/environmental conditions. UQ is required to quantify the influence of data noises on model predictions and avoid overconfident projections in extrapolation. In this work, we integrate a novel UQ method, called PI3NN, with LSTM networks for streamflow prediction. PI3NN calculates Prediction Intervals by training 3 Neural Networks. It can precisely quantify the predictive uncertainty caused by the data noise and identify out-of-distribution (OOD) data in a non-stationary condition to avoid overconfident predictions. We apply the PI3NN-LSTM method in the snow-dominant East River Watershed in the western US and in the rain-driven Walker Branch Watershed in the southeastern US. Results indicate that for the prediction data which have similar features as the training data, PI3NN precisely quantifies the predictive uncertainty with the desired confidence level; and for the OOD data where the LSTM network fails to make accurate predictions, PI3NN produces a reasonably large uncertainty indicating that the results are not trustworthy and should avoid overconfidence. PI3NN is computationally efficient, robust in performance, and generalizable to various network structures and data with no distributional assumptions. It can be broadly applied in ML-based hydrological simulations for credible prediction.
54 ENVIRONMENTAL SCIENCES↗
lllinois Storage Corridor CarbonSAFE Phase III: Pre-drilling Site Assessment: Prairie State Generating Company
The Illinois Storage Corridor project will drill a stratigraphic test well as part of the Illinois Storage Corridor CarbonSAFE Phase 3 project near the Prairie State Generating Company coal-fired power plant near Marissa, Illinois. The pre-drilling site evaluation has considered the primary target reservoirs, the Potosi Dolomite and St. Peter Sandstone, and primary seal, the Maquoketa Group. Data to be collected from the well include core, fluid samples, in situ well tests, geophysical logs intended to provide information on lithologic, geomechanical, and geophysical characteristics to determine the feasibility for the geologic sequestration of 50 million metric tons or more of injected carbon dioxide. The planned drilling site has been evaluated using available subsurface geologic data and analyses from the Illinois Basin. These data provide lithologic and structural information, shallow groundwater resource distribution, location of known nearby wellbores, and regional drilling characteristics. The data were used to generate geologic structure and isopach maps for the target reservoir and caprock strata and for prognosing the tops of major lithologic units to aid drilling and coring procedures. The regional analyses indicate that no known structural features are expected to negatively impact the target storage reservoir or caprock. No protected and sensitive areas, groundwater resources, or existing resource development are expected to be impacted by the proposed well drilling activities. The well is planned to be drilled to a total depth of approximately 5,600 feet (1,707 m) and terminate in the Precambrian. Cores (up to 5 intervals) will be collected from the Maquoketa Group, confining units above the St. Peter Sandstone, St. Peter Sandstone, confining units of the Potosi Dolomite and the Potosi Dolomite. Water samples will be attempted to be collected from the St. Peter Sandstone and Potosi Dolomite. Potential impact on drilling progress is a lost circulation zone in the Potosi Dolomite, which has been demonstrated to have intermittent cavernous porosity from karstification elsewhere in the Illinois Basin. This document also presents a preliminary coring and sampling program, proposed logging suite, and well testing program, all of which will be reviewed during drilling.
01 COAL, LIGNITE, AND PEAT↗
The ArborX Library: Version 2.0
This article provides an overview of the 2.0 release of the ArborX library, a performance portable geometric search library based on Kokkos. We describe the major changes in ArborX 2.0 including a new interface for the library to support a wider range of user problems, new search data structures (brute force and distributed), support for user functions to be executed on the results (callbacks), and an expanded set of the supported algorithms (ray tracing and clustering).
GPU↗
Dynamic structure of the full-length scaffolding protein NHERF1 influences signaling complex assembly
The Na+/H+ exchange regulatory cofactor 1 (NHERF1) protein modulates the assembly and intracellular trafficking of several transmembrane G protein–coupled receptors (GPCRs) and ion transport proteins with the membrane–cytoskeleton adapter protein ezrin. We applied in this report solution NMR and small-angle neutron scattering (SANS) to structurally characterize full-length NHERF1 and disease-associated variants that are implicated in impaired phosphate homeostasis. Using NMR, we mapped the modular architecture of NHERF1, which is composed of two structurally-independent PDZ domains that are connected by a flexible, disordered linker. We observed that the ultra-long and disordered C-terminal tail of NHERF1 has a type 1 PDZ-binding motif that interacts weakly with the proximal, second PDZ domain to form a dynamically autoinhibited structure. Using ensemble-optimized analysis of SANS data, we extracted the molecular size distribution of structures from the extensive conformational space sampled by the flexible chain. Our results revealed that NHERF1 is a diffuse ensemble of variable PDZ domain configurations and a disordered C-terminal tail. The joint NMR/SANS data analyses of three disease variants (L110V, R153Q, and E225K) revealed significant differences in the local PDZ domain structures and in the global conformations compared with the WT protein. Furthermore, we show that the substitutions affect the affinity and kinetics of NHERF1 binding to ezrin and to a C-terminal peptide from G protein–coupled receptor kinase 6A (GRK6A). Significant insight into the modulation of the intrinsic flexibility of NHERF1 by disease-associated point mutations that alter the dynamic assembly of signaling complexes are provided in this work.
59 BASIC BIOLOGICAL SCIENCES↗
Structure-mining: screening structure models by automated fitting to the atomic pair distribution function over large numbers of models
Explore the source record for details and available documents.
99 GENERAL AND MISCELLANEOUS↗
Total-scattering pair-distribution function analysis of zinc from high-energy synchrotron data
The crystal structure of zinc metal deviates from the ideal hexagonal close packing structure by a significantly increased axial ratio (c/a). The local atomic structure of zinc metal is investigated using the total scattering atomic pair distribution function (PDF) analysis based on X-ray powder diffraction data collected at ambient conditions. The X-ray total scattering PDF analysis confirms that the crystal structure of zinc can be described in terms of wurtzite structure, but with an anomalously atomic displacement parameters U 33 , indicating a significant displacement disorder along the c-axis. For the long r-range PDF refinements, the thermal motion of zinc shows a notable anisotropy as expressed by the ratio U 33 /U 11 of 2.5 at ambient conditions. This average distortion level along the c-axis, was not reflected locally for the features below 5.0 Å as it fits the high r region. Based on PDF refinements over different r-ranges, we measure an interesting increase of the U 33 value with decreasing the r-range of the refinement. Finally, this suggests that the local structure features in zinc metal differ from the average structure ones.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Refining HPCToolkit for application performance analysis at exascale
As part of the US Department of Energy’s Exascale Computing Project (ECP), Rice University has been refining its HPCToolkit performance tools to better support measurement and analysis of applications executing on exascale supercomputers. To efficiently collect performance measurements of GPU-accelerated applications, HPCToolkit employs novel non-blocking data structures to communicate performance measurements between tool threads and application threads. To attribute performance information in detail to source lines, loop nests, and inlined call chains, HPCToolkit performs parallel analysis of large CPU and GPU binaries involved in the execution of an exascale application to rapidly recover mappings between machine instructions and source code. To analyze terabytes of performance measurements gathered during executions at exascale, HPCToolkit employs distributed-memory parallelism, multithreading, sparse data structures, and out-of-core streaming analysis algorithms. To support interactive exploration of profiles up to terabytes in size, HPCToolkit’s hpcviewer graphical user interface uses out-of-core methods to visualize performance data. The result of these efforts is that HPCToolkit now supports collection, analysis, and presentation of profiles and traces of GPU-accelerated applications at exascale. These improvements have enabled HPCToolkit to efficiently measure, analyze and explore terabytes of performance data for executions using as many as 64K MPI ranks and 64K GPU tiles on ORNL’s Frontier supercomputer. HPCToolkit’s support for measurement and analysis of GPU-accelerated applications has been employed to study a collection of open-science applications developed as part of ECP. This paper reports on these experiences, which provided insight into opportunities for tuning applications, strengths and weaknesses of HPCToolkit itself, as well as unexpected behaviors in executions at exascale.
Adhianto, Laksono↗