Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel cluster”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

HARD: A performance portable radiation hydrodynamics code based on FleCSI framework

Hydrodynamics And Radiation Diffusion (HARD) is an open-source application for high-performance simulations of compressible hydrodynamics with radiation-diffusion coupling. Built on the FleCSI (Bergen et al., 2021 [1]) (Flexible Computational Science Infrastructure) framework, HARD expresses its computational units as tasks whose execution can be orchestrated by multiple back-end runtimes, including Legion (Bauer et al., 2012 [2]), MPI (Forum, 1994 [3]), and HPX (Kaiser et al., 2020 [4]). Node-level parallelism is handled through Kokkos (Edwards et al., 2014 [5]), providing a single-source, portable code base that runs efficiently on laptops, small homogeneous clusters, and the largest heterogeneous supercomputers currently available. To ensure scientific reliability, HARD includes a regression test suite that automatically reproduces canonical verification problems such as the Sod and LeBlanc shock tubes, and the Sedov blast wave, comparing numerical solutions against known analytical results. The project is distributed under an OSI-approved license, hosted on GitHub, and accompanied by reproducible build scripts and continuous integration workflows. This combination of performance portability, verification infrastructure, and community-focused development makes HARD a sustainable platform for advancing radiation hydrodynamics research across multiple domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Two-Stage Gauss-Seidel Preconditioners and Smoothers for Krylov Solvers on a GPU Cluster: Preprint

Gauss-Seidel (GS) relaxation is often employed as a preconditioner for a Krylov solver or as a smoother for Algebraic Multigrid (AMG). However, the requisite sparse triangular solve is difficult to parallelize on many-core architectures such as graphics processing units (GPUs). In the present study, the performance of the sequential GS relaxation based on a triangular solve is compared with two-stage variants, replacing the direct triangular solve with a fixed number of inner Jacobi-Richardson (JR) iterations. When a small number of inner iterations is sufficient to maintain the Krylov convergence rate, the two-stage GS (GS2) often outperforms the sequential algorithm on many-core architectures. The GS2 algorithm is also compared with JR. When they perform the same number of ops for SpMV (e.g. three JR sweeps compared to two GS sweeps with one inner JR sweep), the GS2 iterations, and the Krylov solver preconditioned with GS2, may converge faster than the JR iterations. Moreover, for some problems (e.g. elasticity), it was found that JR may diverge with a damping factor of one, whereas two-stage GS may improve the convergence with more inner iterations. Finally, to study the performance of the two-stage smoother and preconditioner for a practical problem, these were applied to incompressible uid ow simulations on GPUs.

algebraic multigrid↗
DOE OSTI2022

MPLBM-UT: Multiphase LBM library for permeable media analysis

MPLBM-UT is a specialized lattice-Boltzmann library that makes running single- and two-phase flow simulations in porous media accessible to everyone. We provide a suite of tools to pre-process computational domains for simulation, to set up custom boundary conditions, to run simulations, to post-process simulation outputs, and to visualize simulation results and data. All of these tools are easily accessible to users through the mplbm_utils Python package included in and automatically installed with MPLBM-UT. The high-performance, highly parallel library Palabos is used as the solver backend. MPLBM-UT is easily deployed in a variety of systems, from laptops to supercomputer clusters. MPLBM-UT also features multiple examples and benchmark templates that allow for fast prototyping of different porous media problems. We also provide an interface for reading in different file types and downloading domains from the Digital Rocks Portal to perform simulations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Properties of the Graph Modularity Matrix and its Applications

We study the popular modularity matrix and respective functional used in connection with graph clustering and derive some properties useful when performing vertex aggregation of the associated graph. These properties are employed in the derivation of a multilevel parallel pairwise aggregation algorithm. Some illustrative examples which include algebraic multigrid (AMG) coarsening that follows strong direction of anisotropy in finite element problems as well as comparative performance results of the studied algorithm are presented.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Enhancing Entanglement: Non-Markovian and Floquet Reservoir Engineering in Many-Qubit Superconducting Quantum Circuits

This is an experimental and theoretical project to leverage dissipation engineering under non-Markovian settings in order to aid in the preparation and stabilization of large, non-trivial, entangled quantum states. This project is a collaborative effort between the Painter group at Caltech and the Clerk group at the University of Chicago. By utilization of superconducting qubits coupled to the metamaterial waveguide described in the proposal, we tackle this goal via two parallel thrusts: (i) non-Markovian dynamics of a superconducting qubit strongly coupled to a slow-light waveguide reservoir and generation of 2D cluster states and (ii) many-qubit waveguide circuit QED for studying quantum many-body physics. In addition to device development and testing, we are also developing theoretical methods for understanding physics in the deep non-Markovian regime and driven-dissipative protocols for preparing and stabilizing the quantum many-body states.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

