SEARCH · Engineering Papers

Results for “Heterogeneous 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 559 records · Page 31

All sources NASA NTRS DOE OSTI

DOE OSTI2018

Strain heterogeneity in sheared colloids revealed by neutron scattering

Recent computational and theoretical studies have shown that the deformation of colloidal suspensions under a steady shear is highly heterogeneous at the particle level and demonstrate a critical influence on the macroscopic deformation behavior. Despite its relevance to a wide variety of industrial applications of colloidal suspensions, scattering studies focusing on addressing the heterogeneity of the non-equilibrium colloidal structure are scarce thus far. Here in this paper, we report the first experimental result using small-angle neutron scattering. From the evolution of strain heterogeneity, we conclude that the shear-induced deformation transforms from nearly affine behavior at low shear rates, to plastic rearrangements when the shear rate is high.

36 MATERIALS SCIENCE↗

NASA NTRSDate not supplied

A Partitioned - Task Parallel Implementation of the NASA Multiscale Analysis Tool for High Performance Computing

The NASA Multiscale Analysis Tool (NASMAT) is a platform for multiscale modeling of composites which can perform analysis of materials with any arbitrary number of length scales. The platform supports modularity, scalability, and interoperability using recursive procedures and data structures. A Macro solver driven parallelization scheme often limits the capability of NASMAT to scale as it has access to limited memory and number of cores (often one core/thread) and often forces to implement macro solver specific changes to the platform. In this work, a partitioned task-parallel approach is adopted, where the parallelization strategy adopted for NASMAT is independent of the macro solver and the computational resources are managed independently. The programming architecture takes into account the hierarchy of multiple scales (task-dependence) and the heterogeneous nature (dynamic load balancing) of computation through implementation of a hierarchy-informed task parallel model. The partitioned nature of the framework further extends the “plug and play” capability of NASMAT. preCICE, an open-source library for coupling multiphysics solver in a partitioned manner, is adopted to integrate NASMAT with an external macro solver by implementing a NASMAT adapter for preCICE. Speedup and scalability of the framework is studied for micromechanical models of varying size.

task-parallel↗

DOE OSTI2015

WE-EF-303-10: Single- Detector Proton Radiography as a Portal Imaging Equivalent for Proton Therapy

Purpose: In proton therapy, patient alignment is of critical importance due to the sensitivity of the proton range to tissue heterogeneities. Traditionally proton radiography is used for verification of the water-equivalent path length (WEPL), which dictates the depth protons reach. In this work we propose its use for alignment. Additionally, many new proton centers have cone-beam computed tomography in place of beamline X-ray imaging and so proton radiography offers a unique patient alignment verification similar to portal imaging in photon therapy. Method: Proton radiographs of a CIRS head phantom were acquired using the Beam Imaging System (BIS) (IBA, Louvain-la-Neuve) in a horizontal beamline. A scattered beam was produced using a small, dedicated, range modulator (RM) wheel fabricated out of aluminum. The RM wheel was rotated slowly (20 sec/rev) using a stepper motor to compensate for the frame rate of the BIS (120 ms). Dose rate functions (DRFs) over two RM wheel rotations were acquired. Calibration was made with known thicknesses of homogeneous solid water. For each pixel the time width, skewness and kurtosis of the DRFs were computed. The time width was used to compute the object WEPL. In the heterogeneous phantom, the excess skewness and excess kurtosis (i.e. difference from homogeneous cases) were computed and assessed for suitability for patient set up. Results: The technique allowed for the simultaneous production of images that can be used for WEPL verification, showing few internal details, and excess skewness and kurtosis images that can be used for soft tissue alignment. These latter images highlight areas where range mixing has occurred, correlating with phantom heterogeneities. Conclusion: The excess skewness and kurtosis images contain details that are not visible in the WET images. These images, unique to the time-resolved proton radiographic method, could be used for patient set up according to soft tissues.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2021

Recovering the effects of subgrid heterogeneity in simulations of radionuclide transport through fractured media

Groundwater flow and contaminant transport through fractured media can be simulated using Discrete Fracture Network (DFN) models which provide a natural description of structural heterogeneity. However, this approach is computationally expensive, with the large number of intersecting fractures necessitated by many real-world applications requiring modeling simplifications to be made for calculations to be tractable. Upscaling methods commonly used for this purpose can result in some loss of local-scale variability in the groundwater flow velocity field, resulting in underestimation of particle travel times, transport resistance and retention in transport calculations. In this paper, a transport downscaling algorithm to recover the transport effects of heterogeneity is tested on a synthetic Brittle Fault Zone model, motivated by the problem of large safety assessment calculations for geological repositories of spent nuclear fuel. We show that the variability in the local-scale velocity field which is lost by upscaling can be recovered by sampling from a library of DFN transport paths, accurately reproducing DFN transport statistic distributions and radionuclide breakthrough curves in an upscaled model.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2018

