Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Cluster computing”

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,027 records · Page 57
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Typological representation of the offshore oceanographic environment along the Alaskan North Slope

Erosion and flooding impacts to Arctic coastal environments are intensifying with nearshore oceanographic conditions acting as a key environmental driver. Robust and comprehensive assessment of the nearshore oceanographic conditions require knowledge of the following boundary conditions: incident wave energy, water level, incident wind energy, ocean temperature and salinity, bathymetry, and shoreline orientation. The number of offshore oceanographic boundary conditions can be large, requiring a significant computational investment to reproduce nearshore conditions. This present study develops location-independent typologies to reduce the number of boundary conditions needed to assess nearshore oceanographic environments in both a Historical (2007–2019) and Future (2020–2040) timespan along the Alaskan North Slope. We used WAVEWATCH III® and Delft3D Flexible Mesh model output from six oceanographic sites located along a constant ~50 m bathymetric line spanning the Chukchi to Beaufort Seas. K-means clustering was applied to the energy-weighted joint-probability distribution of significant wave height (H s ) and peak period (T p ). Distributions of wave and wind direction, wind speed, and water level associated with location-independent centroids were assigned single values to describe a reduced order, typological rendition of offshore oceanographic conditions. Reanalysis data (e.g., ASRv2, ERA5, and GOFS) grounded the historical simulations while projected conditions were obtained from downscaled GFDL-CM3 forced under RCP8.5 conditions. Location-dependence for each site is established through the occurrence joint-probability distribution in the form of unique scaling factors representing the fraction of time that the typology would occupy over a representative year. As anticipated, these typologies show increasingly energetic ocean conditions in the future. They also enable computationally efficient simulation of the nearshore oceanographic environment along the North Slope of Alaska for better characterization of coastal processes (e.g., erosion, flooding, or sediment transport).

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2023

Conquering Data Chaos: Research Data Management with Kubernetes

Managing massive volumes of data and effectively making it accessible to researchers poses significant challenges and is a barrier to scientific discovery. In many cases, critical data is locked up in unwieldy file formats or one-off databases and is too large to effectively process on a single machine. This talk explores the role of Kubernetes, an open-source container orchestration platform, in addressing research data management challenges. I will discuss how we are using a set of publicly available open-source and home-grown tools in the National Renewable Energy Lab (NREL) Data, Analysis, and Visualization (DAV) group to help researchers overcome data-related bottlenecks. The talk will begin by providing an overview of the data challenges faced in research data management, including data storage, processing, and analysis. I will highlight Kubernetes' ability to handle large-scale data by leveraging containerization and distributed computing, including distributed storage. Kubernetes allows researchers to encapsulate data processing infrastructure and workflows into portable containers, enabling reproducibility and ease of deployment. Kubernetes can then schedule and manage the resource allocation of these containers to enable efficient utilization of limited computing resources, leading to more efficient data processing and analysis. I will discuss some limitations of traditional, siloed approaches to dealing with data and emphasize the need for solutions which foster collaboration. I will highlight how we are using Kubernetes at NREL to facilitate data sharing and cooperation among research teams. Kubernetes' flexible architecture enables the deployment of shared computing environments, such as Apache Superset, where researchers can seamlessly access and analyze shared datasets. Providing the ability to have one research team easily consume data generated by another, utilizing Kubernetes' as a central data platform, is one of the major wins we've encountered by adopting the platform. Finally, I will showcase real-world use cases from NREL where we have used Kubernetes to solve some persistent data challenges involving large volumes of sensor and monitoring data. I will discuss the challenges we encountered when creating our cluster and making it available as a production-ready resource. I will also discuss the specific suite of tools, including Postgres and Apache Druid for columnar and timeseries data, and Redpanda Kafka for streaming data we have deployed in our infrastructure, and the process that went into the selection of these tools.

collaborative environment↗
DOE OSTI2023

Rapid Computational Identification of Therapeutic Targets for Pathogens

