Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “data layout”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Performance of BLAS 3, FFTs and NAS Parallel Benchmarks on Cray T3D

Recently, a Cray T3D Emulator has been made available on the Cray Y-MP and C90 computers. The Pittsburgh Supercomputer Center has acquired a CRAY T3D system and many other centers like Jet Propulsion Laboratory (JPL) will have it by the end of 1994. The Cray T3D system is the firstphase system in Cray Research, Inc.'s (CRI) three-phase massively parallel processing (MPP) program. This system features a heterogeneous architecture that closely couples DEC's ALPHA microprocessors and CRI's parallel-vector technology, i.e. the Cray Y-MP and Cray C90. The Cray T3D Emulator will give prospective users a valuable experience in developing high performance applications on the MPP system. This emulator runs programs written in CRI's MPP Fortran programming model (data sharing and work sharing) or Parallel Virtual Machine (PVM) programming model. It will help the users to study data layout, data locality, and data reference patterns thereby providing feedback which will enable one to write more efficient parallel codes. An overview of the Cray T3D hardware, software, and three of its available programming models is presented.The Cray Fortran Programming Model comprising (a) Data Sharing, (b) Worksharing and (c) Message Passing, will be discussed with examples. We have also implemented distributed BLAS 3 (matrix-matrix multiplication) in data parallel model (using only CSHIFT); worksharing model using block distribution and collapsed distribution; and message passing model using PVM. We have also implemented 2D and 3D FFTs for radix-2 using PVM. The performance of NAS Parallel 'Benchmarks (NPB) on CRAY T3D will be compared with other highly parallel systems such as CM-5, Paragon, C90 etc.

Saini, Subhash↗
NASA NTRS2016

A Spatiotemporal Indexing Approach for Efficient Processing of Big Array-Based Climate Data with MapReduce

Climate observations and model simulations are producing vast amounts of array-based spatiotemporal data. Efficient processing of these data is essential for assessing global challenges such as climate change, natural disasters, and diseases. This is challenging not only because of the large data volume, but also because of the intrinsic high-dimensional nature of geoscience data. To tackle this challenge, we propose a spatiotemporal indexing approach to efficiently manage and process big climate data with MapReduce in a highly scalable environment. Using this approach, big climate data are directly stored in a Hadoop Distributed File System in its original, native file format. A spatiotemporal index is built to bridge the logical array-based data model and the physical data layout, which enables fast data retrieval when performing spatiotemporal queries. Based on the index, a data-partitioning algorithm is applied to enable MapReduce to achieve high data locality, as well as balancing the workload. The proposed indexing approach is evaluated using the National Aeronautics and Space Administration (NASA) Modern-Era Retrospective Analysis for Research and Applications (MERRA) climate reanalysis dataset. The experimental results show that the index can significantly accelerate querying and processing (10 speedup compared to the baseline test using the same computing cluster), while keeping the index-to-data ratio small (0.0328). The applicability of the indexing approach is demonstrated by a climate anomaly detection deployed on a NASA Hadoop cluster. This approach is also able to support efficient processing of general array-based spatiotemporal data in various geoscience domains without special configuration on a Hadoop cluster.

big data↗
NASA NTRS2010

Introducing Locality-Aware Computation into OpenMP

This paper presents our idea to introduce data locality feature into OpenMP. Given the facts that the memory systems are hierarchical while OpenMP is at, we believe that it is important to introduce new features to OpenMF to provide Open MP programmer capability to manage the data layout and align tasks and data as close as possible in modern architectures. We present the syntax and examples of the proposed features in this paper, and hope to enable further discussion of useful language features to keep OpenMP scalable in emerging architectures.

Huang, Lei↗
NASA NTRS1996

A Note on Interfacing Object Warehouses and Mass Storage Systems for Data Mining Applications

Data mining is the automatic discovery of patterns, associations, and anomalies in data sets. Data mining requires numerically and statistically intensive queries. Our assumption is that data mining requires a specialized data management infrastructure to support the aforementioned intensive queries, but because of the sizes of data involved, this infrastructure is layered over a hierarchical storage system. In this paper, we discuss the architecture of a system which is layered for modularity, but exploits specialized lightweight services to maintain efficiency. Rather than use a full functioned database for example, we use light weight object services specialized for data mining. We propose using information repositories between layers so that components on either side of the layer can access information in the repositories to assist in making decisions about data layout, the caching and migration of data, the scheduling of queries, and related matters.

