Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Supercomputer”

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 1,351 records · Page 75

The OSG Open Facility: an on-ramp for opportunistic scientific computing

The Open Science Grid (OSG) is a large, robust computing grid that started primarily as a collection of sites associated with large HEP experiments such as ATLAS, CDF, CMS, and DZero, but has evolved in recent years to a much larger user and resource platform. In addition to meeting the US LHC community’s computational needs, the OSG continues to be one of the largest providers of distributed high-throughput computing (DHTC) to researchers from a wide variety of disciplines via the OSG Open Facility. The Open Facility consists of OSG resources that are available opportunistically to users other than resource owners and their collaborators. In the past two years, the Open Facility has doubled its annual throughput to over 200 million wall hours. More than half of these resources are used by over 100 individual researchers from over 60 institutions in fields such as biology, medicine, math, economics, and many others. Over 10% of these individual users utilized in excess of 1 million computational hours each in the past year. The largest source of these cycles is temporary unused capacity at institutions affiliated with US LHC computational sites. An increasing fraction, however, comes from university HPC clusters and large national infrastructure supercomputers offering unused capacity. Such expansions have allowed the OSG to provide ample computational resources to both individual researchers and small groups as well as sizable international science collaborations such as LIGO, AMS, IceCube, and sPHENIX. Opening up access to the Fermilab FabrIc for Frontier Experiments (FIFE) project has also allowed experiments such as mu2e and NOvA to make substantial use of Open Facility resources, the former with over 40 million wall hours in a year. We present how this expansion was accomplished as well as future plans for keeping the OSG Open Facility at the forefront of enabling scientific research by way of DHTC.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Precision searches in dijets at the HL-LHC and HE-LHC

This paper explores the physics reach of the High-Luminosity Large Hadron Collider (HL-LHC) for searches of new particles decaying to two jets. We discuss inclusive searches in dijets and b-jets, as well as searches in semi-inclusive events by requiring an additional lepton that increases sensitivity to different aspects of the underlying processes. We discuss the expected exclusion limits for generic models predicting new massive particles that result in resonant structures in the dijet mass. Prospects of the Higher-Energy LHC (HE-LHC) collider are also discussed. The study is based on the Pythia8 Monte Carlo generator using representative event statistics for the HL-LHC and HE-LHC running conditions. The event samples were created using supercomputers at NERSC.

dijets jets LHC HE-LHC HL-LHC↗

Simulations of future particle accelerators: issues and mitigations

The ever increasing demands placed upon machine performance have resulted in the need for more comprehensive particle accelerator modeling. Computer simulations are key to the success of particle accelerators. Many aspects of particle accelerators rely on computer modeling at some point, sometimes requiring complex simulation tools and massively parallel supercomputing. Examples include the modeling of beams at extreme intensities and densities (toward the quantum degeneracy limit), and with ultra-fine control (down to the level of individual particles). In the future, adaptively tuned models might also be relied upon to provide beam measurements beyond the resolution of existing diagnostics. Much time and effort has been put into creating accelerator software tools, some of which are highly successful. However, there are also shortcomings such as the general inability of existing software to be easily modified to meet changing simulation needs. In this paper possible mitigating strategies are discussed for issues faced by the accelerator community as it endeavors to produce better and more comprehensive modeling tools. This includes lack of coordination between code developers, lack of standards to make codes portable and/or reusable, lack of documentation, among others.

43 PARTICLE ACCELERATORS↗

GLOBAL NON-SPHERICAL OSCILLATIONS IN THREE-DIMENSIONAL 4π SIMULATIONS OF THE H-INGESTION FLASH

