Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel clustering”

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 505 records · Page 28

ArborX

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, it uses linear BVH for its low construction cost and sufficient quality. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase. ArborX also implements several advanced algorithms using geometric search, such as density-based clustering algorithm DBSCAN.

ECP↗

An Orthogonal Recursive Bisection (ORB) Based Time Advancement Algorithm for CFD-DEM Solvers

The time integration of the granular phase in coupled computational fluid dynamics (CFD) – discrete element method (DEM) simulations presents a unique computational challenge brought about by the large variations in particle collisional time scales. Particles in the dilute regions of the computational domain can be advanced with large time steps while dense regions require much smaller time increments. However, the time step size in most solvers is globally set as the limit for accuracy and stability imposed by the collisions and is typically orders of magnitude less than that required away from collisions. This work addresses this precise issue and provides a strategy to avoid the use of a global conservative small time step size for the entire set of particles.A novel time stepping algorithm for CFD-DEM solvers using a partitioning approach using orthogonal recursive bisection (ORB) that allows for variable time steps among particles is described and its computational performance is compared against baseline explicit methods, typically used in several CFD-DEM solvers. ORB has advantages of being relatively quick and easy to update incrementally and has the required heuristic behavior (i.e., it will split the region in half with a cluster on each side) when groups of particles are well separated (clustered). The algorithm presented in this work uses a local time stepping approach to resolve collisional time scales for subsets of particles that are present at the leaves of the ORB, thereby resulting in substantial reduction of computational cost. The parallel implementation of this method where a ``knapsack” algorithm is used in tandem with ORB for effective load-balancing is also presented, where a best possible partitioning is obtained based on number of particles and local time-stepping costs. The algorithm is tested against benchmark problems with varying particle distributions that include fluidized bed and riser flow scenarios. Preliminary results indicate that the approach is 2-3X faster than traditional explicit methods for problems that involve both dense and dilute regions, while maintaining the same level of accuracy.

adaptive timestepping↗

A PARALLEL MONTE CARLO CODE FOR SIMULATING COLLISIONAL N-BODY SYSTEMS

We present a new parallel code for computing the dynamical evolution of collisional N-body systems with up to N {approx} 10{sup 7} particles. Our code is based on the Henon Monte Carlo method for solving the Fokker-Planck equation, and makes assumptions of spherical symmetry and dynamical equilibrium. The principal algorithmic developments involve optimizing data structures and the introduction of a parallel random number generation scheme as well as a parallel sorting algorithm required to find nearest neighbors for interactions and to compute the gravitational potential. The new algorithms we introduce along with our choice of decomposition scheme minimize communication costs and ensure optimal distribution of data and workload among the processing units. Our implementation uses the Message Passing Interface library for communication, which makes it portable to many different supercomputing architectures. We validate the code by calculating the evolution of clusters with initial Plummer distribution functions up to core collapse with the number of stars, N, spanning three orders of magnitude from 10{sup 5} to 10{sup 7}. We find that our results are in good agreement with self-similar core-collapse solutions, and the core-collapse times generally agree with expectations from the literature. Also, we observe good total energy conservation, within {approx}< 0.04% throughout all simulations. We analyze the performance of the code, and demonstrate near-linear scaling of the runtime with the number of processors up to 64 processors for N = 10{sup 5}, 128 for N = 10{sup 6} and 256 for N = 10{sup 7}. The runtime reaches saturation with the addition of processors beyond these limits, which is a characteristic of the parallel sorting algorithm. The resulting maximum speedups we achieve are approximately 60 Multiplication-Sign , 100 Multiplication-Sign , and 220 Multiplication-Sign , respectively.

79 ASTRONOMY AND ASTROPHYSICS↗

Solution structure for an Encephalitozoon cuniculi adrenodoxin-like protein in the oxidized state

