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 451 records · Page 25

Quantifying Scheduling Challenges for Exascale System Software

The move towards high-performance computing (HPC) ap- plications comprised of coupled codes and the need to dra- matically reduce data movement is leading to a reexami- nation of time-sharing vs. space-sharing in HPC systems. In this paper, we discuss and begin to quantify the perfor- mance impact of a move away from strict space-sharing of nodes for HPC applications. Specifically, we examine the po- tential performance cost of time-sharing nodes between ap- plication components, we determine whether a simple coor- dinated scheduling mechanism can address these problems, and we research how suitable simple constraint-based opti- mization techniques are for solving scheduling challenges in this regime. Our results demonstrate that current general- purpose HPC system software scheduling and resource al- location systems are subject to significant performance de- ciencies which we quantify for six representative applica- tions. Based on these results, we discuss areas in which ad- ditional research is needed to meet the scheduling challenges of next-generation HPC systems.

C.1.2 [Multiprocessors]: Parallel Processors↗

Report on the ASCR Workshop on Modeling and Simulation of Exascale Systems and Applications

In the last few years, numerous studies commissioned by the Department of Energy (DOE), the Defense Advanced Research Projects Agency (DARPA), and others have examined the challenges that will have to be overcome for computational science to achieve exascale, a two order-of-magnitude increase in capability beyond what is possible today. Exponential growth in the number of devices (Moore’s Law) is expected to continue unabated, but the end of Dennard scaling, and hence the growth in performance of individual processors, has led to exponential growth in concurrency. Power consumption has also grown to the point where the cost of the electrical power for systems threatens to exceed the cost of acquiring them. Ever-shrinking devices, and the growth in their number, are expected to increase the rate of soft, or transient, errors such that applications will no longer be able to assume correct behavior of the underlying machine. Adapting to such systems will require new mathematical algorithms that minimize synchronization and data movement, and a new generation of scientific software. Rather than addressing these issues in isolation, a new process of “Co-Design” is being pursued in which application and computer scientists work toward the common goal of an exascale ecosystem of systems and applications. Modeling and simulation (ModSim) is a critical part of this process. It enables scientists and engineers to analyze future algorithms, applications, and computing systems, long before they are realized, and make the necessary design decisions such that exascale science is broadly achieved. Later, when exascale applications and systems are realized, ModSim technology will enable us to understand their behavior, debugging and optimizing them. Given the increasing importance of modeling and simulation, a workshop was organized by DOE/ASCR to assess the current state of the art and to identify research challenges that must be overcome in this field. Fifty experts, representing academia, industry, and government, participated in the workshop, and others contributed both beforehand and afterwards. This report summarizes their findings.

97 MATHEMATICS AND COMPUTING↗

Enabling Highly Efficient Capsule Networks Processing Through A PIM-Based Architecture Design

In recent years, the CNNs have achieved great successes in the image processing tasks, e.g., image recognition and object detection. Unfortunately, traditional CNN's classication is found to be easily misled by increasingly complex image features due to the usage of pooling operations, hence unable to preserve accurate position and pose information of the objects. To address this challenge, a novel neural network structure called Capsule Network has been proposed, which introduces equivariance through capsules to signicantly enhance the learning ability for image segmentation and object detection. Due to its requirement of performing a high volume of matrix operations, CapsNets have been generally accelerated on modern GPU platforms that provide highly optimized software library for common deep learning tasks. However, based on our performance characterization on modern GPUs, CapsNets exhibit low effciency due to the special program and execution features of their routing procedure, including massive unshareable intermediate variables and intensive syn- chronizations, which are very dicult to optimize at software level. To address these challenges, we propose a hybrid computing architecture design named PIM-CapsNet. It preserves GPU's on-chip computing capability for accelerating CNN types of layers in CapsNet, while pipelining with an off-chip in-memory acceleration solution that effectively tackles routing procedure's ineffciency by leveraging the processing-in-memory capability of today's 3D stacked memory. Using routing procedure's inherent parallellization feature, our design enables hierarchical improvements on CapsNet inference effciency through minimizing data movement and maximizing parallel processing in memory. Evaluation results demonstrate that our proposed design can achieve substantial improvement on both performance and energy savings for CapsNet inference, with almost zero accuracy loss. The results also suggest good performance scalability in optimizing the routing procedure with increasing network size.

Zhang, Xingyao↗

MEPHESTO: Modeling Energy-Performance in Heterogeneous SoCs and Their Trade-Offs