Grossman, Robert L.↗
NASA NTRS1981

CADAT network translator

Program converts cell-net data into logic-gate models for use in test and simulation programs. Input consists of either Place, Route, and Fold (PRF) or Place-and-Route-in-Two-Dimensions (PR2D) layout data deck. Output consists of either Test Pattern Generator (TPG) or Logic-Simulation (LOGSIM) logic circuitry data deck. Designer needs to build only logic-gate-model circuit description since program acts as translator. Language is FORTRAN IV.

Pitts, E. R.↗
NASA NTRS2020

TESS Data Release Notes: Sector 21 DR 29

These Data Release Notes provide information on the processing and export of data from the Transiting Exoplanet Survey Satellite (TESS). The data products included in this data release are full frame images (FFIs), target pixel les, light curve les, collateral pixel les, cotrending basis vectors (CBVs), and Data Validation (DV) reports, time series, and associated xml les. These data products were generated by the TESS Science Processing Operations Center (SPOC, Jenkins et al., 2016) at NASA Ames Research Center from data collected by the TESS instrument, which is managed by the TESS Payload Operations Center (POC) at Massachusetts Institute of Technology (MIT). The format and content of these data products are documented in the Science Data Products Description Document (SDPDD)1. The SPOC science algorithms are based heavily on those of the Kepler Mission science pipeline, and are described in the Kepler Data Processing Handbook (Jenkins, 2017).2 The Data Validation algorithms are documented in Twicken et al. (2018) and Li et al. (2019). The TESS Instrument Handbook (Vanderspek et al., 2018) contains more information about the TESS instrument design, detector layout, data properties, and mission operations. The TESS Mission is funded by NASA's Science Mission Directorate.

Michael M. Fausnaugh↗
NASA NTRS2020

TESS Data Release Notes: Sector 24, DR35

These Data Release Notes provide information on the processing and export of data from the Transiting Exoplanet Survey Satellite (TESS). The data products included in this data release are full frame images (FFIs), target pixel fi les, light curve fi les, collateral pixel fi les, cotrending basis vectors (CBVs), and Data Validation (DV) reports, time series, and associated xml fi les. These data products were generated by the TESS Science Processing Operations Center (SPOC, Jenkins et al., 2016) at NASA Ames Research Center from data collected by the TESS instrument, which is managed by the TESS Payload Operations Center (POC) at Massachusetts Institute of Technology (MIT). The format and content of these data products are documented in the Science Data Products Description Document (SDPDD). The SPOC science algorithms are based heavily on those of the Kepler Mission science pipeline, and are described in the Kepler Data Processing Handbook (Jenkins, 2019).2 The Data Validation algorithms are documented in Twicken et al. (2018) and Li et al. (2019). The TESS Instrument Handbook (Vanderspek et al., 2018) contains more information about the TESS instrument design, detector layout, data properties, and mission operations. The TESS Mission is funded by NASA's Science Mission Directorate.

TESS↗
NASA NTRS2021

TESS Data Release Notes: Sectors 1 – 36, Multi-sector Search, DR53

These Data Release Notes provide information on the processing and export of data from the Transiting Exoplanet Survey Satellite (TESS). This data release is a combined, multi-sector transit search only. The underlying data products from individual observing sectors have been previously released. The data products included in this data release are the Data Validation (DV) reports, time series, and associated xml files for the threshold crossing events (TCEs) found by searching a combined data set including data from multiple observing sectors. These data products were generated by the TESS Science Processing Operations Center (SPOC, Jenkins et al., 2016) at NASA Ames Research Center from data collected by the TESS instrument, which is managed by the TESS Payload Operations Center (POC) at Massachusetts Institute of Technology (MIT). The format and content of these data products are documented in the Science Data Products Description Document (SDPDD)1. The SPOC science algorithms are based heavily on those of the Kepler Mission science pipeline, and are described in the Kepler Data Processing Handbook (Jenkins, 2020)2. The Data Validation algorithms are documented in Twicken et al. (2018) and Li et al. (2019). The TESS Instrument Handbook (Vanderspek et al., 2018) contains more information about the TESS instrument design, detector layout, data properties, and mission operations. The TESS Mission is funded by NASA's Science Mission Directorate.

TESS↗
NASA NTRS2019

TESS Data Release Notes: Sectors 1 – 13, Multi-Sector Search, DR20