The research on meta-job scheduling heuristics in heterogeneous environments

As the core of rational utilization of computing resources, the scheduling algorithm has gained the interest of many researchers. Aimed at meta-job scheduling in heterogeneous environments, this paper puts forward three algorithms: the meta-job scheduling algorithm based on deviation (MaxD-min heuristic), the meta-job scheduling algorithm based on relative deviation (MaxRD-min heuristic), and the Cordwood algorithm (CA). The former two Algorithm are improvements of the classic Min-min algorithm. The latter CA algorithm is a new method that tries to place each building block on the tray with minimal amount of Sufferage. In conclusion, the result of experimenting shows that the three algorithms, in comparison to Min-Min and Max-Min algorithm, can effectively reduce the total span of scheduling (makespan).

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2015

SU-E-J-128: Two-Stage Atlas Selection in Multi-Atlas-Based Image Segmentation

Purpose: In the new era of big data, multi-atlas-based image segmentation is challenged by heterogeneous atlas quality and high computation burden from extensive atlas collection, demanding efficient identification of the most relevant atlases. This study aims to develop a two-stage atlas selection scheme to achieve computational economy with performance guarantee. Methods: We develop a low-cost fusion set selection scheme by introducing a preliminary selection to trim full atlas collection into an augmented subset, alleviating the need for extensive full-fledged registrations. More specifically, fusion set selection is performed in two successive steps: preliminary selection and refinement. An augmented subset is first roughly selected from the whole atlas collection with a simple registration scheme and the corresponding preliminary relevance metric; the augmented subset is further refined into the desired fusion set size, using full-fledged registration and the associated relevance metric. The main novelty of this work is the introduction of an inference model to relate the preliminary and refined relevance metrics, based on which the augmented subset size is rigorously derived to ensure the desired atlases survive the preliminary selection with high probability. Results: The performance and complexity of the proposed two-stage atlas selection method were assessed using a collection of 30 prostate MR images. It achieved comparable segmentation accuracy as the conventional one-stage method with full-fledged registration, but significantly reduced computation time to 1/3 (from 30.82 to 11.04 min per segmentation). Compared with alternative one-stage cost-saving approach, the proposed scheme yielded superior performance with mean and medium DSC of (0.83, 0.85) compared to (0.74, 0.78). Conclusion: This work has developed a model-guided two-stage atlas selection scheme to achieve significant cost reduction while guaranteeing high segmentation accuracy. The benefit in both complexity and performance is expected to be most pronounced with large-scale heterogeneous data.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2024

MatRIS: Addressing the Challenges for Portability and Heterogeneity Using Tasking for Matrix Decomposition (Cholesky)

The ubiquitous in-node heterogeneity of HPC and cloud computing platforms makes software portability and performance optimization extremely challenging. Described here, the MatRIS multilevel math library abstraction framework employs tasking to alleviate these difficulties. MatRIS includes the IRIS task-based runtime on the bottom level and exposes different layers of abstraction to render algorithms architecturally agnostic. MatRIS ensures the decomposition and creation of tasks that represent the necessary encapsulation of the optimized kernels from both vendor and open-source math libraries. Once built, MatRIS can select different combinations of accelerators at runtime, making it portable even on diverse heterogeneous architectures. By leveraging the IRIS runtime’s features for managing heterogeneity, MatRIS deploys algorithms that remove the need to specify orchestration and data transfer. This study describes how the serial task abstraction of a tiled Cholesky factorization is made portable and scalable in the case of multi-device and multi-vendor heterogeneity on a node with NVIDIA and AMD GPUs by using MatRIS. First, we demonstrate that Cholesky in MatRIS provides multi-GPU scalability that offers competitive performance versus cuSolverMG. Then, we present the challenges and opportunities for heterogeneous execution.

Monil, M. A. H.↗

DOE OSTI2018

An approach to quantum-computational hydrologic inverse analysis