Integrated shared memory heterogeneous architectures are pervasive because they satisfy the diverse needs of mobile, autonomous, and edge computing platforms. Although specialized processing units (PUs) that share a unified system memory improve performance and energy efficiency by reducing data movement, they also increase contention for this memory since the PUs interact with each other. Prior work has investigated performance degradation due to memory contention, but few have studied the relationship of power and energy to memory contention. Moreover, a comprehensive solution that models memory contention for kernel placement on contemporary heterogeneous systems on chip (SoCs) in response to energy and performance has been largely unaddressed.This paper presents MEPHESTO, a novel and holistic approach for managing this balance. The authors characterize applications and PUs in terms of two memory contention factors - time factors and power factors - to achieve the desired trade-off between energy and performance for collocated kernel execution on heterogeneous systems. The authors believe that this investigation is the first to combine all of these factors and present a simple knob-based approach that expresses the target trade-off. The approach is evaluated on a diverse integrated shared memory heterogeneous system with a CPU, GPU, and programmable vision accelerator. By using an empirical model for memory contention that provides up to 92% accuracy, the kernel collocation approach can provide a near-optimal ordering and placement based on the user-defined, energy-performance trade-off parameter. Moreover, the dynamic programming-based heuristics provide up to 30% better energy or 20% performance benefits when compared with the greedy approaches commonly employed by previous studies.

Alaul haque monil, Mohammad↗

Effectively Using Remote I/O For Work Composition in Distributed Workflows

Distributed scientific workflows are becoming more important with the interest in incorporating AI into their loops. A critical programming and performance question is how to compose workflow tasks when data is produced on one system but must be consumed on another. Since the dominant technique is composition with remote I/O, this paper explores its performance expectations. We describe BigFlowSim, a workflow I/O simulator that captures key implementation choices for remote I/O, including intensity, reuse, locality, access pattern, and data movement.With BigFlowSim, we generate a synthetic benchmark. We quantify the effects of each parameter with a performance sensitivity study. We explain trends in terms of data movement reduction and show that, under certain conditions, it is possible to establish a total order among most parameters. We apply these insights to a high energy physics workflow, Belle II Monte Carlo and simulate several I/O optimizations. Speedups range from 5% to 2×, without changing compute time.

Friese, Ryan D.↗

Arrangements for communicating data in a computing system using multiple processors

Systems and methods for reducing data movement in a computer system. The systems and methods use information or knowledge about the structure of an algorithm, operations to be executed at a receiving processing unit, variables or subsets or groups of variables in a distributed algorithm, or other forms of contextual information, for reducing the number of bits transmitted from at least one transmitting processing unit to at least one receiving processing unit or storage device.

Gonzalez, Juan Guillermo↗

Report on the ASCR Workshop on Modeling and Simulation of Exascale Systems and Applications