Biological threats continue to persist and evolve as an important challenge to national security. There are multiple ways in which novel viral pathogens could emerge to pose a serious threat to human health. This project developed a pathogen target identification tool that can rapidly respond to a novel or emerging viral biological threat. A set of computational tools were developed that provide detailed information on the newly sequenced genes, their protein products and the drug target sites for the proteins that are best suited for biological countermeasure development. Three key innovations were developed in the project. 1) Development of a new extensive database of protein pocket structures with structure-based search algorithms to rapidly link novel protein targets with the complete collection of previously experimentally solved protein structures. 2) A novel clustering pipeline was introduced to group matching structures and associated small-molecule binding ligands into a consensus protein pocket with the associated small-molecule chemotypes predicted to fit in the pocket site. The matching experimentally solved structures were used to inform the value of different target sites. 3) Where there are viral protein targets with pockets structurally matched to similar human proteins, a biological knowledge graph, which links molecular interactions with human disease, was used to further assess the potential negative impact of a viral protein target with similarities to human proteins that could have important off target side effects. In total, the project produced a new resource for rapid and detailed assessment of promising targets for countermeasures, reflecting the ongoing wet lab, clinical, and computational data being collected. These capabilities will improve the ability to respond to a biological threat in multiple domains.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2024

High Performance Computing Peak Shaving for Microreactor Operation

There are multiple nuclear microreactors currently under development that are designed to provide autonomous power for as many as ten or more years without refueling and are designed to power high performance computing (HPC) datacenters. But the load-follow speeds for a nuclear microreactor will be much slower than grid power and slower than the power variance typical of a HPC system. HPC datacenters experience peak power load variance driven by several factors ranging from the operation of cooling systems to remove heat from the servers to supporting a wide range of user application workflows and architectures each with different power signatures. One mechanism to support the limited load-follow of a microreactor is peak shaving where an energy storage mechanism is used to shed peak load and reduce significant power variance. This work explores peak electrical load shaving using uninterruptible power supply (UPS) systems designed for HPC support in the context of peak shaving when operating using a nuclear microreactor with a load-follow limited to 10% of load per minute. Using a self contained HPC datacenter complete with stand-alone cooling system and provisioned with an x86 cluster, an ARM cluster, and a graphics processing unit (GPU) cluster, peak shaving for microreactor operation using the UPS battery backup is explored while running two classes of typical HPC user applications. HPC architecture suitability for microreactor operation under this type of peak shaving is examined.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

MIBiG 4.0: advancing biosynthetic gene cluster curation through global collaboration

Specialized or secondary metabolites are small molecules of biological origin, often showing potent biological activities with applications in agriculture, engineering and medicine. Usually, the biosynthesis of these natural products is governed by sets of co-regulated and physically clustered genes known as biosynthetic gene clusters (BGCs). To share information about BGCs in a standardized and machine-readable way, the Minimum Information about a Biosynthetic Gene cluster (MIBiG) data standard and repository was initiated in 2015. Since its conception, MIBiG has been regularly updated to expand data coverage and remain up to date with innovations in natural product research. Here, we describe MIBiG version 4.0, an extensive update to the data repository and the underlying data standard. In a massive community annotation effort, 267 contributors performed 8304 edits, creating 557 new entries and modifying 590 existing entries, resulting in a new total of 3059 curated entries in MIBiG. Particular attention was paid to ensuring high data quality, with automated data validation using a newly developed custom submission portal prototype, paired with a novel peer-reviewing model. MIBiG 4.0 also takes steps towards a rolling release model and a broader involvement of the scientific community. MIBiG 4.0 is accessible online at https://mibig.secondarymetabolites.org/.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Utilizing Essential Symmetry Breaking in Auxiliary-Field Quantum Monte Carlo: Application to the Spin Gaps of the C 36 Fullerene and an Iron Porphyrin Model Complex