We performed three-dimensional simulations of proton-rich material entrainment into {sup 12}C-rich He-shell flash convection and the subsequent H-ingestion flash that took place in the post-asymptotic giant branch star Sakurai's object. Observations of the transient nature and anomalous abundance features are available to validate our method and assumptions, with the aim of applying them to very low-metallicity stars in the future. We include nuclear energy feedback from H burning and cover the full 4π geometry of the shell. Runs on 768{sup 3} and 1536{sup 3} grids agree well with each other and have been followed for 1500 minutes and 1200 minutes. After an 850 minute long quiescent entrainment phase, the simulations enter into a global non-spherical oscillation that is launched and sustained by individual ignition events of H-rich fluid pockets. Fast circumferential flows collide at the antipode and cause the formation and localized ignition of the next H-overabundant pocket. The cycle repeats for more than a dozen times while its amplitude decreases. During the global oscillation, the entrainment rate increases temporarily by a factor of ≈100. Entrained entropy quenches convective motions in the upper layer until the burning of entrained H establishes a separate convection zone. The lower-resolution run hints at the possibility that another global oscillation, perhaps even more violent, will follow. The location of the H-burning convection zone agrees with a one-dimensional model in which the mixing efficiency is calibrated to reproduce the light curve. The simulations have been performed at the NSF Blue Waters supercomputer at NCSA.

79 ASTRONOMY AND ASTROPHYSICS↗

PRECIPITATION-REGULATED STAR FORMATION IN GALAXIES

Galaxy growth depends critically on the interplay between radiative cooling of cosmic gas and the resulting energetic feedback that cooling triggers. This interplay has proven exceedingly difficult to model, even with large supercomputer simulations, because of its complexity. Nevertheless, real galaxies are observed to obey simple scaling relations among their primary observable characteristics. Here we show that a generic emergent property of the interplay between cooling and feedback can explain the observed scaling relationships between a galaxy's stellar mass, its total mass, and its chemical enrichment level, as well as the relationship between the average orbital velocity of its stars and the mass of its central black hole. These relationships naturally result from any feedback mechanism that strongly heats a galaxy's circumgalactic gas in response to precipitation of colder clouds out of that gas, because feedback then suspends the gas in a marginally precipitating state.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

SAIGE-GPU: accelerating genome- and phenome-wide association studies using GPUs

Genome-wide association studies (GWAS) at biobank scale are computationally intensive, especially for admixed populations requiring robust statistical models. SAIGE is a widely used method for generalized linear mixed-model GWAS but is limited by its CPU-based implementation, making phenome-wide association studies impractical for many research groups. We developed SAIGE-GPU, a GPU-accelerated version of SAIGE that replaces CPU-intensive matrix operations with GPU-optimized kernels. The core innovation is distributing genetic relationship matrix calculations across GPUs and communication layers. Applied to 2068 phenotypes from 635 969 participants in the Million Veteran Program, including diverse and admixed populations, SAIGE-GPU achieved a 5-fold speedup in mixed model fitting on supercomputing infrastructure and cloud platforms. We further optimized the variant association testing step through multi-core and multi-trait parallelization. Deployed on Google Cloud Platform and Azure, the method provided substantial cost and time savings. Source code and binaries are available for download at https://github.com/saigegit/SAIGE/tree/SAIGE-GPU-1.3.3. A code snapshot is archived at Zenodo for reproducibility (DOI: [10.5281/zenodo.17642591]). SAIGE-GPU is available in a containerized format for use across HPC and cloud environments and is implemented in R/C++ and runs on Linux systems.