Making predictions about flow and transport in an aquifer requires knowledge of the heterogeneous properties of the aquifer such as permeability. Computational methods for inverse analysis are commonly used to infer these properties from quantities that are more readily observable such as hydraulic head. We present a method for computational inverse analysis that utilizes a type of quantum computer called a quantum annealer. While quantum computing is in an early stage compared to classical computing, we demonstrate that it is sufficiently developed that it can be used to solve certain subsurface flow problems. We utilize a D-Wave 2X quantum annealer to solve 1D and 2D hydrologic inverse problems that, while small by modern standards, are similar in size and sometimes larger than hydrologic inverse problems that were solved with early classical computers. Our results and the rapid progress being made with quantum computing hardware indicate that the era of quantum-computational hydrology may not be too far in the future.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2020

Pre-exascale accelerated application development: The ORNL Summit experience

High-performance computing (HPC) increasingly relies on heterogeneous architectures to achieve higher performance. In the Oak Ridge Leadership Facility (OLCF), Oak Ridge, TN, USA, this trend continues as its latest supercomputer, Summit, entered production in early 2019. The combination of IBM POWER9 CPU and NVIDIA V100 GPU, along with a fast NVLink2 interconnect and other latest technologies, pushes system performance to a new height and breaks the exascale barrier by certain measures. Due to Summit's powerful GPUs and much higher GPU–CPU ratio, offloading to accelerators becomes a requirement for any application, which intends to effectively use the system. To facilitate navigating a complex landscape of competing heterogeneous architectures, a collection of applications from a wide spectrum of scientific domains is selected for early adoption on Summit. In this article, the experience and lessons learned are summarized, in the hope of providing useful guidance to address new programming challenges, such as scalability, performance portability, and software maintainability, for future application development efforts on heterogeneous HPC systems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

xSDK: Building an ecosystem of highly efficient math libraries for exascale

Current efforts to build increasingly powerful computer architectures are opening up new avenues for more complex and higher fidelity simulations coupled with data analytics and learning, leading to new scientific insights and deeper understanding. At one extreme, exascale computers will be much faster than previous computer generations (performing 10 18 operations per second—that is, 1,000 times faster than petascale). To achieve these performance improvements, computer architectures are becoming increasingly complex, with deep memory hierarchies, very high node and core counts, and heterogeneous features such as graphics processing units (GPUs). Such architectural changes impact the full breadth of computing scales, as heterogeneity pervades even current-generation laptops, workstations, and moderate-sized clusters. While emerging advanced architectures provide unprecedented opportunities, they also present significant challenges for developers of scientific applications, such as multiphysics and multiscale codes, who must adapt their software to handle disruptive changes in architectures and new programming models that have not yet stabilized. Developers must consider increasing concurrency while reducing communication and synchronization, and other complexities such as the potential for using mixed precision to leverage the compute power available in low-precision tensor cores. On one hand, developers must implement new scientific capabilities, which in turn increase code complexity. On the other hand, the codes must be ported to new architectures, requiring the inclusion of new programming models and the restructuring of code to achieve good performance. Addressing these issues is beyond the capability of any single person or team—leading to the need for collaboration among many teams, who encapsulate their expertise in reusable software and work together to create sustainable software ecosystems.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

LaRIS: Targeting Portability and Productivity for LAPACK Codes on Extreme Heterogeneous Systems by Using IRIS

In keeping with the trend of heterogeneity in high-performance computing, hardware manufacturers and vendors are developing new architectures and associated software stacks (e.g., libraries) to harness the best possible performance from commonly used kernels (e.g., linear algebra kernels). However, kernels tuned for one architecture are not portable to others. Moreover, the coexistence of different architectures in a single node makes orchestration difficult. To address these challenges, we introduce LaRIS, a portable framework for LAPACK functionalities. LaRIS ensures a separation between linear algebra algorithms and vendor-library kernels by using the IRIS run time and IRIS-BLAS library. Such abstraction at the algorithm level makes the implementation completely agnostic to the vendor library and architecture. LaRIS uses the IRIS run time to dynamically select the vendor-library kernel and suitable processor architecture at run time. Through LU factorization, we demonstrate that LaRIS can fully utilize different heterogeneous systems by launching and orchestrating different vendor-library kernels without any change in the source code.

Monil, M. A. H.↗

DOE OSTI2018

The role of defects in Fe(II) – goethite electron transfer

