SEARCH · Search NASA

Results for “maximum communication volume”

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.

5 records

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Reduce Operations: Send Volume Balancing While Minimizing Latency

Communication hypergraph model was introduced in a two-phase setting for encapsulating multiple communication cost metrics (bandwidth and latency), which are proven to be important in parallelizing irregular applications. In the first phase, computational-task-to-processor assignment is performed with the objective of minimizing total volume while maintaining computational load balance. In the second phase, communication-task-to-processor assignment is performed with the objective of minimizing total number of messages while maintaining communication-volume balance. The reduce-communication hypergraph model suffers from failing to correctly encapsulate send-volume balancing. We propose a novel vertex weighting scheme that enables part weights to correctly encode send-volume loads of processors for send-volume balancing. The model also suffers from increasing the total communication volume during partitioning. To decrease this increase, we propose a method that utilizes the recursive bipartitioning framework and refines each bipartition by vertex swaps. For performance evaluation, we consider column-parallel SpMV, which is one of the most widely known applications in which the reduce-task assignment problem arises. Extensive experiments on 313 matrices show that, compared to the existing model, the proposed models achieve considerable improvements in all communication cost metrics. Furthermore, these improvements lead to an average decrease of 30% in parallel SpMV time on 512 processors for 70 matrices with high irregularity.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

A Flexible Forwarding Scheme to Improve Latency-Bound Irregular P2P Communication in MPI

We propose an algorithm to efficiently perform latency-bound communication scenarios that consist of many small messages. In these parallel scenarios, processes typically pass around a lot of small-sized messages of a few KBs of size. Performing communication operations with P2P MPI routines or collective MPI routines (including neighborhood collectives) in such scenarios may not always yield the optimal results and may not resolve the latency bottleneck. To this end, we develop a regular structure called virtual process topology (VPT) on which the messages can be communicated in a structured and controlled manner. Using parameters of this topology, one can tune the rate of aggression in tackling the latency costs. We demonstrate that our communication algorithm is preferable to MPI P2P and collective routines for latency-bound communication and it can easily be adapted only by replacing calls to MPI routines in a parallel application. We show how to adapt existing topology-aware mapping heuristics to address the volume overhead due to communicating messages on the VPT. Moreover, we propose a novel swap-based mapping heuristic to address this overhead by optimizing the maximum volume handled by a process. Experiments on synthetic communication graphs as well as real-world applications such as parallel Canonical Polyadic sparse tensor decomposition and parallel sparse matrix-dense matrix multiplication show that our approach is a powerful way of overcoming the bottlenecks posed by sparse and latency-bound irregular communication.

communication algorithm↗

DOE OSTI2020

Performance Evaluation of a Two-Dimensional Flood Model on Heterogeneous High-Performance Computing Architectures

This paper describes the implementation of a two-dimensional hydrodynamic flood model with two different numerical schemes on heterogeneous high-performance computing architectures. Both schemes were able to solve the nonlinear hyperbolic shallow water equations using an explicit upwind first-order approach on finite differences and finite volumes, respectively, and were conducted using MPI and CUDA. Four different test cases were simulated on the Summit supercomputer at Oak Ridge National Laboratory. Both numerical schemes scaled up to 128 nodes (768 GPUs) with a maximum 98.2x speedup of over 1 GPU. The lowest run time for the 10 day Hurricane Harvey event simulation at 5 meter resolution (272 million grid cells) was 50 minutes. GPUDirect communication proved to be more convenient than the standard communication strategy. Both strong and weak scaling are shown.

Sharif, Md Bulbul↗

DOE OSTI2021

Analysis of Completion Design Impact on Cluster Efficiency and Pressure-Based Well Communication in HFTS-2 Delaware Basin