We present three distinct examples where phaseless auxiliary-field quantum Monte Carlo (ph-AFQMC) can be reliably performed with a single-determinant trial wave function with essential symmetry breaking. Essential symmetry breaking was first introduced by Lee and Head-Gordon [ Phys. Chem. Chem. Phys. 2019, 21, 4763-4778, 10.1039/C8CP07613H]. We utilized essential complex and time-reversal symmetry breaking with ph-AFQMC to compute the triplet–singlet energy gap in the TS12 set. We found statistically better performance of ph-AFQMC with complex-restricted orbitals than with spin-unrestricted orbitals. We then showed the utilization of essential spin symmetry breaking when computing the singlet–triplet gap of a known biradicaloid, C 36 . ph-AFQMC with spin-unrestricted Hartree–Fock (ph-AFQMC+UHF) fails catastrophically even with spin-projection and predicts no biradicaloid character. With approximate Brueckner orbitals obtained from regularized orbital-optimized second-order Møller–Plesset perturbation theory (κ-OOMP2), ph-AFQMC quantitatively captures strong biradicaloid character of C 36 . Lastly, we applied ph-AFQMC to the computation of the quintet–triplet gap in a model iron porphyrin complex where brute-force methods with a small active space fail to capture the triplet ground state. We show unambiguously that neither triplet nor quintet is strongly correlated using UHF, κ-OOMP2, and coupled-cluster with singles and doubles (CCSD) performed on UHF and κ-OOMP2 orbitals. There is no essential symmetry breaking in this problem. By virtue of this, we were able to perform UHF+ph-AFQMC reliably with a cc-pVTZ basis set and predicted a triplet ground state for this model geometry. The largest ph-AFQMC in this work correlated 186 electrons in 956 orbitals. Our work highlights the utility, scalability, and accuracy of ph-AFQMC with a single-determinant trial wave function with essential symmetry breaking for systems mainly dominated by dynamical correlation with little static correlation.

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

Network Analysis of Academic Medical Center Websites in the United States

Healthcare resources are published annually in repositories such as the AHA Annual Survey Database TM . However, these data repositories are created via manual surveying techniques which are cumbersome in collection and not updated as frequently as website information of the respective hospital systems represented. Also, this resource is not widely available to patients in an easy-to-use format. Network analysis techniques have the potential to create topological maps which serve to aid in pathfinding for patients in their search for healthcare services. This study explores the topological structure of forty United States academic health center websites. Network analysis is utilized to analyze and visualize 48,686 webpages. Several elements of network structure are examined including basic network properties, and centrality measures distributions. The Louvain community detection algorithm is used to examine the extent to which these techniques allow identification of healthcare resources within networks. The results indicate that websites with related healthcare services tend to form observable clusters useful in mapping key resources within a hospital system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Multi-site reaction dynamics through multi-fragment density matrix embedding

The practical description of disordered chemical reactions, where the reactions involve multiple species at multiple sites, is presently a challenge using correlated electronic structure methods due to their high computational cost and steep scaling. Here, we describe the gradient theory of multi-fragment density matrix embedding theory, which potentially provides a minimal computational framework to model such processes at the correlated electron level. We present the derivation and implementation of the gradient theory, its validation on model systems and chemical reactions using density matrix embedding, and its application to a molecular dynamics simulation of proton transport in a small water cluster, a simple example of multi-site reaction dynamics.

Chemistry↗
DOE OSTI2022

Climatic clustering and longitudinal analysis with impacts on food, bioenergy, and pandemics

Predicted growth in world population will put unparalleled stress on the need for sustainable energy and global food production, as well as increase the likelihood of future pandemics. In this work, we identify high-resolution environmental zones in the context of a changing climate and predict longitudinal processes relevant to these challenges. We do this using exhaustive vector comparison methods that measure the climatic similarity between all locations on earth at high geospatial resolution relative to global-scale analyses. The results are captured as networks, in which edges between geolocations are defined if their historical climate similarities exceed a threshold. We apply Markov clustering and our novel Correlation of Correlations method to the resulting climatic networks, which provides unprecedented agglomerative and longitudinal views of climatic relationships across the globe. The methods performed here resulted in the fastest (9.37x10 18 operations/sec) and one of the largest (168.7x10 21 operations) scientific computations ever performed, with more than 100 quadrillion edges considered for a single climatic network. Our climatic analysis reveals areas of the world experiencing rapid environmental changes, which can have important implications for global carbon fluxes and zoonotic spillover events. Correlation and network analyses of this kind are widely applicable across computational and predictive biology domains, including systems biology, ecology, carbon cycles, biogeochemistry, and zoonosis research.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

Demonstration of MOOSE-based Griffin reactor physics, code for heterogeneous lead-cooled fast reactor analysis