PandAna: A Python Analysis Framework for Scalable High Performance Computing in High Energy Physics

Modern experiments in high energy physics analyze millions of events recorded in particle detectors to select the events of interest and make measurements of physics parameters. These data can often be stored as tabular data in files with detector information and reconstructed quantities. Current techniques for event selection in these files lack the scalability needed for high performance computing environments. We describe our work to develop a high energy physics analysis framework suitable for high performance computing. This new framework utilizes modern tools for reading files and implicit data parallelism. Framework users analyze tabular data using standard, easy-to-use data analysis techniques in Python while the framework handles the file manipulations and parallelism without the user needing advanced experience in parallel programming. In future versions, we hope to provide a framework that can be utilized on a personal computer or a high performance computing cluster with little change to the user code.

Groh, Micah↗
DOE OSTI2021

Pore accessibility and trapping of methane in Marcellus shale

Accessibility of pore space in unconventional reservoirs is an important factor influencing both methane storage capacity and the kinetics of methane desorption. The determination of open (accessible) versus closed (inaccessible) porosity is therefore vital for the prediction of gas production potential. This study investigates accessibility of pores to methane in overmature middle Devonian Marcellus shale samples (cut parallel and perpendicular to bedding) using small and ultra-small neutron scattering (SANS and USANS) with contrast matching (CM), supplemented by other complementary techniques, such as mercury injection capillary pressure (MICP) and low pressure gas (N2 and CO2) adsorption. Our results demonstrate that for the samples studied, only about 6 % of pores with diameter 25-500 nm are accessible to methane. The accessibility fraction for pores larger than 500 nm is 35%. For nanopores smaller than 25 nm, pore accessibility could not be quantitatively determined due to increased methane density and condensation effects in confinement. Our observations indicate that methane penetrates the accessible small mesopores and micropores down to at least 1 nm in diameter, and the density of confined deuterated methane (CD4) is 0.68 g/cm3 for pores of diameter 25 nm and gradually increases with the decreased pore size. Moreover, elevated gas pressure causes formation of additional high-density methane nano-clusters. These clusters have a form of slightly anisotropic polydisperse discs oriented along bedding plane, about 1-12 nm in diameter and with average thickness of 3.6 nm. Utilizing samples cut parallel and perpendicular to the bedding, this study also briefly addresses anisotropy of pores. Based on the iso-size intensity ratio R, our SANS and USANS results demonstrate anisotropy in the out-of-bedding direction and suggest that the degree of anisotropy depends on the pore size. Specifically, for pore diameters ~2.5 to 250 nm, the extent of anisotropy is smaller than for pores ~500 nm to 6 µm in diameter. Finally, comparison of pore size distribution results calculated from SANS/USANS to those obtained using MICP shows good agreement at low pressures, but large difference at pressures above 1000 bar. Here, this discrepancy requires further testing; it is possible that the high mercury pressure used in MICP alters the mesopore and micropore structure of shales.

03 NATURAL GAS↗
DOE OSTI2019

Structures of single-layer {beta}-sheet proteins evolved from {beta}-hairpin repeats

Free-standing single-layer beta-sheets are extremely rare in naturally occurring proteins, even though beta-sheet motifs are ubiquitous. Here we report the crystal structures of three homologous, single-layer, anti-parallel beta-sheet proteins, comprised of three or four twisted beta-hairpin repeats. The structures reveal that, in addition to the hydrogen bond network characteristic of beta-sheets, additional hydrophobic interactions mediated by small clusters of residues adjacent to the turns likely play a significant role in the structural stability and compensate for the lack of a compact hydrophobic core. These structures enabled identification of a family of secreted proteins that are broadly distributed in bacteria from the human gut microbiome and are putatively involved in the metabolism of complex carbohydrates. A conserved surface patch, rich in solvent-exposed tyrosine residues, was identified on the concave surface of the beta-sheet. These new modular single-layer beta-sheet proteins may serve as a new model system for studying folding and design of beta-rich proteins.

beta-hairpin repeats↗
DOE OSTI2019

Accelerating DCA++ (Dynamical Cluster Approximation) Scientific Application on the Summit supercomputer