In the last few years, numerous studies commissioned by the Department of Energy (DOE), the Defense Advanced Research Projects Agency (DARPA), and others have examined the challenges that will have to be overcome for computational science to achieve exascale, a two order-of-magnitude increase in capability beyond what is possible today. Exponential growth in the number of devices (Moore's Law) is expected to continue unabated, but the end of Dennard scaling, and hence the growth in performance of individual processors, has led to exponential growth in concurrency. Power consumption has also grown to the point where the cost of the electrical power for systems threatens to exceed the cost of acquiring them. Ever-shrinking devices, and the growth in their number, are expected to increase the rate of soft, or transient, errors such that applications will no longer be able to assume correct behavior of the underlying machine. Adapting to such systems will require new mathematical algorithms that minimize synchronization and data movement, and a new generation of scientific software. Rather than addressing these issues in isolation, a new process of "Co-Design" is being pursued in which application and computer scientists work toward the common goal of an exascale ecosystem of systems and applications. Modeling and simulation (ModSim) is a critical part of this process. It enables scientists and engineers to analyze future algorithms, applications, and computing systems, long before they are realized, and make the necessary design decisions such that exascale science is broadly achieved. Later, when exascale applications and systems are realized, ModSim technology will enable us to understand their behavior, debugging and optimizing them. Given the increasing importance of modeling and simulation, a workshop was organized by DOE/ASCR to assess the current state of the art and to identify research challenges that must be overcome in this field. Fifty experts, representing academia, industry, and government, participated in the workshop, and others contributed both beforehand and afterwards. This report summarizes their findings.

97 MATHEMATICS AND COMPUTING↗

Arrangements for communicating and processing data in a computing system

Systems and methods for reducing data movement in a computer system. The systems and methods use information or knowledge about the structure of an algorithm, operations to be executed at a receiving processing unit, variables or subsets or groups of variables in a distributed algorithm, or other forms of contextual information, for reducing the number of bits transmitted from at least one transmitting processing unit to at least one receiving processing unit or storage device.

Gonzalez, Juan Guillermo↗

Cache management based on access type priority

Systems, apparatuses, and methods for cache management based on access type priority are disclosed. A system includes at least a processor and a cache. During a program execution phase, certain access types are more likely to cause demand hits in the cache than others. Demand hits are load and store hits to the cache. A run-time profiling mechanism is employed to find which access types are more likely to cause demand hits. Based on the profiling results, the cache lines that will likely be accessed in the future are retained based on their most recent access type. The goal is to increase demand hits and thereby improve system performance. An efficient cache replacement policy can potentially reduce redundant data movement, thereby improving system performance and reducing energy consumption.

Yin, Jieming↗

The Improved Simple Corner Balance Method and Efforts to Enhance its Computational Performance

The diamond difference (DD) spatial discretization has long been a work horse of the neutron transport community. For nearly as long as DD has been used in neutron transport, it has been observed that DD produces undamped, non-physical angular fluxes in spatially under resolved problems and can fail in the thick diffusion limit. A long list of alternative spatial discretizations, all with better physics properties: accuracy, robustness, and/or preservation of the thick diffusion limit, have been proposed as alternatives to DD. Unfortunately, these alternative spatial discretizations also require significantly more floating point operations (FLOPs) per unknown compared to DD. Historically, neutron transport problems of interest have been able to be resolved sufficiently that DD is accurate enough and FLOPs have been the computational performance bottleneck controlling time to solution. Thus, in practice DD has been and remains a preferred spatial discretization for neutron transport simulations. Trends in computing architecture are leading to a new paradigm where data movement, not FLOPs will control time to solution. This presents an opportunity to improve neutron transport physics by reconsidering more FLOP intensive spatial discretization than DD without incurring a time to solution penalty. In this work, we consider the improved simple corner balance (ISCB) spatial discretization, a unique alternative to DD that has the same memory footprint as DD, and detail efforts to improve its computational performance. The ISCB spatial discretization is a more FLOP intensive spatial discretization than DD with the same memory footprint as DD. Though designed to maximize FLOP intensity, third party libraries such as LAPACK are not tuned for the unique, frequent, small linear algebra needs of neutron transport problems. While hand coding a sparse Gauss elimination is likely to be faster than a dense matrix solve (CM vs. HGE), were LAPACK suitable for small linear algebra problems, we would not have seen a performance increase with decreased numbers of LAPACK calls for the Schur complement solve (SC4 vs. SC1). Significant effort has reduced the relative compute time of ISCB to DD, but on current computer architectures DD is still faster than ISCB. Future work comparing the overall efficiency of ISCB to DD may reveal that while ISCB is slower than DD on current computers, ISCB is more accurate than DD by a factor greater than the compute time slowdown. As new computer architectures become available, we will test our hypothesis that neutron transport simulations will be bandwidth limited, ideally rendering the additional FLOPs required by ISCB to be 'free' [in terms of time to solution]. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Efficient Bulk Data Replication for the Earth System Grid

The Earth System Grid (ESG) community faces the difficult challenge of managing the distribution of massive data sets to thousands of scientists around the world. To move data replicas efficiently, the ESG has developed a data transfer management tool called the Bulk Data Mover (BDM). We describe the performance results of the current system and plans towards extending the techniques developed so far for the up- coming project, in which the ESG will employ advanced networks to move multi-TB datasets with the ulti- mate goal of helping researchers understand climate change and its potential impacts on world ecology and society.

97 MATHEMATICS AND COMPUTING↗

Assimilating electronic tagging, oceanographic modelling, and fisheries data to estimate movements and connectivity of swordfish in the North Atlantic

Abstract Broadbill swordfish (Xiphias gladius) is a key species in commercial fisheries, but management efforts continue to be hindered by data gaps in their basic biology, including ongoing debate over stock boundaries and movement between management zones. We deployed 20 pop-up satellite archival transmitting (PSAT) tags on juvenile swordfish in the Azores and adults in the northwest Atlantic (NWA). We applied a recently developed geolocation approach that synthesizes tag data with a global observation-assimilating ocean model to improve geolocation accuracy. Resulting tracks from 16 individuals averaged 3751 km (range 345–7247 km) over 93 days (range 17–181 days). Juveniles tagged in the Azores made regional movements while adults tagged in the NWA moved between summer foraging grounds near the Grand Banks to winter habitats near the Antillean Arc. All individuals spent considerable time in the mesopelagic zone during the day, and this behaviour increased with fish size. We integrate results from our PSAT-based movements with conventional tag and catch-per-unit effort data, which indicates complex stock structure within the North Atlantic that largely supports current stock boundaries. Our work demonstrates the utility in synthesizing fishery-independent electronic tag data and fisheries datasets to improve our understanding of large pelagic fish ecology.

Braun, Camrin D.↗

Eye/Brain/Task Testbed And Software

Eye/brain/task (EBT) testbed records electroencephalograms, movements of eyes, and structures of tasks to provide comprehensive data on neurophysiological experiments. Intended to serve continuing effort to develop means for interactions between human brain waves and computers. Software library associated with testbed provides capabilities to recall collected data, to process data on movements of eyes, to correlate eye-movement data with electroencephalographic data, and to present data graphically. Cognitive processes investigated in ways not previously possible.

Janiszewski, Thomas↗

Manipulator system performance measurement

Free-flying teleoperator technology for satellite servicing is reported. The rationale for a series of manipulator system tests is presented. Data are reported on movement time in a fine positioning task using two different manipulator systems. The movement time data showed reliable effects of movement direction and index of difficulty. These data were considered to be baseline performance measures for the manipulator system used and modifications to the control and visual systems were suggested for future testing.

Kirkpatrick, M., III↗

ROD INTERNAL PRESSURE QUANTIFICATION AND DISTRIBUTION ANALYSIS USING FRAPCON

The discharge rod internal pressure (RIP) and cladding hoop stress (CHS) distributions are quantified forWatts BarNuclearUnit 1 (WBN1) fuel rods by modeling core cycle design data, intercycle assembly movements, operation data (including modeling significant trips and downpowers), and as-built fuel enrichments and densities of each fuel rod in FRAPCON-3.5. An alternate model for the amount of helium released from zirconium diboride (ZrB2) integral fuel burnable absorber (IFBA) layers is derived and applied to FRAPCON output data to quantify the RIP and CHS for these fuel rods. SCALE/Polaris is used to quantify fuel rod-specific spectral quantities and the amount of gaseous fission products produced in the fuel for use in FRAPCON inputs. Fuel rods with ZrB2 IFBA layers (i.e., IFBA rods) are determined to have RIP predictions that are elevated when compared to fuel rod without IFBA layers (i.e., standard rods) despite the fact that IFBA rods often have reduced fill pressures and annular fuel blankets. Cumulative distribution functions (CDFs) are prepared from the distribution of RIP predictions for all standard and IFBA rods. The provided CDFs allow for the determination of the portion of WBN1 fuel rods that exceed a specified RIP limit. Lastly, improvements to the computational methodology of FRAPCON are proposed.

cladding hoop stress↗

Application of Optical Measurement Techniques During Stages of Pregnancy: Use of Phantom High Speed Cameras for Digital Image Correlation (D.I.C.) During Baby Kicking and Abdomen Movements

Paired images were collected using a projected pattern instead of standard painting of the speckle pattern on her abdomen. High Speed cameras were post triggered after movements felt. Data was collected at 120 fps -limited due to 60hz frequency of projector. To ensure that kicks and movement data was real a background test was conducted with no baby movement (to correct for breathing and body motion).

Gradl, Paul↗

Proactive Data Containers for Scientific Storage (Final Report)

Emerging HPC systems are expected to be deployed with an unprecedented level of complexity, due to a deep system memory/storage hierarchy and heterogeneity of the storage hardware. This hierarchy is expected to range from CPU cache through several levels of volatile memory to nonvolatile memory, traditional hard disks, and tape. Simple and efficient methods of data management and movement through this hierarchy is critical for scientific applications using exascale systems. Existing storage system and I/O (SSIO) technologies face severe challenges in dealing with these requirements. POSIX and MPI I/O standards that are the basis for existing I/O libraries and parallel file systems present fundamental challenges in the areas of scalable metadata operations, semantics-based data movement performance tuning, asynchronous operation, and support for scalable consistency of distributed operations. Moving toward new paradigms for SSIO in the extreme-scale era, we have proposed to investigate novel object-based data abstractions and storage mechanisms that take advantage of the deep storage hierarchy and enable proactive automated performance tuning. In order to achieve these overarching goals, we initiated an effort to develop a fundamental new data abstraction, called Proactive Data Containers (PDC). A PDC is a container within a locus of storage (memory, NVRAM, disk, etc.) that stores science data in an object-centric manner. Managing data as objects enables powerful optimization opportunities for data movement and transformations. The R&D focus of this project are: 1) formulation of object-oriented PDCs and their mapping in different levels of the exascale storage hierarchy; 2) efficient strategies for moving data in deep storage hierarchies using PDCs; 3) techniques for transforming and reorganizing data based on application requirements; and 4) novel analysis paradigms for enabling data transformations and user-defined analysis on data in PDCs. Toward achieving these overarching goals, we designed an object-centric application programing interface (API) for HPC, scalable metadata management for object-centric storage systems, and data movement optimizations such as Data Elevator for moving data between two levels of storage devices and TAPIOCA for efficient aggregation of data on compute nodes. We then implemented several components of the PDC system. They include metadata management, data placement services, remote procedure calls, data aggregation, etc. We have put them together into the overall PDC framework.

97 MATHEMATICS AND COMPUTING↗