Encephalitozoon cuniculi is a unicellular, obligate intracellular eukaryotic parasite in the Microsporidia family and one of the agents responsible for microsporidosis infections in humans. Like most Microsporidia, the genome of E. cuniculi is markedly reduced and the organism contains mitochondria-like organelles called mitosomes instead of mitochondria. Here we report the solution NMR structure for a protein physically associated with mitosome-like organelles in E. cuniculi, the 128-residue, adrenodoxin-like protein Ec-Adx (UniProt ID Q8SV19) in the [2Fe-2S] ferredoxin superfamily. Oxidized Ec-Adx contains a mixed four-strand β-sheet, β2-β1-β4-β3 (↓↑↑↓), loosely encircled by three α-helices and two 310-helices. This fold is similar to the structure observed in other adrenodoxin and adrenodoxin-like proteins except for the absence of a fifth anti-parallel β-strand next to β3 and the position of α3. Cross peaks are missing or cannot be unambiguously assigned for 20 amide resonances in the 1 H- 15 N HSQC spectrum of Ec-Adx. These missing residues are clustered primarily in two regions, G48-V61 and L94-L98, containing the four cysteine residues predicted to ligate the paramagnetic [2Fe-2S] cluster. Missing amide resonances in 1 H- 15 N HSQC spectra are detrimental to NMR-based solution structure calculations because 1 H- 1 H NOE restraints are absent (glass half-empty) and this may account for the absent β-strand (β5) and the position of α3 in oxidized Ec-Adx. On the other hand, the missing amide resonances unambiguously identify the presence, and immediate environment, of the paramagnetic [2Fe-2S] cluster in oxidized Ec-Adx (glass half-full).

59 BASIC BIOLOGICAL SCIENCES↗

A DEEP, WIDE-FIELD, AND PANCHROMATIC VIEW OF 47 Tuc AND THE SMC WITH HST: OBSERVATIONS AND DATA ANALYSIS METHODS

In Hubble Space Telescope (HST) Cycle 17, we imaged the well-known globular star cluster 47 Tucanae for 121 orbits using the Wide Field Channel of the Advanced Camera for Surveys (ACS) and both the UV/visible (UVIS) and IR channels of the newly installed Wide Field Camera 3 (WFC3) instrument (GO-11677, PI: H. Richer). This unique data set was obtained to address many scientific questions that demand a very deep, panchromatic, and panoramic view of the cluster's stellar populations. In total, the program obtained over 0.75 Ms of imaging exposure time with the three HST cameras, over a time span of 9 months in 2010. The primary ACS field was imaged in the two broadband filters F606W and F814W, at 13 orientations, for all 121 orbits. The parallel WFC3 imaging provides a panchromatic (0.4-1.7 {mu}m) and contiguous imaging swath over a 250 Degree-Sign azimuthal range at impact radii of 6.5-17.9 pc in 47 Tuc. This imaging totals over 60 arcmin{sup 2} in area and utilizes the F390W and F606W broadband filters on WFC3/UVIS and the F110W and F160W broadband filters on WFC3/IR. In this paper, we describe the observational design of the new survey and one of the methods used to analyze all of the imaging data. This analysis combines over 700 full-frame images taken with the three HST cameras into a handful of ultra-deep, well-sampled combined images in each of the six filters. We discuss in detail the methods used to calculate accurate transformations that provide optimal alignment of the input images, the methods used to perform sky background offsets in the input stack and the flagging of deviant pixels, and the balance reached between the input-pixel drop size onto an output supersampled pixel grid. Careful photometric, morphological, and astrometric measurements are performed on the stacks using iterative PSF-fitting techniques, and reveal unprecedented color-magnitude diagrams of the cluster extending to >30th magnitude in the optical, 29th magnitude in the UV, and 27th magnitude in the IR. The data set provides a characterization of the complete stellar populations of 47 Tuc, extending from the faintest hydrogen-burning dwarfs through the main-sequence and giant branches down to very cool white dwarf remnants in the cluster. The imaging also provides the deepest probe of the stellar populations of the background Small Magellanic Cloud galaxy, resolving low-mass main-sequence dwarfs with M {approx}< 0.2 M{sub Sun }.

79 ASTRONOMY AND ASTROPHYSICS↗

First-Principles Grand-Canonical Simulations of Water Adsorption in Proton-Exchanged Zeolites