Optimizing scientific applications on today’s accelerator-based high performance computing systems can be challenging, especially when multiple GPUs and CPUs with heterogeneous memories and persistent non-volatile memories are present. An example is Summit, an accelerator-based system at the Oak Ridge Leadership Computing Facility (OLCF) that is rated as the world’s fastest supercomputer to-date. New strategies are thus needed to expose the parallelism in legacy applications, while being amenable to efficient mapping to the underlying architecture.In this paper we discuss our experiences and strategies to port a scientific application, DCA++, to Summit. DCA++ is a highperformance research application that solves quantum manybody problems with a cutting edge quantum cluster algorithm, the dynamical cluster approximation.Our strategies aim to synergize the strengths of the different programming models in the code. These include: (a) streamlining the interactions between the CPU threads and the GPUs, (b) implementing computing kernels on the GPUs and decreasing CPU-GPU memory transfers, (c) allowing asynchronous GPU communications, and (d) increasing compute intensity by combining linear algebraic operations.Full-scale production runs using all 4600 Summit nodes attained a peak performance of 73.5 PFLOPS with a mixed precision implementation.We observed a perfect strong and weak scaling for the quantum Monte Carlo solver in DCA++, while encountering about 2× input/output (I/O) and MPI communication overhead on the time-to-solution for the full machine run. Our hardware agnostic optimizations are designed to alleviate the communication and I/O challenges observed, while improving the compute intensity and obtaining optimal performance on a complex, hybrid architecture like Summit.

Balduzzi, Giovanni↗
DOE OSTI2025

Thermodynamics and collisionality in firehose-susceptible high- β plasmas

We study the evolution of collisionless plasmas that, due to their macroscopic evolution, are susceptible to the firehose instability, using both analytic theory and hybrid-kinetic particle-in-cell simulations. We establish that, depending on the relative magnitude of the plasma β, the characteristic time scale of macroscopic evolution and the ion-Larmor frequency, the saturation of the firehose instability in high-β plasmas can result in three qualitatively distinct thermodynamic (and electromagnetic) states. By contrast with the previously identified ‘ultra-high-beta’ and ‘Alfvén-inhibiting’ states, the newly identified ‘Alfvén-enabling’ state, which is realised when the macroscopic evolution time τ exceeds the ion-Larmor frequency by a β-dependent critical parameter, can support linear Alfvén waves and Alfvénic turbulence because the magnetic tension associated with the plasma’s macroscopic magnetic field is never completely negated by anisotropic pressure forces. We characterise these states in detail, including their saturated magnetic-energy spectra. The effective collision operator associated with the firehose fluctuations is also described; we find it to be well approximated in the Alfvén-enabling state by a simple quasi-linear pitch-angle scattering operator. The box-averaged collision frequency is ν eff ∼ β/τ, in agreement with previous results, but certain subpopulations of particles scatter at a much larger (or smaller) rate depending on their velocity in the direction parallel to the magnetic field. Our findings are essential for understanding low-collisionality astrophysical plasmas including the solar wind, the intracluster medium of galaxy clusters and black hole accretion flows. We show that all three of these plasmas are in the Alfvén-enabling regime of firehose saturation and discuss the implications of this result.

astrophysical plasmas↗
DOE OSTI2026

Function, Structure, and Regulation of Nitrogen Fixation-like Metalloproteins for Nitrogen, Energy, Carbon, and Sulfur Metabolism

Nitrogenases (N 2 ases) and nitrogen fixation-like (NFL) systems play distinct roles in nitrogen, carbon, sulfur, and energy metabolism based on their fundamental differences in structure and metallocofactor identity. As new NFL systems have recently been identified and characterized, striking parallels and differences compared to N 2 ase structure, catalysis, and regulation have emerged. NFL systems use metallocofactors that span from simple [4Fe-4S] clusters to complex clusters akin to FeMo-co, previously only thought to occur in N 2 ase. This review describes the present state of knowledge on the function, structure, catalytic mechanisms, and regulation of NFL systems that perform distinct biological roles across all three domains of life. Recent advancements in N 2 ase spectroscopic techniques for probing metallocofactor structure and electronic states guide current and future work on how each NFL system catalyzes its specific biological reaction(s). Key knowledge gaps and needed areas of research for uncovering the specific metallocofactors and structural motifs that are at the heart of NFL system reaction specificity, along with how these systems are regulated, are discussed.

Bacteria↗
DOE OSTI2023

Accelerating the density-functional tight-binding method using graphical processing units

