Search NASA⌕ Search

SEARCH · Search NASA

Results for “Data Movement”

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 19 records

Data Movement in Data-Intensive High Performance Computing.

The cost of executing a floating point operation has been decreasing for decades at a much higher rate than that of moving data. Bandwidth and latency, two key metrics that determine the cost of moving data, have degraded significantly relative to processor cycle time and execution rate. Despite the limitation of sub-micron processor technology and the end of Dennard scaling, this trend will continue in the short-term making data movement a performance-limiting factor and an energy/power efficiency concern. Even more so in the context of large-scale and data-intensive systems and workloads. This chapter gives an overview of the aspects of moving data across a system, from the storage system to the computing system down to the node and processor level, with case study and contributions from researchers at the San Diego Supercomputer Center, the Oak Ridge National Laboratory, the Pacific Northwest National Laboratory, and the University of Delaware.

Data Movement↗

A novel approach for estimating densities of secretive species from road-survey and spatial-movement data

Accurate estimates of population density are a critical component of effective wildlife conservation and management. However, many snake species are so secretive that their density cannot be determined using traditional methods such as capture–mark–recapture. Thus, the status of most terrestrial snake populations remains completely unknown. We developed a novel simulation-based technique for estimating density of secretive snakes that combined behavioural observations of snake road-crossing behaviour (crossing speed), effort-corrected road-survey data, and simulations of spatial movement patterns derived from radio-telemetry, without relying on mark–recapture. Here, we used radio-telemetry data to parameterise individual-based movement models that estimate the frequency with which individual snakes cross roads and used information on survey vehicle speed and snake crossing speed to determine the probability of detecting a snake, given that it crosses the road transect during a survey. Snake encounter frequencies during systematic road surveys were then interpreted in light of detection probabilities and simulation model results to estimate snake densities and to assess various factors likely to affect abundance estimates. We demonstrated the broad applicability of this approach through a case study of the imperiled southern hognose snake (Heterodon simus) in the North Carolina (USA) Sandhills. We estimated that H. simus occurs at average densities of 0.17 ha –1 in the North Carolina Sandhills and explored the sensitivity of this estimate to assumptions and variation in model parameters. Our novel method allowed us to generate the first abundance estimates for H. simus. We found that H. simus exists at low densities relative to congeners and other mid-sized snake species, raising concern that this species may not only have declined in geographic range, but may also occur at low densities or be declining in their strongholds, such as the North Carolina Sandhills. We present a framework for estimating density of species that have traditionally been considered too secretive to study at the population level. This method will greatly enhance our ability to study and manage a wide variety of snake species and could be applied to other secretive wildlife species that are most frequently encountered during road surveys.

59 BASIC BIOLOGICAL SCIENCES↗

HDF5 As a Vehicle for in Transit Data Movement