These Data Release Notes provide information on the processing and export of data from the Transiting Exoplanet Survey Satellite (TESS). This data release is a combined, multi-sector transit search only. The underlying data products from individual observing sectors have been previously released. The data products included in this data release are the Data Validation (DV) reports, time series, and associated xml les for the threshold crossing events (TCEs) found by searching a combined data set including data from multiple observing sectors. These data products were generated by the TESS Science Processing Operations Center (SPOC, Jenkins et al., 2016) at NASA Ames Research Center from data collected by the TESS instrument, which is managed by the TESS Payload Operations Center (POC) at Massachusetts Institute of Technology (MIT). The format and content of these data products are documented in the Science Data Products Description Document (SDPDD)1. The SPOC science algorithms are based heavily on those of the Kepler Mission science pipeline, and are described in the Kepler Data Processing Handbook (Jenkins, 2017)2. The Data Validation algorithms are documented in Twicken et al. (2018) and Li et al. (2019). The TESS Instrument Handbook (Vanderspek et al., 2018)3 contains more information about the TESS instrument design, detector layout, data properties, and mission operations. The TESS Mission is funded by NASA's Science Mission Directorate.

Burke, Christopher J.↗
NASA NTRS1998

Flight Acoustics Measurement Techniques and Applications

Careful consideration must be given to data acquisition and analysis techniques in the design of experiments for the measurement of noise generated by flight vehicles. Although noise measurement locations and data reduction procedures are specified for aircraft certification by FAA and ICAO directives, for example, there are virtually no established procedures for aircraft noise measurement for other purposes. To optimize the quality and quantity of information obtained in a flight acoustics experiment, microphone layout, data acquisition, and analysis must be tailored to the specific test objective. This paper will review flight acoustics technology at NASA Langley Research Center developed over the past decade. In particular, the paper will focus on flight experiments performed for three diverse objectives: (1) research applications, such as noise prediction code validation, (2) noise impact modeling, and (3) noise abatement flight procedures. To best achieve these diverse objectives, different deployments of microphone systems on the ground are required, and different data analysis techniques are needed. In all cases, accurate positioning of the aircraft synchronized in time with the data recording is necessary. However, there are some restrictions on flight operations unique to each case for the methods to properly work.

Preisser, J. S.↗
NASA NTRSDate not supplied

Memory Optimizations for Sparse Linear Algebra on GPU Hardware

An effort to maximize memory bandwidth utilization for a sparse linear algebra kernel executing on NVIDIA® Tesla V100 and A100 Graphics Processing Units (GPUs) is described. The kernel consists of a block-sparse matrix-vector product and a series of forward/backward triangular solves. The computation is memory-bound and exhibits low arithmetic intensity. Along with a relatively small block size, the data layout poses a challenge to effectively utilize the available memory bandwidth on common GPU architectures. An earlier implementation using a warp to process a single row of the matrix was found to yield good memory performance on the V100 architecture. However, anew approach, which assigns a warp to six rows of the matrix, is proposed for the A100. In addition, two new features offered by the A100 architecture are explored.L2residency control enables a portion of theL2cache to be used for persistent data access, and the asynchronous copy instruction allows data to be loaded directly from main memory into shared memory. Demonstrations show that the new implementation improves memory bandwidth utilization from 71.5% to 81.2% of the peak available on theA100 architecture.

GPU↗
NASA NTRS1996

Distributed Large Data-Object Environments: End-to-End Performance Analysis of High Speed Distributed Storage Systems in Wide Area ATM Networks

We have developed and deployed a distributed-parallel storage system (DPSS) in several high speed asynchronous transfer mode (ATM) wide area networks (WAN) testbeds to support several different types of data-intensive applications. Architecturally, the DPSS is a network striped disk array, but is fairly unique in that its implementation allows applications complete freedom to determine optimal data layout, replication and/or coding redundancy strategy, security policy, and dynamic reconfiguration. In conjunction with the DPSS, we have developed a 'top-to-bottom, end-to-end' performance monitoring and analysis methodology that has allowed us to characterize all aspects of the DPSS operating in high speed ATM networks. In particular, we have run a variety of performance monitoring experiments involving the DPSS in the MAGIC testbed, which is a large scale, high speed, ATM network and we describe our experience using the monitoring methodology to identify and correct problems that limit the performance of high speed distributed applications. Finally, the DPSS is part of an overall architecture for using high speed, WAN's for enabling the routine, location independent use of large data-objects. Since this is part of the motivation for a distributed storage system, we describe this architecture.