Water appears by design or as impurities in many important reactive systems. For those catalyzed by porous solid acids, such as widely used zeolites, experimentally quantifying the amount or elucidating the structure of adsorbed water clusters at reaction conditions is challenging, while computational studies (e.g., first-principles molecular dynamics simulations) often need to assume the loading to examine solvation effects. Furthermore, we perform first-principles grand-canonical simulations to predict water adsorption to H-ZSM-5 zeolites under specified experimental conditions. Presampling with inexpensive force fields and a pool-based parallelization algorithm are used to improve simulation efficiency, while molecular dynamics is used to sample configurations involving hydronium species. We observe that H + exchange dramatically increases the hydrophilicity of zeolite MFI and an appreciable amount of water is present at very low relative humidities. At all conditions examined, the zeolitic protons are found to dissociate readily from the surface basic sites and become mobile by participating in the hydrogen-bonded chains of adsorbed water molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Spatially Resolved Mapping of Three-Dimensional Molecular Orientations with ~2 nm Spatial Resolution through Tip-Enhanced Raman Scattering

We record local optical field images of silver nanocubes (75 nm) using tip-enhanced Raman (TER) spectral imaging. The images that we observe are consistent with several recent reports from our group, but here, we demonstrate sub-2 nm spatial resolution in local optical field nanoimaging under ambient laboratory conditions. This is achieved by scanning the substrate (nanocube on Si) relative to a 4-thiobenzonitrile (TBN)-functionalized Ag-coated TER probe. The spatial resolution that we obtain necessitates that only a few molecules govern the recorded optical response; molecular orientation becomes an important consideration in such measurements. We model the orientation through geometry optimization of a TBN molecule chemisorbed onto an Ag79 cluster (sphere with a ~1 nm diameter). Using the computed orientation of the cluster-bound molecule, we then model the optical response using formalism that accounts for the orientation of the molecule relative to vector components of the local optical fields. We find optimal agreement between experiment and theory. In effect, this work reveals the parallels between single-molecule Raman scattering and high-spatial-resolution TER spectroscopy, even when the images themselves cannot be used to visualize a single molecule in real space.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Episodic Earthquake Swarms in the Mineral Mountains, Utah Driven by the Roosevelt Hydrothermal System

Over 1,000 earthquakes (-2.0 < M < 2.0), identified using a matched-filter method, occurred in the Mineral Mountains, Utah between 2016 and 2019. The enhanced catalog is complete down to M -0.9 and contains roughly 15 times more events than originally cataloged. Earthquake relocation of ~800 earthquakes shows that activity is concentrated in a <2 km long E-W striking narrow zone, ~4 km east of the Roosevelt hydrothermal system. Two fault orientations, both N-S and E-W parallel to the Opal Mound and Mag Lee faults, respectively, are observed after computing composite focal mechanisms of highly similar earthquakes. Looking solely at the temporal distribution of the seismicity, we identify 15 periods of swarm-like activity, with two major clusters occurring in December 2016, recorded by three stations, and in October 2019 recorded by eight stations. The October 2019 swarm, the best recorded sequence in the area, provides evidence for the underlying triggering mechanism. We show that a complex mechanism of fluid diffusion and aseismic slip is responsible for the swarm evolution with migration velocities reaching 10 km/day. We hypothesize that these episodic swarms in the Mineral Mountains are primarily driven by migrating fluids that originate within the Roosevelt hydrothermal system.

58 GEOSCIENCES↗

The benzene⋯naphthalene complex: A more challenging system than the benzene dimer for newly developed computational methods

High-level coupled cluster singles, doubles, and perturbative triples [CCSD(T)] computations with up to the aug-cc-pVQZ basis set (1924 basis functions) and various extrapolations toward the complete basis set (CBS) limit are presented for the sandwich, T-shaped, and parallel-displaced benzene⋯naphthalene complex. Using the CCSD(T)/CBS interaction energies as a benchmark, the performance of some newly developed wave function and density functional theory methods has been evaluated. The best performing methods were found to be the dispersion-corrected PBE0 functional (PBE0-D3) and spin-component scaled zeroth-order symmetry-adapted perturbation theory (SCS-SAPT0). The success of SCS-SAPT0 is very encouraging because it provides one method for energy component analysis of π-stacked complexes with 200 atoms or more. Most newly developed methods do, however, overestimate the interaction energies. The results of energy component analysis show that interaction energies are overestimated mainly due to the overestimation of dispersion energy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Exotic structure in light neutron-rich nuclei