Rodriguez, Alex [Argonne National Laboratory (ANL)↗

Sipros Ensemble improves database searching and filtering for complex metaproteomics

Complex microbial communities can be characterized by metagenomics and metaproteomics. However, metagenome assemblies often generate enormous, and yet incomplete, protein databases, which undermines the identification of peptides and proteins in metaproteomics. This challenge calls for increased discrimination of true identifications from false identifications by database searching and filtering algorithms in metaproteomics. Sipros Ensemble was developed here for metaproteomics using an ensemble approach. Three diverse scoring functions from MyriMatch, Comet and the original Sipros were incorporated within a single database searching engine. Supervised classification with logistic regression was used to filter database searching results. Benchmarking with soil and marine microbial communities demonstrated a higher number of peptide and protein identifications by Sipros Ensemble than MyriMatch/Percolator, Comet/Percolator, MS-GF+/Percolator, Comet & MyriMatch/iProphet and Comet & MyriMatch & MS-GF+/iProphet. Sipros Ensemble was computationally efficient and scalable on supercomputers. Freely available under the GNU GPL license at http://sipros.omicsbio.org.

59 BASIC BIOLOGICAL SCIENCES↗

Towards Autonomous Experiments by Connecting High Performance Microscopy with High Performance Computing

The digitization of controls, data, and analysis in microscopy is bringing the idea of autonomous microscopes closer to reality than ever before. Automated transmission electron microscopy (TEM) is already fairly routine for some experiments the only require simple repetitive tasks such as imaging biological macromolecules for single particle cryoEM [1], tilt series for electron tomography [2], and movies for crystallography [3]. The vast majority of TEM experiments are conducted completely by human operators who choose the regions of interest, optimize experimental parameters, and make decisions about data quality visually during an experiment. The field is still a long way from having completely autonomous TEMs that can adapt to sample difficulties and tune experimental parameters based on data quality and desired experimental outcomes. Part of the issue is the lack of capability for feeding information learned from on-line, live data analysis back into the on-going experiment [4]. Furthermore, this presentation will discuss current capabilities for large scale data reduction and analysis using high performance computing (i.e. supercomputing) and progress towards developing a true feed-back loop that places data analysis and theory in the experimental loop.

97 MATHEMATICS AND COMPUTING↗

The ABACUS cosmological N -body code

We present abacus, a fast and accurate cosmological N-body code based on a new method for calculating the gravitational potential from a static multipole mesh. The method analytically separates the near- and far-field forces, reducing the former to direct 1/r 2 summation and the latter to a discrete convolution over multipoles. The method achieves 70 million particle updates per second per node of the Summit supercomputer, while maintaining a median fractional force error of 10 -5 . We express the simulation time-step as an event-driven ‘pipeline’, incorporating asynchronous events such as completion of co-processor work, input/output, and network communication. abacus has been used to produce the largest suite of N-body simulations to date, the abacussummit suite of 60 trillion particles, incorporating on-the-fly halo finding. abacus enables the production of mock catalogues of the volume and resolution required by the coming generation of cosmological surveys.

79 ASTRONOMY AND ASTROPHYSICS↗

ABACUSSUMMIT : a massive set of high-accuracy, high-resolution N -body simulations

We present the public data release of the AbacusSummit cosmological N-body simulation suite, produced with the Abacus N-body code on the Summit supercomputer of the Oak Ridge Leadership Computing Facility. Abacus achieves $\mathcal {O}(10^{-5})$ median fractional force error at superlative speeds, calculating 70M particle updates per second per node at early times, and 45M particle updates per second per node at late times. The simulation suite totals roughly 60 trillion particles, the core of which is a set of 139 simulations with particle mass $2\times 10^{9}\, h^{-1}\, \mathrm{M}_\odot$ in box size $2\, h^{-1}\, \mathrm{Gpc}$. The suite spans 97 cosmological models, including Planck 2018, previous flagship simulation cosmologies, and a linear derivative and cosmic emulator grid. A subsuite of 1883 boxes of size $500\, h^{-1}\, \mathrm{Mpc}$ is available for covariance estimation. AbacusSummit data products span 33 epochs from z = 8 to 0.1 and include light cones, full particle snapshots, halo catalogues, and particle subsets sampled consistently across redshift. AbacusSummit is the largest high-accuracy cosmological N-body data set produced to date.

79 ASTRONOMY AND ASTROPHYSICS↗

Cosmic Dawn (CoDa): the first radiation-hydrodynamics simulation of reionization and galaxy formation in the Local Universe

Cosmic reionization by starlight from early galaxies affected their evolution, thereby impacting reionization itself. Star formation suppression, for example, may explain the observed underabundance of Local Group dwarfs relative to N-body predictions for cold dark matter. Reionization modelling requires simulating volumes large enough [~ (100 Mpc) 3 ] to sample reionization ‘patchiness’, while resolving millions of galaxy sources above ~10 8 M ⊙ combining gravitational and gas dynamics with radiative transfer. Modelling the Local Group requires initial cosmological density fluctuations pre-selected to form the well-known structures of the Local Universe today. Cosmic Dawn (‘CoDa’) is the first such fully coupled, radiation-hydrodynamics simulation of reionization of the Local Universe. Our new hybrid CPU-GPU code, RAMSES-CUDATON, performs hundreds of radiative transfer and ionization rate-solver timesteps on the GPUs for each hydro-gravity timestep on the CPUs. CoDa simulated (91Mpc) 3 with 4096 3 particles and cells, to redshift 4.23, on ORNL supercomputer Titan, utilizing 8192 cores and 8192 GPUs. Global reionization ended slightly later than observed. However, a simple temporal rescaling which brings the evolution of ionized fraction into agreement with observations also reconciles ionizing flux density, cosmic star formation history, CMB electron scattering optical depth and galaxy UV luminosity function with their observed values. Photoionization heating suppressed the star formation of haloes below ~2 × 109 M ⊙ , decreasing the abundance of faint galaxies around M AB1600 = [-10, -12]. For most of reionization, star formation was dominated by haloes between 10 10 –10 11 M ⊙ , so low-mass halo suppression was not reflected by a distinct feature in the global star formation history. Intergalactic filaments display sheathed structures, with hot envelopes surrounding cooler cores, but do not self-shield, unlike regions denser than 100 $\langle$ρ$\rangle$.

Astronomy & Astrophysics↗

The dynamics of stellar discs in live dark-matter haloes

Recent developments in computer hardware and software enable researchers to simulate the self-gravitating evolution of galaxies at a resolution comparable to the actual number of stars. Here we present the results of a series of such simulations. In this study, we performed N-body simulations of disc galaxies with between 100 and 500 million particles over a wide range of initial conditions. Our calculations include a live bulge, disc, and dark-matter halo, each of which is represented by self-gravitating particles in the N-body code. The simulations are performed using the gravitational N-body tree-code BONSAI running on the Piz Daint supercomputer. We find that the time-scale over which the bar forms increases exponentially with decreasing disc-mass fraction and that the bar formation epoch exceeds a Hubble time when the disc-mass fraction is ~0.35. These results can be explained with the swing-amplification theory. The condition for the formation of m = 2 spirals is consistent with that for the formation of the bar, which is also an m = 2 phenomenon. We further argue that the non-barred grand-design spiral galaxies are transitional, and that they evolve to barred galaxies on a dynamical time-scale. We also confirm that the disc-mass fraction and shear rate are important parameters for the morphology of disc galaxies. The former affects the number of spiral arms and the bar formation epoch, and the latter determines the pitch angle of the spiral arms.

79 ASTRONOMY AND ASTROPHYSICS↗

Computational generation and screening of RNA motifs in large nucleotide sequence pools

Although identification of active motifs in large random sequence pools is central to RNA in vitro selection, no systematic computational equivalent of this process has yet been developed. We develop a computational approach that combines target pool generation, motif scanning and motif screening using secondary structure analysis for applications to 10 12 –10 14 -sequence pools; large pool sizes are made possible using program redesign and supercomputing resources. We use the new protocol to search for aptamer and ribozyme motifs in pools up to experimental pool size (10 14 sequences). We show that motif scanning, structure matching and flanking sequence analysis, respectively, reduce the initial sequence pool by 6–8, 1–2 and 1 orders of magnitude, consistent with the rare occurrence of active motifs in random pools. The final yields match the theoretical yields from probability theory for simple motifs and overestimate experimental yields, which constitute lower bounds, for aptamers because screening analyses beyond secondary structure information are not considered systematically. We also show that designed pools using our nucleotide transition probability matrices can produce higher yields for RNA ligase motifs than random pools. Our methods for generating, analyzing and designing large pools can help improve RNA design via simulation of aspects of in vitro selection.

59 BASIC BIOLOGICAL SCIENCES↗

Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark

The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. We propose an input model called the Random Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Simulating lossy Gaussian boson sampling with matrix-product operators

Gaussian boson sampling, a computational model that is widely believed to admit quantum supremacy, has already been experimentally demonstrated and is claimed to surpass the classical simulation capabilities of even the most powerful supercomputers today. However, whether the current approach limited by photon loss and noise in such experiments prescribes a scalable path to quantum advantage is an open question. Here, to understand the effect of photon loss on the scalability of Gaussian boson sampling, we analytically derive the asymptotic operator entanglement entropy scaling, which relates to the simulation complexity. As a result, we observe that efficient tensor network simulations are likely possible under the N out ∝ √N scaling of the number of surviving photons N out in the number of input photons N. We numerically verify this result using a tensor network algorithm with U⁡(1) symmetry, and we overcome previous challenges due to the large local Hilbert-space dimensions in Gaussian boson sampling with hardware acceleration. Additionally, we observe that increasing the photon number through larger squeezing does not increase the entanglement entropy significantly. Finally, we numerically find the bond dimension necessary for fixed accuracy simulations, providing more direct evidence for the complexity of tensor networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fully self-consistent finite-temperature $GW$ in Gaussian Bloch orbitals for solids

In this work, we present algorithmic and implementation details for the fully self-consistent finite-temperature $GW$ method in Gaussian Bloch orbitals for solids. Our implementation is based on the finite-temperature Green's function formalism in which all equations are solved on the imaginary axis, without resorting to analytical continuation during the self-consistency. No quasiparticle approximation is employed and all matrix elements of the self-energy are explicitly evaluated. The method is tested by evaluating the band gaps of selected semiconductors and insulators. We show agreement with other, differently formulated, finite-temperature sc ⁢$GW$ implementations when finite-size corrections and basis-set errors are taken into account. By migrating computationally intensive calculations to graphics processing units, we obtain scalable results on large supercomputers with nearly optimal performance. Our work demonstrates the applicability of Gaussian orbital based sc⁢ $GW$ for ab initio correlated material simulations and provides a sound starting point for embedding methods built on top of $GW$.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Entanglement rearrangement in self-consistent nuclear structure calculations

Background: Entanglement plays a central role in a diverse array of increasingly important research areas, including quantum computation, simulation, measurement, sensing, and communication. Extensive suites of investigations have been performed to better understand entanglement in atomic and molecular quantum many-body systems, while the exploration of entanglement in the structure of nuclei and their reactions is presently in its infancy. Purpose: The goal of this work is to begin investigating the entanglement properties of nuclei from first-principles nuclear many-body calculations. We attempt to identify common features and emergent structures of entanglement that could ultimately lead to new and natural many-body schemes. With an eye toward quantum accelerators in future hybrid-supercomputers, criteria for partitioning nuclear many-body calculations into quantum and classical components may provide advantages in future large-scale computations. Along the way we look for explanations of the relative success of phenomenological models such as the nuclear shell model, and for better ways to match to low-energy nuclear effective field theories and lattice QCD calculations to nuclear many-body techniques that are based upon entanglement. Method: We explore the entanglement between single-particle states in 4 He and 6 He. The patterns of entanglement emerging from different single-particle bases are compared, and possible links with the convergence of observables are explored, in particular, ground-state energies. The nuclear wave functions are obtained by performing active-space no-core configuration-interaction calculations using a two-body nucleon-nucleon interaction derived from chiral effective field theory. Entanglement measures within single-particle bases exhibiting different degrees of complexity are determined, in particular, harmonic oscillator (HO), Hartree-Fock (HF), natural (NAT) and variational natural (VNAT) bases. Specifically, single-orbital entanglement entropy, two-orbital mutual information, and negativity are studied. Results: The entanglement structures in 4 He and 6 He are found to be more localized within NAT and VNAT bases than within a HO basis for the optimal HO parameters we have worked with. In particular a core-valence structure clearly emerges from the full no-core calculation of 6 He. Here, the two-nucleon mutual information shows that the VNAT basis, which typically exhibits good convergence properties, effectively decouples the active and inactive spaces. Conclusions: Measures of one- and two-nucleon entanglement are found to be useful in analyzing the structure of nuclear wave functions, in particular the efficacy of basis states, and may provide useful metrics toward developing more efficient schemes for ab initio computations of the structure and reactions of nuclei, and quantum many-body systems more generally.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