Despite accumulating experimental evidence for Fe(II)-Fe(III) oxide electron transfer, computational chemical calculations suggest that oxidation of sorbed Fe(II) is not energetically feasible unless defects are present. Here we used isotope specific 57Fe Mössbauer spectroscopy to investigate whether Fe(II)-goethite electron transfer is influenced by defects. Specifically, we heated the mineral to try to anneal the goethite surface and ground goethite to try to create defects. We found that heating goethite results in less oxidation of sorbed Fe(II) by goethite. When goethite was re-ground after heating, electron transfer was partially restored. X-ray absorption spectroscopy (XAS) and X-ray magnetic circular dichroism (XMCD) of heated and ground goethite confirm that heating and grinding alter the surface structure of the goethite. We propose that the heating process annealed the surface and decreased the number of sites where electron transfer could occur. Our experimental findings suggest that surface defects play an important role in Fe(II)-goethite electron transfer as suggested by computational calculations. Our finding that defects influence heterogeneous Fe(II)-goethite electron transfer has important implications for Fe(II) driven recrystallization of Fe oxides, as well as X and Y.

Notini, Luiza↗

DOE OSTI2014

Theoretical foundation for measuring the groundwater age distribution.

In this study, we use PFLOTRAN, a highly scalable, parallel, flow and reactive transport code to simulate the concentrations of 3H, 3He, CFC-11, CFC-12, CFC-113, SF6, 39Ar, 81Kr, 4He and themean groundwater age in heterogeneous fields on grids with an excess of 10 million nodes. We utilize this computational platform to simulate the concentration of multiple tracers in high-resolution, heterogeneous 2-D and 3-D domains, and calculate tracer-derived ages. Tracer-derived ages show systematic biases toward younger ages when the groundwater age distribution contains water older than the maximum tracer age. The deviation of the tracer-derived age distribution from the true groundwater age distribution increases with increasing heterogeneity of the system. However, the effect of heterogeneity is diminished as the mean travel time gets closer the tracer age limit. Age distributions in 3-D domains differ significantly from 2-D domains. 3D simulations show decreased mean age, and less variance in age distribution for identical heterogeneity statistics. High-performance computing allows for investigation of tracer and groundwater age systematics in high-resolution domains, providing a platform for understanding and utilizing environmental tracer and groundwater age information in heterogeneous 3-D systems. Groundwater environmental tracers can provide important constraints for the calibration of groundwater flow models. Direct simulation of environmental tracer concentrations in models has the additional advantage of avoiding assumptions associated with using calculated groundwater age values. This study quantifies model uncertainty reduction resulting from the addition of environmental tracer concentration data. The analysis uses a synthetic heterogeneous aquifer and the calibration of a flow and transport model using the pilot point method. Results indicate a significant reduction in the uncertainty in permeability with the addition of environmental tracer data, relative to the use of hydraulic measurements alone. Anthropogenic tracers and their decay products, such as CFC11, 3H, and 3He, provide significant constraint oninput permeability values in the model. Tracer data for 39Ar provide even more complete information on the heterogeneity of permeability and variability in the flow system than the anthropogenic tracers, leading to greater parameter uncertainty reduction.

Gardner, William Payton↗

DOE OSTI2020

Methods and Experiences for Developing Abstractions for Data-intensive, Scientific Applications

Developing software for scientific applications that require the integration of diverse types of computing, instruments, and data present challenges that are distinct from commercial software. These applications require scale, and the need to integrate various programming and computational models with evolving and heterogeneous infrastructure. Pervasive and effective abstractions for distributed infrastructures are thus critical; however, the process of developing abstractions for scientific applications and infrastructures is not well understood. While theory-based approaches for system development are suited for well-defined, closed environments, they have severe limitations for designing abstractions for scientific systems and applications. The design science research (DSR) method provides the basis for designing practical systems that can handle real-world complexities at all levels. In contrast to theory-centric approaches, DSR emphasizes both practical relevance and knowledge creation by building and rigorously evaluating all artifacts. In this work, we show how DSR provides a well-defined framework for developing abstractions and middleware systems for distributed systems. Specifically, we address the critical problem of distributed resource management on heterogeneous infrastructure over a dynamic range of scales, a challenge that currently limits many scientific applications. We use the pilot-abstraction, a widely used resource management abstraction for high-performance, high throughput, big data, and streaming applications, as a case study for evaluating the DSR activities. For this purpose, we analyze the research process and artifacts produced during the design and evaluation of the pilot-abstraction. We find DSR provides a concise framework for iteratively designing and evaluating systems. Finally, we capture our experiences and formulate different lessons learned.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2000

Performance Assessment of OVERFLOW on Distributed Computing Environment