For in transit processing, one of the fundamental challenges is the efficient movement of data from producers to consumers. Exploiting the flexibility offered by the SENSEI generic in situ framework, we have developed a number of different in transit data transport mechanisms. In this work, we focus on the transport mechanism that leverages the HDF5 parallel I/O library, and investigate the performance characteristics of this transport mechanism. For in transit use cases at scale on HPC platforms, one might expect that an in transit data transport mechanism that uses faster layers of the storage hierarchy, such as DRAM memory, would always outperform a transport that uses slower layers of the storage hierarchy, such as an NVRAM-based persistent storage presented as a distributed file system. However, our test results show that the performance of the transport using NVRAM is competitive with the transport that uses socket-based data movement across varying levels of producer and consumer concurrency.}, booktitle = {Proceedings of the Workshop on In Situ Infrastructures for Enabling Extreme-Scale Analysis and Visualization

Gu, Junmin↗

A classification and evaluation of data movement technologies for the delivery of highly voluminous scientific data products

In this paper, we present a preliminary study of several different electronic data movement technologies. We detail our approach to classifying the technologies included in our study and present the preliminary results of some initial performance benchmarking. Our studies suggest that highly parallel TCP/IP streaming technologies, such as GridFTP and bbFTP, outperform commercial and open-source UDP-bursting technologies in several of the key data movement dimensions that we studied.

technologies↗

Milestone M7 Report: Reducing Excess Data Movement Part 2

This milestone evaluates techniques to measure and, if possible, reduce data movement across all levels of the memory hierarchy, focusing on CPU/GPU page level data movement and on intra-GPU memory hierarchy. We quantitatively evaluate the efficacy of the techniques in reducing data movement and measure how performance tracks data movement reduction. We study a small collection of benchmarks and proxy mini-apps that run on advanced pre-exascale GPUs and on the Accelsim GPU simulator. Our approach has two thrusts: to measure advanced data movement reduction directives and techniques on the newest available GPUs, and to evaluate our benchmark set on simulated GPUs configured with architectural refinements to reduce data movement. We primarily evaluated NVidia-based architectures due to the unavailability of AMD GPU hardware and tools until very recently.

97 MATHEMATICS AND COMPUTING↗

Modeling Data Movement Performance on Heterogeneous Architectures

The cost of data movement on parallel systems varies greatly with machine architecture, job partition, and nearby jobs. Performance models that accurately capture the cost of data movement provide a tool for analysis, allowing for communication bottlenecks to be pinpointed. Modern heterogeneous architectures yield increased variance in data movement as there are a number of viable paths for inter-GPU communication. In this paper, we present performance models for the various paths of inter-node communication on modern heterogeneous architectures, including the trade-off between GPUDirect communication and copying to CPUs. Furthermore, we present a novel optimization for inter-node communication based on these models, utilizing all available CPU cores per node. Finally, we show associated performance improvements for MPI collective operations.

97 MATHEMATICS AND COMPUTING↗

Milestone M6 Report: Reducing Excess Data Movement Part 1

This is the second in a sequence of three Hardware Evaluation milestones that provide insight into the following questions: What are the sources of excess data movement across all levels of the memory hierarchy, going out to the network fabric? What can be done at various levels of the hardware/software hierarchy to reduce excess data movement? How does reduced data movement track application performance? The results of this study can be used to suggest where the DOE supercomputing facilities, working with their hardware vendors, can optimize aspects of the system to reduce excess data movement. Quantitative analysis will also benefit systems software and applications to optimize caching and data layout strategies. Another potential avenue is to answer cost-benefit questions, such as those involving memory capacity versus latency and bandwidth. This milestone focuses on techniques to reduce data movement, quantitatively evaluates the efficacy of the techniques in accomplishing that goal, and measures how performance tracks data movement reduction. We study a small collection of benchmarks and proxy mini-apps that run on pre-exascale GPUs and on the Accelsim GPU simulator. Our approach has two thrusts: to measure advanced data movement reduction directives and techniques on the newest available GPUs, and to evaluate our benchmark set on simulated GPUs configured with architectural refinements to reduce data movement.

97 MATHEMATICS AND COMPUTING↗

Data Movement Categories

We have endeavored to classify the commonly seen data movement needs, as observed in data-intensive institutions (both commercial and non-profit), into four categories. Knowing how to map a data movement task into one of the four categories helps select proper data mover tools. For each category, how the data storage is involved, high-level examples and the nature of typical solutions are described. Finally, some general remarks are provided to help further orient readers new to this field - the 4th IT pillar.

99 GENERAL AND MISCELLANEOUS↗

Instrument scanning and controlling: Using eye movement data to understand pilot behavior and strategies

Eye movement data and other parameters including instrument readings, aircraft state and position variables, and control maneuvers were recorded while pilots flew ILS simulations in a B 737. The experiment itself employed seven airline pilots, each of whom flew approximately 40 approach/landing sequences. The simulator was equipped with a night visual scene but the scene was fogged out down to approximately 60 meters (200 ft). The instrument scanning appeared to follow aircraft parameters not physical position of instruments. One important implication of the results is: pilots look for categories or packets of information. Control inputs were tabulated according to throttle, wheel position, column, and pitch trim changes. Three seconds of eye movements before and after the control input were then obtained. Analysis of the eye movement data for the controlling periods showed clear patterns. The results suggest a set of miniscan patterns which are used according to the specific details of the situation. A model is developed which integrates scanning and controlling. Differentiations are made between monitoring and controlling scans.

Dick, A. O.↗

Automated Network Services for Exascale Data Movement

The Large Hadron Collider (LHC) experiments distribute data by leveraging a diverse array of National Research and Education Networks (NRENs), where experiment data management systems treat networks as a “blackbox” resource. After the High Luminosity upgrade, the Compact Muon Solenoid (CMS) experiment alone will produce roughly 0.5 exabytes of data per year. NREN Networks are a critical part of the success of CMS and other LHC experiments. However, during data movement, NRENs are unaware of data priorities, importance, or need for quality of service, and this poses a challenge for operators to coordinate the movement of data and have predictable data flows across multi-domain networks. The overarching goal of SENSE (The Software-defined network for End-to-end Networked Science at Exascale) is to enable National Labs and universities to request and provision end-to-end intelligent network services for their application workflows leveraging SDN (Software-Defined Networking) capabilities. This work aims to allow LHC Experiments and Rucio, the data management software used by CMS Experiment, to allocate and prioritize certain data transfers over the wide area network. In this paper, we will present the current progress of the integration of SENSE, Multi-domain end-to-end SDN Orchestration with QoS (Quality of Service) capabilities, with Rucio, the data management software used by CMS Experiment.

Balcas, Justas↗

Optimizing Data Movement for GPU-Based In-Situ Workflow Using GPUDirect RDMA

The extreme-scale computing landscape is increasingly dominated by GPU-accelerated systems. At the same time, in-situ workflows that employ memory-to-memory inter-application data exchanges have emerged as an effective approach for leveraging these extreme-scale systems. In the case of GPUs, GPUDirect RDMA enables third-party devices, such as network interface cards, to access GPU memory directly and has been adopted for intra-application communications across GPUs. In this paper, we present an interoperable framework for GPU-based in-situ workflows that optimizes data movement using GPUDirect RDMA. Specifically, we analyze the characteristics of the possible data movement pathways between GPUs from an in-situ workflow perspective, and design a strategy that maximizes throughput. Furthermore, we implement this approach as an extension of the DataSpaces data staging service, and experimentally evaluate its performance and scalability on a current leadership GPU cluster. The performance results show that the proposed design reduces data-movement time by up to 53% and 40% for the sender and receiver, respectively, and maintains excellent scalability for up to 256 GPUs.

Zhang, Bo↗

Time-locked time-histories - A new way of examining eye-movement data

A problem often encountered when eye-movement measurement is conducted is the choice of 'indices' or 'statistics' available to present such information. The present study reports the use of the Time-Locked Time-History as a technique of value in the examination and presentation of eye-movement data. Plots created using this technique are labeled time-locked time-histories as they illustrate subject eye lookpoint during a period of time before and after a certain time-locking event. Events that occur with some degree of repetition, such as the onset or termination of control activities, warning signals, or changes in indicator positions may be utilized as time-locking events. The present study reports the use of this technique in an eye-movement study using a secondary task in which the subject must discriminate specific types of information in the display.

Comstock, J. Raymond, Jr.↗

Geometric adjustments to account for eye eccentricity in processing horizontal and vertical eye and head movement data

Neglecting the eccentric position of the eyes in the head can lead to erroneous interpretation of ocular motor data, particularly for near targets. We discuss the geometric effects that eye eccentricity has on the processing of target-directed eye and head movement data, and we highlight two approaches to processing and interpreting such data. The first approach involves determining the true position of the target with respect to the location of the eyes in space for evaluating the efficacy of gaze, and it allows calculation of retinal error directly from measured eye, head, and target data. The second approach effectively eliminates eye eccentricity effects by adjusting measured eye movement data to yield equivalent responses relative to a specified reference location (such as the center of head rotation). This latter technique can be used to standardize measured eye movement signals, enabling waveforms collected under different experimental conditions to be directly compared, both with the measured target signals and with each other. Mathematical relationships describing these approaches are presented for horizontal and vertical rotations, for both tangential and circumferential display screens, and efforts are made to describe the sensitivity of parameter variations on the calculated results.

NASA Discipline Neuroscience↗

Optimizing the Four-Index Integral Transform Using Data Movement Lower Bounds Analysis

The four-index integral transform is a fundamental and computationally demanding calculation used in many computational chemistry suites such as NWChem. It transforms a four-dimensional tensor from an atomic basis to a molecular basis. This transformation is most efficiently implemented as a sequence of four tensor contractions that each contract a four-dimensional tensor with a two-dimensional transformation matrix. Differing degrees of permutation symmetry in the intermediate and final tensors in the sequence of contractions cause intermediate tensors to be much larger than the final tensor and limit the number of electronic states in the modeled systems. Loop fusion, in conjunction with tiling, can be very effective in reducing the total space requirement, as well as data movement. However, the large number of possible choices for loop fusion and tiling, and data/computation distribution across a parallel system, make it challenging to develop an optimized parallel implementation for the four-index integral transform. We develop a novel approach to address this problem, using lower bounds modeling of data movement complexity. We establish relationships between available aggregate physical memory in a parallel computer system and ineffective fusion configurations, enabling their pruning and consequent identification of effective choices and a characterization of optimality criteria. This work has resulted in the development of a significantly improved implementation of the four-index transform that enables higher performance and the ability to model larger electronic systems than the current implementation in the NWChem quantum chemistry software suite.

Rajbhandari, Samyam↗