The Hydraulic Fracturing Test Site 2 (HFTS-2) is a joint industry project in the Delaware basin to advance hydraulic fracturing understanding and improve productivity in shale reservoirs. The project integrates multi-disciplinary approaches to evaluate different completion designs, well spacing, inter-well communication, and stimulated rock volume, among other factors. This paper focused on two major areas related to hydraulic fracture performance. First, an analysis of different completion designs on cluster efficiency based on near well Distributed Acoustic Sensing (DAS). Second, an evaluation of well and completion designs on inter-well fracture driven interactions (FDIs) based on downhole pressure monitoring. Fluid/sand distribution and cluster efficiency analyses were based on near wellbore DAS data collected from two adjacent horizontal wells completed in two different landing zones in the Wolfcamp formation. These wells had different completion designs aiming to evaluate the effect of normal vs. extended stage lengths, perforation hole tapering and limited entry. Standard deviation from ideal fluid/sand distribution and waterfall plots were used to evaluate cluster efficiency for each design and stage. Inter-well FDIs analysis was conducted among the horizontal wells and a vertical monitor well. One horizontal well served as the monitor well while the other horizontal well was being treated. The vertical well was instrumented with downhole pressure and temperature gauges to aid monitoring fracture height growth. The pressure response during and after fracturing was characterized based on maximum pressure increase value and slope. Pressure response vs. FDIs trigger factors such distance, cluster efficiency and stage fluid volume were also analyzed. Based on the different completion and perforation designs tested, DAS analysis suggests that limited entry design worked best. Extreme limited entry showed the potential of high perforation erosion and reduced cluster efficiency. Here, the limited entry and tapered perforation design demonstrated potential to improve the cluster efficiency for extended stage lengths. Pressure monitoring across formation units proved to be critical to understand fracture interactions and fracture vertical growth. Pressure communication across different formation units during hydraulic fracturing operation indicate fractures grew upwards during Wolfcamp wells fracturing. However, this pressure communication dissipated over time. High intensity FDIs were recorded when the frac stages Downloaded from http://onepetro.org/URTECONF/proceedings-pdf/21URTC/1-21URTC/D011S018R001/2477607/urtec-2021-5289-ms.pdf/1 by Carol Worster on 28 February 2022 URTeC 5289 were closer to the pressure gauge location in the monitor wells. Some of these stages that produced high intensity FDIs also had high fluid volume per cluster and low cluster efficiency. The multi-disciplinary and high-quality data collected from HFTS-2 helped to further understand why completion approaches such as limited entry and tapered perforation design are successful in improving cluster efficiency. The DAS data combined with downhole high-resolution pressure measurements also helped to quantify the effect of lower cluster efficiency data on the incidence and intensity of FDIs.

58 GEOSCIENCES↗

DOE OSTI2022

Scalable and accurate multi-GPU-based image reconstruction of large-scale ptychography data

Abstract While the advances in synchrotron light sources, together with the development of focusing optics and detectors, allow nanoscale ptychographic imaging of materials and biological specimens, the corresponding experiments can yield terabyte-scale volumes of data that can impose a heavy burden on the computing platform. Although graphics processing units (GPUs) provide high performance for such large-scale ptychography datasets, a single GPU is typically insufficient for analysis and reconstruction. Several works have considered leveraging multiple GPUs to accelerate the ptychographic reconstruction. However, most of these works utilize only the Message Passing Interface to handle the communications between GPUs. This approach poses inefficiency for a hardware configuration that has multiple GPUs in a single node, especially while reconstructing a single large projection, since it provides no optimizations to handle the heterogeneous GPU interconnections containing both low-speed (e.g., PCIe) and high-speed links (e.g., NVLink). In this paper, we provide an optimized intranode multi-GPU implementation that can efficiently solve large-scale ptychographic reconstruction problems. We focus on the maximum likelihood reconstruction problem using a conjugate gradient (CG) method for the solution and propose a novel hybrid parallelization model to address the performance bottlenecks in the CG solver. Accordingly, we have developed a tool, called PtyGer ( Pty chographic G PU(multipl e )-based r econstruction), implementing our hybrid parallelization model design. A comprehensive evaluation verifies that PtyGer can fully preserve the original algorithm’s accuracy while achieving outstanding intranode GPU scalability.

97 MATHEMATICS AND COMPUTING↗