The aerodynamic computer code, OVERFLOW, with a multi-zone overset grid feature, has been parallelized to enhance its performance on distributed and shared memory paradigms. Practical application benchmarks have been set to assess the efficiency of code's parallelism on high-performance architectures. The code's performance has also been experimented with in the context of the distributed computing paradigm on distant computer resources using the Information Power Grid (IPG) toolkit, Globus. Two parallel versions of the code, namely OVERFLOW-MPI and -MLP, have developed around the natural coarse grained parallelism inherent in a multi-zonal domain decomposition paradigm. The algorithm invokes a strategy that forms a number of groups, each consisting of a zone, a cluster of zones and/or a partition of a large zone. Each group can be thought of as a process with one or multithreads assigned to it and that all groups run in parallel. The -MPI version of the code uses explicit message-passing based on the standard MPI library for sending and receiving interzonal boundary data across processors. The -MLP version employs no message-passing paradigm; the boundary data is transferred through the shared memory. The -MPI code is suited for both distributed and shared memory architectures, while the -MLP code can only be used on shared memory platforms. The IPG applications are implemented by the -MPI code using the Globus toolkit. While a computational task is distributed across multiple computer resources, the parallelism can be explored on each resource alone. Performance studies are achieved with some practical aerodynamic problems with complex geometries, consisting of 2.5 up to 33 million grid points and a large number of zonal blocks. The computations were executed primarily on SGI Origin 2000 multiprocessors and on the Cray T3E. OVERFLOW's IPG applications are carried out on NASA homogeneous metacomputing machines located at three sites, Ames, Langley and Glenn. Plans for the future will exploit the distributed parallel computing capability on various homogeneous and heterogeneous resources and large scale benchmarks. Alternative IPG toolkits will be used along with sophisticated zonal grouping strategies to minimize the communication time across the computer resources.

Djomehri, M. Jahed↗

DOE OSTI2019

Photon Radiation Scatter from Heterogeneous Shields using Green's Functions

The effect of shielding on ionizing photon radiation can be estimated using radiation transport simulations. This report covers the methodology and implementation of using Green's Functions to pre-compute this effect, which allows the radiation field exiting a variety of shielding configurations to be quickly computed. It also covers a weighting function that makes a relatively small pre-computed library applicable to a large variety of heterogeneous shields. The method enables rapid computation of the intensity versus energy for scattered radiation exiting a variety of shield materials and thicknesses without running a full transport simulation.

61 RADIATION PROTECTION AND DOSIMETRY↗

DOE OSTI2013

Physics-based seismic hazard analysis on petascale heterogeneous supercomputers, In: SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis

We have developed a highly scalable and efficient GPU-based finite-difference code (AWP) for earthquake simulation that implements high throughput, memory locality, communication reduction and communication/computation overlap and achieves linear scalability on Cray XK7 Titan at ORNL and NCSA's Blue Waters system. We simulate realistic 0-10 Hz earthquake ground motions relevant to building engineering design using high-performance AWP. Moreover, we show that AWP provides a speedup by a factor of 110 in key strain tensor calculations critical to probabilistic seismic hazard analysis (PSHA). These performance improvements to critical scientific application software, coupled with improved co-scheduling capabilities of our workflow-managed systems, make a statewide hazard model a goal reachable with existing supercomputers. The performance improvements of GPU-based AWP are expected to save millions of core-hours over the next few years as physics-based seismic hazard analysis is developed using heterogeneous petascale supercomputers.

Computer Science↗

DOE OSTI2017

Inferring subsurface heterogeneity from push-drift tracer tests

In this study, we consider the late-time tailing in a tracer test performed with a push-drift methodology (i.e., quasi-radial injection followed by drift under natural gradient). Numerical simulations of such tests are performed on 1000 multi-Gaussian 2-D log-hydraulic conductivity field realizations of varying heterogeneity, each under eight distinct mean flow directions. The ensemble pdfs of solute return times are found to exhibit power law tails for each considered variance of the log-hydraulic conductivity field, σ$2\atop{ln K}$. The tail exponent is found to relate straightforwardly to σ$2\atop{ln K}$ and, within the parameter space we explored, to be independent of push-phase pumping rate, pumping duration, and local-scale dispersivity. We conjecture that individual push-drift tracer tests in wells with screened intervals much greater than the vertical correlation length of the aquifer will exhibit quasi-ergodicity and that their tail exponent may be used to infer σ$2\atop{ln K}$. Lastly, we calibrate a predictive relationship of this sort from our Monte Carlo study, and apply it to data from a push-drift test performed at a site of approximately known heterogeneity—closely matching the existing best estimate of heterogeneity.

58 GEOSCIENCES↗