The MOOSE-based reactor physics code Griffin was assessed on a heterogeneous pin-resolved model of a prototype lead-cooled fast reactor assembly. This model was developed in preparation for future use in MOOSE-based multiphysics calculations for computing hot channel factors. Heterogeneous multigroup cross sections were prepared using the fast reactor multi-group cross section processing code MC{sup 2}-3 using a two-step method. Griffin simulations were performed using the DFEM-SN solver on 576 cores on Argonne's LCRC cluster. Diffusion-based acceleration methods were applied (NDA and CMFD). Reference solutions were generated with continuous energy MCNP and the hybrid MOC/finite element solver PROTEUS-MOC for code-to-code comparison. Space-angle convergence studies were conducted to observe convergence in k-eigenvalue and axial pin power distributions. The fully resolved Griffin calculation was within 68 pcm of the MCNP eigenvalue and exhibited max 1.2% relative error in the axial pin power distribution. Griffin produced nearly identical results to PROTEUS-MOC when using the same 9-group multigroup cross-section set. Griffin demonstrated favorable scaling in wall-clock time and memory usage when using diffusion-based acceleration methods. Griffin is capable of simulating the pin-resolved heterogeneous LFR assembly with good accuracy and performance, and is suitable for future use in coupled high-fidelity hot channel factor simulations. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2020

Using modularity to segment binary code

We consider the problem of recovering program structure from compiled binary code. We first extract the call graph and layout of functions in memory from the compiled code and represent this information in a graphical format. We then employ Louvain's modularity algorithm to identify clusters of functions that are considered to be related. We find that the quality and properties of clusters extracted by our technique are greatly impacted by the relative importance we assign to the call graph and the ordering of functions in memory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Finite-temperature coupled cluster: Efficient implementation and application to prototypical systems

In this work, we discuss the theory and implementation of the finite temperature coupled cluster singles and doubles (FT-CCSD) method including the equations necessary for an efficient implementation of response properties. Numerical aspects of the method including the truncation of the orbital space and integration of the amplitude equations are tested on some simple systems, and we provide some guidelines for applying the method in practice. The method is then applied to the 1D Hubbard model, the uniform electron gas (UEG) at warm, dense conditions, and some simple materials. The performance of model systems at high temperatures is encouraging: for the one-dimensional Hubbard model, FT-CCSD provides a qualitatively accurate description of finite-temperature correlation effects even at U = 8, and it allows for the computation of systematically improvable exchange–correlation energies of the warm, dense UEG over a wide range of conditions. We highlight the obstacles that remain in using the method for realistic ab initio calculations on materials

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

The FMO-DFTB Method

Although the fragment molecular orbital (FMO) method enables electronic structure calculations with near-linear scaling behavior with respect to system size, the computational cost of ab initio methods typically employed in conjunction with FMO is still prohibitive for routine calculations of very large systems or long timescale molecular dynamics simulations. We, therefore, combined the FMO and density-functional tight-binding (DFTB) method, which is one of the emerging semi-empirical quantum chemical methods, and have demonstrated that FMO-DFTB is capable of performing geometry optimizations for systems containing up to one million atoms using limited computational resources. In this chapter, we will review the basics of the DFTB method first before introducing FMO-DFTB, focusing on the relationship with density functional theory and other FMO methodologies. We also demonstrate the latest scalings of FMO-DFTB2 and DFTB3 using three-dimensional water clusters, showing that the most favorable scaling is O(N1.16). Applications of FMO-DFTB to various systems are briefly summarized, and an outlook to future applications is provided.

Nishimoto, Yoshio↗
DOE OSTI2023

A probabilistic-phase field model for the fracture of brittle materials

Abstract We develop a computational method to determine the failure probability of brittle materials under general mechanical loading conditions. The method is a combination of two parts: (1) numerical simulations of materials with multiple cracks using phase field theory, where the complete fracture process is viewed as ‘damage percolation’ along critical paths or clusters of cracks, rather than the traditional weak-link failure mechanism of Weibull, and (2) an extension of the Batdorf statistical theory of fracture to finite domains, where it is implemented within the finite element framework. The results of phase-field simulations at the ‘percolation threshold’ are used as failure data in the Batdorf theory to determine the overall probability of failure. The input to this approach is the size distribution of cracks in a pristine material. An example is shown, where alumina samples that were previously tested by Abe and coworkers (Abeet al2003J. Am. Ceram. Soc.861019–21) in four-point loading are compared to the results of our numerical simulations. The approach developed here has the advantage of being extendable to more complex thermomechanical loading.

Materials Science↗
DOE OSTI2020

Newton versus the machine: solving the chaotic three-body problem using deep neural networks