In this presentation I discussed two subjects. One is the persistence of threefold symmetry in the ground state of {sup 12}C. Recently D{sub 3h} symmetry has been established in {sup 12}C, which reflects the geometric symmetry of the three α particles. Although the spin-orbit interaction plays a significant role and this interaction breaks the α clusters, we show that threefold symmetry of {sup 12}C is still there. We use AQCM approach and discuss that inclusion of spin-orbit interaction, which is absent in the conventional microscopic α cluster models, is possible keeping the threefold symmetry. The second subject is the appearance of rod shape in C isotopes, which has been investigated in the framework of the cranking covariant density functional theory. The relationship between the stability of such states and the spin and isospin degrees of freedom is discussed; adding valence neutrons and rotating the system. These two effects stabilize the rod shape, and in addition, their coherent effect has been found; the σ-orbits (parallel to the symmetry axis) of the valence neutrons, which enhances the rod shape, is lowered by the rotation of the system, and this σ-orbit pulls down the single particle energies of protons with linear configuration owing to the proton-neutron interaction effect.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Taming parallel I/O complexity with auto-tuning

We present an auto-tuning system for optimizing I/O performance of HDF5 applications and demonstrate its value across platforms, applications, and at scale. The system uses a genetic algorithm to search a large space of tunable parameters and to identify effective settings at all layers of the parallel I/O stack. The parameter settings are applied transparently by the auto-tuning system via dynamically intercepted HDF5 calls. To validate our auto-tuning system, we applied it to three I/O benchmarks (VPIC, VORPAL, and GCRM) that replicate the I/O activity of their respective applications. We tested the system with different weak-scaling configurations (128, 2048, and 4096 CPU cores) that generate 30 GB to 1 TB of data, and executed these configurations on diverse HPC platforms (Cray XE6, IBM BG/P, and Dell Cluster). In all cases, the auto-tuning framework identified tunable parameters that substantially improved write performance over default system settings. In conclusion, we consistently demonstrate I/O write speedups between 2x and 100x for test configurations.

97 MATHEMATICS AND COMPUTING↗

Transforming microseismic clouds into near real-time visualization of the growing hydraulic fracture

SUMMARY Microseismic observations during unconventional reservoir stimulation are typically seen as a proxy for clusters of hydraulic fractures and the extent of the stimulated reservoir. Such straightforward interpretation is often misleading and fails to provide a physically reasonable image of the fracturing process. This paper demonstrates the application of a physics-based machine learning algorithm which enables a rapid and accurate fracture mapping from the microseismic data. Our training and validation data set relies on a history-matched geomechanical modelling workflow implemented in GEOS software for the Hydraulic Fracturing Test Site 1 (HFTS-1) project. For this study we augmented the simulated fracture growth through geostatistical modelling of induced seismicity, so that the synthetic microseismic catalogue matches the main statistical properties of the field observations. We formulated the problem of mapping the actual fracture in the clutter of events to parallel common video segmentation workflows: several past video frames (microseismic density snapshots) are passed through a deep convolutional network to classify whether a given voxel is associated with a fracture or intact rock. We found that for accurate fracture mapping, the network’s input and architecture must be augmented to incorporate the fluid injection parameters (pressure, rate, concentration of proppant, and location of the perforation within the cluster). The error rate for the network reached as little as 10 per cent of the fracture area, while a conventional microseismic interpretation approach yielded ∼300 per cent. Our approach also yields must faster predictions than conventional methods (minutes instead of weeks), and could enable engineers to make rapid decisions regarding engineering parameters (pumping rate, viscosity) in real time during stimulation.

58 GEOSCIENCES↗

MapReduce Implementation of a Hybrid Spectral Library-Database Search Method for Large-Scale Peptide Identification

A MapReduce-based implementation called MR- MSPolygraph for parallelizing peptide identification from mass spectrometry data is presented. The underlying serial method, MSPolygraph, uses a novel hybrid approach to match an experimental spectrum against a combination of a protein sequence database and a spectral library. Our MapReduce implementation can run on any Hadoop cluster environment. Experimental results demonstrate that, relative to the serial version, MR-MSPolygraph reduces the time to solution from weeks to hours, for processing tens of thousands of experimental spectra. Speedup and other related performance studies are also reported on a 400-core Hadoop cluster using spectral datasets from environmental microbial communities as inputs.

59 BASIC BIOLOGICAL SCIENCES↗

Generic and robust method for automatic segmentation of PET images using an active contour model