Acceleration of the density-functional tight-binding (DFTB) method on single and multiple graphical processing units (GPUs) was accomplished using the MAGMA linear algebra library. Herein two major computational bottlenecks of DFTB ground-state calculations were addressed in our implementation: the Hamiltonian matrix diagonalization and the density matrix construction. The code was implemented and benchmarked on two different computer systems: (1) the SUMMIT IBM Power9 supercomputer at the Oak Ridge National Laboratory Leadership Computing Facility with 1–6 NVIDIA Volta V100 GPUs per computer node and (2) an in-house Intel Xeon computer with 1–2 NVIDIA Tesla P100 GPUs. The performance and parallel scalability were measured for three molecular models of 1-, 2-, and 3-dimensional chemical systems, represented by carbon nanotubes, covalent organic frameworks, and water clusters.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

Planetary normal mode computation: Parallel algorithms, performance and reproducibility

This report is an extension of work entitled “Computing planetary interior normal modes with a highly parallel polynomial filtering eigensolver.” by Shi et al., [1] originally presented at the SC18 conference. A highly parallel polynomial filtered eigensolver was developed and exploited to calculate the planetary normal modes. The proposed method is ideally suited for computing interior eigenpairs for large-scale eigenvalue problems as it greatly enhances memory and computational efficiency. In this article, the second-order finite element method is used to further improve the accuracy as only the first-order finite element method was deployed in the previous work. The parallel algorithm, its parallel performance up to 20k processors, and the great computational accuracy are illustrated. The reproducibility of the previous work was successfully performed on the Student Cluster Competition at the SC19 conference by several participant teams using a completely different Mars-model dataset on different clusters. Both weak and strong scaling performances of the reproducibility by the participant teams were impressive and encouraging. The analysis and reflection of their results are demonstrated and future direction is discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Parallel algorithms for hyperdynamics and local hyperdynamics

Hyperdynamics (HD) is a method for accelerating the timescale of standard molecular dynamics (MD). It can be used for simulations of systems with an energy potential landscape that is a collection of basins, separated by barriers, where transitions between basins are infrequent. HD enables the system to escape from a basin more quickly while enabling a statistically accurate renormalization of the simulation time, thus effectively boosting the timescale of the simulation. In [Kim, Perez, Voter, J Chem Phys, 139:144110, 2013)1, a local version of HD was formulated, which exploits the intrinsic locality characteristic typical of most systems to mitigate the poor scaling properties of standard HD as the system size is increased. In this paper, we discuss how both HD and local HD can be formulated to run efficiently in parallel. We have implemented these ideas in the LAMMPS MD code, which means HD can be used with any interatomic potential LAMMPS supports. Together, these parallel methods allow simulations of any size to achieve the time acceleration offered by HD (which can be orders of magnitude), at a cost 3-5x that of standard MD. As examples, we performed two simulations of a million-atom system to model the diffusion and clustering of Pt adatoms on a large patch of Pt(100) surface for 80 and 160 μs.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2019

Quantum Package 2.0: An Open-Source Determinant-Driven Suite of Programs

Quantum chemistry is a discipline which relies heavily on very expensive numerical computations. The scaling of correlated wave function methods lies, in their standard implementation, between O(N-5) and O(e(N)), where N is proportional to the system size. Therefore, performing accurate calculations on chemically meaningful systems requires (i) approximations that can lower the computational scaling and (ii) efficient implementations that take advantage of modern massively parallel architectures. QUANTUM PACKAGE is an open-source programming environment for quantum chemistry specially designed for wave function methods. Its main goal is the development of determinant-driven selected configuration interaction (sCI) methods and multireference second-order perturbation theory (PT2). The determinant-driven framework allows the programmer to include any arbitrary set of determinants in the reference space, hence providing greater methodological freedom. The sCI method implemented in QUANTUM PACKAGE is based on the CIPSI (Configuration Interaction using a Perturbative Selection made Iteratively) algorithm which complements the variational sCI energy with a PT2 correction. Additional external plugins have been recently added to perform calculations with multireference coupled cluster theory and range-separated density-functional theory. All the programs are developed with the IRPF90 code generator, which simplifies collaborative work and the development of new features. QUANTUM PACKAGE strives to allow easy implementation and experimentation of new methods, while making parallel computation as simple and efficient as possible on modern supercomputer architectures. Currently, the code enables, routinely, to realize runs on roughly 2 000 CPU cores, with tens of millions of determinants in the reference space. Moreover, we have been able to push up to 12 288 cores in order to test its parallel efficiency. In the present manuscript, we also introduce some key new developments: (i) a renormalized second-order perturbative correction for efficient extrapolation to the full CI limit and (ii) a stochastic version of the CIPSI selection performed simultaneously to the PT2 calculation at no extra cost.

Garniron, Yann↗
DOE OSTI2024

Streaming Matching and Edge Cover in Practice