Johnston, William↗
NASA NTRSDate not supplied

Visualization and 3D Mesh Generation for ASSEMBLERS Range of Motion

In an effort to create a base and foundation for ASSEMBLERS with an informed layout, data representing the range of motion of varying heights of Stewart platforms were analyzed. 3D shapes were generated first to be approximately representative of these data in the form of rotationally symmetric shells, making use of 2D alpha shapes to create a border that did not account for asymmetry inherent in the true range of motion. Further work was performed to generate mesh files more fully representative of reach, creating 3D alpha shapes based directly on point clouds generated from uniformly random platform positions. These shapes were initially not representative of the entire range of motion of a platform stack due to the low likelihood of the most extreme positions being added to a given point cloud but were more representative of the asymmetry inherent in the possible positions of a Stewart platform as they no longer relied on a single 2D contour. The same algorithm for generating 3D alpha shapes was then applied to point clouds designed to represent extreme positions, generating larger smooth shells with six clear planes of symmetry. All shells were converted to STLs to aid in further modeling of range of motion for base layouts and in visualizing reachable area for varying stack heights, successfully creating closed shells representative of typical and extreme positions for platform stacks of varying heights.

Jonah DeGuire Vanke↗
NASA NTRS1992

AMR on the CM-2

We describe the development of a structured adaptive mesh algorithm (AMR) for the Connection Machine-2 (CM-2). We develop a data layout scheme that preserves locality even for communication between fine and coarse grids. On 8K of a 32K machine we achieve performance slightly less than 1 CPU of the Cray Y-MP. We apply our algorithm to an inviscid compressible flow problem.

Berger, Marsha J.↗
NASA NTRSDate not supplied

Performance and Portability of a Linear Solver Across Emerging Architectures

A linear solver algorithm used by a large-scale unstructured-grid computational fluid dynamics application is examined for a broad range of familiar and emerging architectures. Efficient implementation of a linear solver is challenging on recent CPUs offering vector architectures. Vector loads and stores are essential to effectively utilize available memory bandwidth on CPUs, and maintaining performance across different CPUs can be difficult in the face of varying vector lengths offered by each. A similar challenge occurs on GPU architectures, where it is essential to have coalesced memory accesses to utilize memory bandwidth effectively. In this work, we demonstrate that restructuring a computation, and possibly data layout, with regard to architecture is essential to achieve optimal performance by establishing a performance benchmark for each target architecture in a low level language such as vector intrinsics or CUDA. In doing so, we demonstrate how a linear solver kernel can be mapped to Intel® Xeon™ and Xeon Phi™, Marvell® ThunderX2®, NEC® SX-Aurora™ TSUBASA Vector Engine, and NVIDIA® and AMD® GPUs. We further demonstrate that the required code restructuring can be achieved in higher level programming environments such as OpenACC, OCCA, and Intel® OneAPI™/SYCL, and that each generally results in optimal performance on the target architecture. Relative performance metrics for all implementations are shown, and subjective ratings for ease of implementation and optimization are suggested.

Programming models↗
NASA NTRS1977

A layout designer's data projection reticle

The designer's projection reticle is a modified surplus weapons sighting device consisting of a 3.5 cm diameter, 8.9 focal length coated objective lens. It is placed 1.5 cm in front of a clear flat glass plate on which the aluminized reflective pattern has been deposited. Reflected light passes through the objective lens, off the front surface of the coating, and off the rear coated surface of the objective lens. Several reticle patterns have been designed and tested, and other patterns are in the planning stage. The device may be used for a variety of applications including determining the optimum locations on a cockpit panel for luminous warning indicators requiring rapid manual responses.

Haines, R. F.↗
NASA NTRS1994

High Performance FORTRAN

High performance FORTRAN is a set of extensions for FORTRAN 90 designed to allow specification of data parallel algorithms. The programmer annotates the program with distribution directives to specify the desired layout of data. The underlying programming model provides a global name space and a single thread of control. Explicitly parallel constructs allow the expression of fairly controlled forms of parallelism in particular data parallelism. Thus the code is specified in a high level portable manner with no explicit tasking or communication statements. The goal is to allow architecture specific compilers to generate efficient code for a wide variety of architectures including SIMD, MIMD shared and distributed memory machines.

Mehrotra, Piyush↗