Purpose: Although positron emission tomography (PET) images have shown potential to improve the accuracy of targeting in radiation therapy planning and assessment of response to treatment, the boundaries of tumors are not easily distinguishable from surrounding normal tissue owing to the low spatial resolution and inherent noisy characteristics of PET images. The objective of this study is to develop a generic and robust method for automatic delineation of tumor volumes using an active contour model and to evaluate its performance using phantom and clinical studies. Methods: MASAC, a method for automatic segmentation using an active contour model, incorporates the histogram fuzzy C-means clustering, and localized and textural information to constrain the active contour to detect boundaries in an accurate and robust manner. Moreover, the lattice Boltzmann method is used as an alternative approach for solving the level set equation to make it faster and suitable for parallel programming. Twenty simulated phantom studies and 16 clinical studies, including six cases of pharyngolaryngeal squamous cell carcinoma and ten cases of nonsmall cell lung cancer, were included to evaluate its performance. Besides, the proposed method was also compared with the contourlet-based active contour algorithm (CAC) and Schaefer’s thresholding method (ST). The relative volume error (RE), Dice similarity coefficient (DSC), and classification error (CE) metrics were used to analyze the results quantitatively. Results: For the simulated phantom studies (PSs), MASAC and CAC provide similar segmentations of the different lesions, while ST fails to achieve reliable results. For the clinical datasets (2 cases with connected high-uptake regions excluded) (CSs), CAC provides for the lowest mean RE (−8.38% ± 27.49%), while MASAC achieves the best mean DSC (0.71 ± 0.09) and mean CE (53.92% ± 12.65%), respectively. MASAC could reliably quantify different types of lesions assessed in this work with good accuracy, resulting in a mean RE of −13.35% ± 11.87% and −11.15% ± 23.66%, a mean DSC of 0.89 ± 0.05 and 0.71 ± 0.09, and a mean CE of 19.19% ± 7.89% and 53.92% ± 12.65%, for PSs and CSs, respectively. Conclusions: The authors’ results demonstrate that the developed novel PET segmentation algorithm is applicable to various types of lesions in the authors’ study and is capable of producing accurate and consistent target volume delineations, potentially resulting in reduced intraobserver and interobserver variabilities observed when using manual delineation and improved accuracy in treatment planning and outcome evaluation.

60 APPLIED LIFE SCIENCES↗

Scale-up Unlearnable Examples Learning with High-performance Computing

Recent advancements in AI models, like ChatGPT, are structured to retain user interactions, which could inadvertently include sensitive healthcare data. In the healthcare field, particularly when radiologists use AI-driven diagnostic tools hosted on online platforms, there is a risk that medical imaging data may be repurposed for future AI training without explicit consent, spotlighting critical privacy and intellectual property concerns around healthcare data usage. Addressing these privacy challenges, a novel approach known as Unlearnable Examples (UEs) has been introduced, aiming to make data unlearnable to deep learning models. A prominent method within this area, called Unlearnable Clustering (UC), has shown improved UE performance with larger batch sizes but was previously limited by computational resources (e.g., a single workstation). To push the boundaries of UE performance with theoretically unlimited resources, we scaled up UC learning across various datasets using Distributed Data Parallel (DDP) training on the Summit supercomputer. Our goal was to examine UE efficacy at high-performance computing (HPC) levels to prevent unauthorized learning and enhance data security, particularly exploring the impact of batch size on UE’s unlearnability. Utilizing the robust computational capabilities of the Summit, extensive experiments were conducted on diverse datasets such as Pets, MedMNist, Flowers, and Flowers102. Our findings reveal that both overly large and overly small batch sizes can lead to performance instability and affect accuracy. However, the relationship between batch size and unlearnability varied across datasets, highlighting the necessity for tailored batch size strategies to achieve optimal data protection. The use of Summit’s high-performance GPUs, along with the efficiency of the DDP framework, facilitated rapid updates of model parameters and consistent training across nodes. Our results underscore the critical role of selecting appropriate batch sizes based on the specific characteristics of each dataset to prevent learning and ensure data security in deep learning applications. The source code is publicly available at https: // github. com/ hrlblab/ UE_ HPC .