Graph algorithms with polynomial space and time requirements often become infeasible for massive graphs with billions of edges or more. State-of-the-art approaches therefore employ approximate serial, parallel, and distributed algorithms to tackle these challenges. However, such approaches require storing the entire graph in memory and thus need access to costly computing resources such as clusters and supercomputers. In this paper, we present practical streaming approaches for solving massive graph problems using limited memory for two prototypical graph problems: maximum weighted matching and minimum weighted edge cover. For matching, we conduct a thorough computational study on two of the semi-streaming algorithms including a recent breakthrough result that achieves a $1/(2+\varepsilon)$-approximation of the weight while using $O( n \log W /\epsilon)$ memory (here $n$ is the number of vertices and $W$ is the maximum edge weight), designed by Paz and Schwartzman [SODA, 2017]. Empirically, we show that the semi-streaming algorithms produce matchings whose weight is close to the best $1/2$-approximate offline algorithm while requiring less time and an order-of-magnitude less memory. For minimum weighted edge cover, we develop three novel semi-streaming algorithms. Two of these algorithms require a single pass through the input graph, require $O(n \log n)$ memory, and provide a 2-approximation guarantee on the objective. We also leverage a relationship between approximate maximum weighted matching and approximate minimum weighted edge cover to develop a two-pass $3/2+\epsilon$-approximate algorithm with the memory requirement of Paz and Schwartzman's semi-streaming matching algorithm. These streaming approaches are compared against the state-of-the-art 3/2-approximate offline algorithm. The semi-streaming matching and the novel edge cover algorithms proposed in this paper can process graphs with several billions of edges in under 30 minutes using 6 GB of memory, which is at least an order of magnitude improvement from the offline (non-streaming) algorithms. For the largest graph, the best alternative offline parallel approximation algorithm (GPA+ROMA) could not finish in three hours even while employing hundreds of processors and 1 TB of memory. We also demonstrate an application of the semi-streaming algorithm by computing a matching using linearly bounded memory on item intersection graphs derived from three machine learning datasets, whereas the existing offline algorithms could not complete on one of these datasets since their memory requirements exceeded 1TB.

Ferdous, S M.↗
DOE OSTI2019

Exploiting the Semidestructive Nature of Gas Cluster Ion Beam Time-of-Flight Secondary Ion Mass Spectrometry Imaging for Simultaneous Localization and Confident Lipid Annotations

Lipids have been considered as key players in cell signaling and disease. Information on their location and distribution within a biological system, under varying conditions, is necessary to understand the contributions of different lipid species to an altered phenotype. Imaging mass spectrometry techniques, such as time-of-flight secondary ion mass spectrometry (ToF-SIMS) and matrix-assisted laser desorption/ionization (MALDI), are capable of revealing global lipid distributions in tissues in an untargeted fashion. Yet, to confidently identify the species present in a sample, orthogonal analyses like tandem MS (MS/MS) are often required. This can be accomplished by bulk sample analysis with liquid chromatography (LC)-MS/MS, which can provide confident lipid identifications, at the expense of losing location-specific information. Here, using planarian flatworms as a model system, we demonstrate that imaging gas cluster ion beam (GCIB)-ToF-SIMS has the unique capability to simultaneously detect, identify, and image lipid species with subcellular resolution in tissue sections. The parallel detection of both, intact lipids and their respective fragments, allows for unique identification of some species without the need of performing an additional orthogonal MS/MS analysis. This was accomplished by correlating intact lipid and associated fragment SIMS images. The lipid assignments, respective fragment identities, and locations gathered from ToF-SIMS data were confirmed via LC-MS/MS on lipid extracts and ultrahigh mass resolution MALDI-MS imaging. Together, these data show that the semidestructive nature of ToF-SIMS can be utilized advantageously to enable both confident molecular annotations and to determine the locations of species within a biological sample.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

GPU acceleration of Swendsen–Wang dynamics

When simulating a lattice system near its critical temperature, local algorithms for modeling the system’s evolution can introduce very large autocorrelation times into sampled data. Here, this critical slowing down places restrictions on the analysis that can be completed in a timely manner of the behavior of systems around the critical point. Because it is often desirable to study such systems around this point, a new algorithm must be introduced. Therefore, we turn to cluster algorithms, such as the Swendsen–Wang algorithm and the Wolff clustering algorithm. They incorporate global updates which generate new lattice configurations with little correlation to previous states, even near the critical point. We look to accelerate the rate at which these algorithm are capable of running by implementing and benchmarking a parallel implementation of each algorithm designed to run on GPUs under NVIDIA’s CUDA framework. A 17 and 90 fold increase in the computational rate was, respectively, experienced when measured against the equivalent algorithm implemented in serial code.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