ABSTRACT Since its formulation by Sir Isaac Newton, the problem of solving the equations of motion for three bodies under their own gravitational force has remained practically unsolved. Currently, the solution for a given initialization can only be found by performing laborious iterative calculations that have unpredictable and potentially infinite computational cost, due to the system’s chaotic nature. We show that an ensemble of converged solutions for the planar chaotic three-body problem obtained using an arbitrarily precise numerical integrator can be used to train a deep artificial neural network (ANN) that, over a bounded time interval, provides accurate solutions at a fixed computational cost and up to 100 million times faster than the numerical integrator. In addition, we demonstrate the importance of training an ANN using converged solutions from an arbitrary precise integrator, relative to solutions computed by a conventional fixed precision integrator, which can introduce errors in the training data, due to numerical round-off and time discretization, that are learned by the ANN. Our results provide evidence that, for computationally challenging regions of phase space, a trained ANN can replace existing numerical solvers, enabling fast and scalable simulations of many-body systems to shed light on outstanding phenomena such as the formation of black hole binary systems or the origin of the core collapse in dense star clusters.

Breen, Philip G.↗
DOE OSTI2020

Nearest neighbour distributions: New statistical measures for cosmological clustering

ABSTRACT The use of summary statistics beyond the two-point correlation function to analyse the non-Gaussian clustering on small scales, and thereby, increasing the sensitivity to the underlying cosmological parameters, is an active field of research in cosmology. In this paper, we explore a set of new summary statistics – the k-Nearest Neighbour Cumulative Distribution Functions (kNN-CDF). This is the empirical cumulative distribution function of distances from a set of volume-filling, Poisson distributed random points to the k-nearest data points, and is sensitive to all connected N-point correlations in the data. The kNN-CDF can be used to measure counts in cell, void probability distributions, and higher N-point correlation functions, all using the same formalism exploiting fast searches with spatial tree data structures. We demonstrate how it can be computed efficiently from various data sets – both discrete points, and the generalization for continuous fields. We use data from a large suite of N-body simulations to explore the sensitivity of this new statistic to various cosmological parameters, compared to the two-point correlation function, while using the same range of scales. We demonstrate that the use of kNN-CDF improves the constraints on the cosmological parameters by more than a factor of 2 when applied to the clustering of dark matter in the range of scales between 10 and $40\, h^{-1}\, {\rm Mpc}$. We also show that relative improvement is even greater when applied on the same scales to the clustering of haloes in the simulations at a fixed number density, both in real space, as well as in redshift space. Since the kNN-CDF are sensitive to all higher order connected correlation functions in the data, the gains over traditional two-point analyses are expected to grow as progressively smaller scales are included in the analysis of cosmological data, provided the higher order correlation functions are sensitive to cosmology on the scales of interest.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2023

Crowd cluster data in the USA for analysis of human response to COVID-19 events and policies

We provide data on daily social contact intensity of clusters of people at different types of Points of Interest (POI) by zip code in Florida and California. This data is obtained by aggregating fine-scaled details of interactions of people at the spatial resolution of 10 m, which is then normalized as a social contact index. We also provide the distribution of cluster sizes and average time spent in a cluster by POI type. This data will help researchers perform fine-scaled, privacy-preserving analysis of human interaction patterns to understand the drivers of the COVID-19 epidemic spread and mitigation. Current mobility datasets either provide coarse-level metrics of social distancing, such as radius of gyration at the county or province level, or traffic at a finer scale, neither of which is a direct measure of contacts between people. We use anonymized, de-identified, and privacy-enhanced location-based services (LBS) data from opted-in cell phone apps, suitably reweighted to correct for geographic heterogeneities, and identify clusters of people at non-sensitive public areas to estimate fine-scaled contacts.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2022

Fast estimation of ion-pairing for screening electrolytes: A cluster can approximate a bulk liquid

The propensity for ion-pairing can often dictate the thermodynamic and kinetic properties of electrolyte solutions. Fast and accurate estimates of ion-pairing can thus be extremely valuable for supplementing design and screening efforts for novel electrolytes. We introduce an efficient cluster model to estimate the local ion-pair potential-of-mean-force between ionic solutes in electrolytes. The model incorporates an ion-pair and a few layers of explicit solvent in a gas-phase cluster and leverages an enhanced sampling approach to achieve high efficiency and accuracy. We employ harmonic restraints to prevent solvent escape from the cluster and restrict sampling of large inter-ion distances. We develop a cluster ion-pair sampling tool that implements our cluster model and demonstrate its potential utility for screening simple and poly-electrolyte systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