Zhu, Yanfan [Vanderbilt University, Nashville, TN,↗

Explicit correlation treatment of the potential energy surface of CO{sub 2} dimer

We present an extensive study of the four-dimensional potential energy surface (4D-PES) of the carbon dioxide dimer, (CO{sub 2}){sub 2}. This PES is developed over the set of intermolecular coordinates. The electronic computations are carried out at the explicitly correlated coupled cluster method with single, double, and perturbative triple excitations [CCSD(T)-F12] level of theory in connection with the augmented correlation-consistent aug-cc-pVTZ basis set. An analytic representation of the 4D-PES is derived. Our extensive calculations confirm that “Slipped Parallel” is the most stable form and that the T-shaped structure corresponds to a transition state. Later on, this PES is employed for the calculations of the vibrational energy levels of the dimer. Moreover, the temperature dependence of the dimer second virial coefficient and of the first spectral moment of rototranslational collision-induced absorption spectrum is derived. For both quantities, a good agreement is found between our values and the experimental data for a wide range of temperatures. This attests to the high quality of our PES. Generally, our PES and results can be used for modeling CO{sub 2} supercritical fluidity and examination of its role in planetary atmospheres. It can be also incorporated into dynamical computations of CO{sub 2} capture and sequestration. This allows deep understanding, at the microscopic level, of these processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Massively scalable workflows for quantum chemistry: BigChem and ChemCloud

Electronic structure theory, i.e., quantum chemistry, is the fundamental building block for many problems in computational chemistry. Here we present a new distributed computing framework (BigChem), which allows for an efficient solution of many quantum chemistry problems in parallel. BigChem is designed to be easily composable and leverages industry-standard middleware (e.g., Celery, RabbitMQ, and Redis) for distributed approaches to large scale problems. BigChem can harness any collection of worker nodes, including ones on cloud providers (such as AWS or Azure), local clusters, or supercomputer centers (and any mixture of these). BigChem builds upon MolSSI packages, such as QCEngine to standardize the operation of numerous computational chemistry programs, demonstrated here with Psi4, xtb, geomeTRIC, and TeraChem. BigChem delivers full utilization of compute resources at scale, offers a programable canvas for designing sophisticated quantum chemistry workflows, and is fault tolerant to node failures and network disruptions. We demonstrate linear scalability of BigChem running computational chemistry workloads on up to 125 GPUs. Finally, we present ChemCloud, a web API to BigChem and successor to TeraChem Cloud. ChemCloud delivers scalable and secure access to BigChem over the Internet.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A cloud computing approach to massively-parallel distributed stochastic optimization with application to geomechanical reservoir characterization

Many search strategies used to optimize parameters during hydrologic model calibration are inherently limited in that simulations must be performed sequentially in order for the algorithm to converge. As a result, the overall time required to reach a solution increases linearly with the number of steps necessary. In contrast, sampling strategies that attempt to approximate the posterior distribution of the parameters do not require the model simulations to be run in sequence and therefore invite the use of a massively parallel approach across heterogeneous computing environments. We apply a cloud computing methodology to this problem where a head node running on Amazon Web Services continuously produces candidate models that are distributed to arbitrary compute environments to run the simulation, in our case Clemson’s Palmetto cluster computer. Thus the time required to obtain a sufficient number of samples to produce an adequate approximation of the posterior distribution of the parameters is limited by the number of available compute sites. Monte Carlo sampling of the posterior space would be duplicative and inefficient, thus we combine Latin hypercube methods with genetic algorithms to ensure that no large regions of the parameter space are left unexplored, and that high probability regions are investigated thoroughly. We independently assess the fit to different types of data sets without the need to construct a single objective function. Sets of Pareto optimal models are particularly valuable when the quality and information content of data is poorly known or conceptual model errors exist in our simulation. We illustrate our approach for a problem where in situ strain data are used to calibrate the parameters of an oil reservoir in the Avant oil field in Oklahoma. We use well injection and shut-in to stress a deep (500m) confined formation, and observe the geomechanical response using borehole strainmeters installed in the shallow subsurface (30m). These data were then used to calibrate the poroelastic properties of the reservoir and caprock along with the geometry of an elliptic channel associated with the formation. Using our approach we are able to identify issues with model error as well as substantial tradeoffs that occur within the parameters.

inversion, stochastic, geomechanics, poroelastic, ↗