Search NASA⌕ Search

SEARCH · Search NASA

Results for “data locality”

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 127 records · Page 7

Consensus Control (Wind Farm Collective Yaw Control) [SWR-19-11]

Wind turbines in a wind farm typically operate individually to maximize their own performance and do not take into account information from nearby turbines. In an autonomous wind farm, enabling cooperation to achieve farm-level objectives, turbines will need to use information from nearby turbines to optimize performance, ensure resiliency when other sensors fail, and adapt to changing local conditions. A key element of achieving an autonomous wind farm is to develop algorithms that provide necessary information to ensure reliable, robust, and efficient operation of wind turbines in a wind plant using local sensor information that is already being collected, such as supervisory control and data acquisition (SCADA) data, local meteorological stations, and nearby radars/sodars/lidars. This code implements a framework for implementing an autonomous wind farm that incorporates information from local sensors in real time to better align turbines in a wind farm. Oftentimes, measurements made at an individual turbine are noisy and unreliable. By incorporating measurements from multiple nearby turbines, a more robust estimate of the wind direction can be obtained at an individual turbine. Results indicate that this estimate of the wind direction can be used to improve the turbine's knowledge of the wind direction and could decrease dynamic yaw misalignment, decrease the amount of time a turbine spends yawing due to a more robust input to the yaw controller, and increase resiliency to faulty wind-vane measurements.

King, Jennifer↗

Adapting Secure MultiParty Computation to Support Machine Learning in Radio Frequency Sensor Networks

In this project we developed and validated algorithms for privacy-preserving linear regression using a new variant of Secure Multiparty Computation (MPC) we call "Hybrid MPC" (hMPC). Our variant is intended to support low-power, unreliable networks of sensors with low-communication, fault-tolerant algorithms. In hMPC we do not share training data, even via secret sharing. Thus, agents are responsible for protecting their own local data. Only the machine learning (ML) model is protected with information-theoretic security guarantees against honest-but-curious agents. There are three primary advantages to this approach: (1) after setup, hMPC supports a communication-efficient matrix multiplication primitive, (2) organizations prevented by policy or technology from sharing any of their data can participate as agents in hMPC, and (3) large numbers of low-power agents can participate in hMPC. We have also created an open-source software library named "Cicada" to support hMPC applications with fault-tolerance. The fault-tolerance is important in our applications because the agents are vulnerable to failure or capture. We have demonstrated this capability at Sandia's Autonomy New Mexico laboratory through a simple machine-learning exercise with Raspberry Pi devices capturing and classifying images while flying on four drones.

42 ENGINEERING↗

Parallel volume ray-casting for unstructured-grid data on distributed-memory architectures

As computing technology continues to advance, computational modeling of scientific and engineering problems produces data of increasing complexity: large in size and unstructured in shape. Volume visualization of such data is a challenging problem. This paper proposes a distributed parallel solution that makes ray-casting volume rendering of unstructured-grid data practical. Both the data and the rendering process are distributed among processors. At each processor, ray-casting of local data is performed independent of the other processors. The global image composing processes, which require inter-processor communication, are overlapped with the local ray-casting processes to achieve maximum parallel efficiency. This algorithm differs from previous ones in four ways: it is completely distributed, less view-dependent, reasonably scalable, and flexible. Without using dynamic load balancing, test results on the Intel Paragon using from two to 128 processors show, on average, about 60% parallel efficiency.

Ma, Kwan-Liu↗

Extracting sea ice data from satellite SAR imagery

With the prospect operational satellite SAR's by the end of the decade, there is a clear need to develop automated algorithms for the extraction of geophysical data about sea ice from high resolution radar imagery. To this end, techniques were developed for distinguishing ice from open water and for resolving the details of deformation within areas 100 km square imaged by SEASAT SAR. The classification of ice and open water is based on the creation of two bands of lower resolution image data: local average brightness, and the local variance of brightness. In the space of these two variables, ice and open water are separated into two distinct clusters. The deformation is found on a 3.4 km mesh by local cross-correlations of the brightness. Comparison with manually determined deformation shows room for improvement in regions of high deformation by using smaller areas for cross-correlation. Th concentration and deformation data are used together to determine localized regions of the scene where open water is produced or lost.

Fily, M.↗

The Niwot Ridge Subalpine Forest US-NR1 AmeriFlux site – Part 1: Data acquisition and site record-keeping

Abstract. The Niwot Ridge Subalpine Forest AmeriFlux site (US-NR1) has been measuring eddy-covariance ecosystem fluxes of carbon dioxide, heat, and water vapor since 1 November 1998. Throughout this 17-year period there have been changes to the instrumentation and improvements to the data acquisition system. Here, in Part 1 of this three-part series of papers, we describe the hardware and software used for data-collection and metadata documentation. We made changes to the data acquisition system that aimed to reduce the system complexity, increase redundancy, and be as independent as possible from any network outages. Changes to facilitate these improvements were (1) switching to a PC/104-based computer running the National Center for Atmospheric Research (NCAR) In-Situ Data Acquisition Software (NIDAS) that saves the high-frequency data locally and over the network, and (2) time-tagging individual 10 Hz serial data samples using network time protocol (NTP) coupled to a GPS-based clock, providing a network-independent, accurate time base. Since making these improvements almost 2 years ago, the successful capture of high-rate data has been better than 99.98 %. We also provide philosophical concepts that shaped our design of the data system and are applicable to many different types of environmental data collection.

54 ENVIRONMENTAL SCIENCES↗

Robotic Mapping and Monitoring of Nuclear Infrastructure

Routine inspection of nuclear infrastructure is currently expensive and slow. To remedy this the Applied Research Center (ARC) at Florida International University (FIU) is developing a field robot capable of gathering valuable data quickly, safely, and cheaply. Motivation: Nuclear infrastructure should be inspected routinely to ensure early detection of problems. This process is expensive, hazardous, and slow. Objective: Develop a platform capable of surveying nuclear infrastructure autonomously. Discussion: The quality of the captured data depends on the success of every component of the robot. Good sensors, hardware, localization, data collection, and autonomy are required. Conclusion: This is a promising approach for surveying nuclear infrastructure. The captured data is rich with information and can be evaluated by both people and algorithms.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

I-GCN: A Graph Convolutional Network Accelerator with Runtime Locality Enhancement through Islandization

In this paper, we propose a novel hardware accelerator for GCN inference called I-GCN that significantly improves data locality and reduces unnecessary computation through a new online graph restructuring algorithm we refer to as islandization. The proposed algorithm finds clusters of nodes with strong internal but weak external connections. The islandization process yields two major benefits. First, by processing islands rather than individual nodes, there is better on-chip data reuse and fewer off-chip memory accesses. Second, there is less redundant computation as aggregation for common/shared neighbors in an island can be reused. The parallel search, identification, and leverage of graph islands are all handled purely in hardware at runtime working in an incremental pipelined manner. This is done without any preprocessing of the graph data or adjustment of the GCN model structure.

Geng, Tong↗

Performance tuning of CEED software and 1st and 2nd wave apps

The goal of this milestone was the performance tuning of the CEED software, as well as the use and tuning of CEED to accelerate the first and second wave of targeted ECP applications. In this milestone, the CEED team developed optimization techniques and tuned for performance the CEED software to accelerate the first and second wave target ECP applications. Specifically, the focus was on the following: (1) Efficient use of the memory sub-system for managing data motion and interactions among different physics packages and libraries; this included integration of the new developments in a libCEED 0.5 software release; (2) Enhancing the CEED libraries with GPU and AMD GPU support in close interaction with vendors; (3) Optimal data locality and motion, and enhanced scalability and parallelism; this included vendors interactions for improvements in data motion and making strong scaling easier and more efficient; and (4) Continue boosting performance for the first-wave and second-wave of ECP target applications, including ExaSMR, ExaWind, Urban, MARBL, E3SM, and ExaAM. A main part of this milestone was the performance tuning of the CEED first-wave and second-wave ECP applications. This included the ExaSMR application – Coupled Monte Carlo Neutronics and Fluid Flow Simulation of Small Modular Reactors (ORNL), the MARBL application – Next-Gen Multi-physics Simulation Code (LLNL), and the ExaAM ExaConstit – a miniapp for the Transforming Additive Manufacturing through Exascale Simulation applications project (ExaAM), as well as ExaWind, Urban, and E3SM. The artifacts delivered include performance improvements in CEED’s 1st and 2nd wave of applications, and tuned CEED software for various architectures through a number of backends, freely available in the CEED’s repository on GitHub. See the CEED website, http://ceed.exascaleproject.org and the CEED GitHub organization, http://github.com/ceed for more details. In addition to details and results from the above R&D efforts, in this document we are also reporting on other project-wide activities performed in Q4 of FY19 including: CEED’s third annual meeting, MFEM GPU kernels scaling improvements, libCEED 0.5 and NekRS releases, an overview paper covering latest results on a set of bake-off high-order finite element problems (BPs), and other outreach efforts.

97 MATHEMATICS AND COMPUTING↗

Predicting the 3D fatigue crack growth rate of small cracks using multimodal data via Bayesian networks: In-situ experiments and crystal plasticity simulations

Small crack propagation accounts for most of the fatigue life of engineering structures subject to high cycle fatigue loading conditions. Determining the fatigue crack growth rate of small cracks propagating into polycrystalline engineering alloys is critical to improving fatigue life predictions, thus lowering cost and increasing safety. In this work, cycle-by-cycle data of a small crack propagating in a beta metastable titanium alloy is available via phase and diffraction contrast tomography. Crystal plasticity simulations are used to supplement experimental data regarding the micromechanical fields ahead of the crack tip. Experimental and numerical results are combined into a multimodal dataset and sampled utilizing a non-local data mining procedure. Furthermore, to capture the propensity of body-centered cubic metals to deform according to the pencil-glide model, a non-local driving force is postulated. The proposed driving force serves as the basis to construct a data-driven probabilistic crack propagation framework using Bayesian networks as building blocks. The spatial correlation between the postulated driving force and experimental observations is obtained by analyzing the results of the proposed framework. Results show that the above correlation increases proportionally to the distance from the crack front until the edge of the plastic zone. Moreover, the predictions of the propagation framework show good agreement with experimental observations. Finally, we studied the interaction of a small crack with grain boundaries (GBs) utilizing various slip transmission criteria, revealing the tendency of a crack to cross a GB by propagating along the slip directions minimizing the residual Burgers vector within the GB.

36 MATERIALS SCIENCE↗

Partial differential equations preconditioner resilient to soft and hard faults

We present a domain-decomposition-based preconditioner for the solution of partial differential equations (PDEs) that is resilient to both soft and hard faults. The algorithm reformulates the PDE as a sampling problem, followed by a solution update through data manipulation that is resilient to both soft and hard faults. This reformulation allows us to recast the problem as a set of independent tasks, and exploit data locality to reduce global communication. We discuss two different parallel implementations: (a) a single program multiple data (SPMD) version based on a one-to-one mapping between subdomain and MPI processes responsible for both state and computation; and (b) an asynchronous server–client implementation where all state information is held by the servers and clients are designed solely as computational units. We present a scalability comparison of both implementations under nominal conditions, showing efficiency within ~80% for up to 12,000 cores. We present a resilience analysis under different fault scenarios based on the server–client implementation. This framework provides resiliency to hard faults such that if a client crashes, it stops asking for work, and the servers simply distribute the work among all of the other clients alive. Erroneous subdomain solves (e.g. due to soft faults) appear as corrupted data, which is either rejected if that causes a task to fail, or is seamlessly filtered out during the regression stage through a suitable noise model. Three different types of faults are modeled: hard faults modeling nodes (or clients) crashing; soft faults occurring during the communication of the tasks between server and clients; and soft faults occurring during task execution. We demonstrate the resiliency of the approach for a 2D elliptic PDE, and explore the effect of the faults at various failure rates.

97 MATHEMATICS AND COMPUTING↗

Report on the recovery of legacy 1997-1998 Depth-of-Burial / Tunnel-and-Hole-Closure explosion data from the Kazakhstan former Soviet nuclear test site, Semipalatinsk.

In 1996, negotiations between the National Nuclear Center of the Republic of Kazakhstan (NNC), the U.S. Defense Special Weapons Administration (DSWA) and the U.S. Department of Energy led to an agreement for a joint series of experiments at the former Soviet nuclear test site Semipalatinsk (STS). These experiments had a dual purpose: to close holes and tunnels originally created for the purpose of testing nuclear weapons, and to characterize explosive sources at a former nuclear test site. This report covers the recovery of legacy data from the experiments conduct in 1997 and 1998. Two teams collected data. Los Alamos National Laboratory (LANL), in collaboration with the NNC, collected the near-source (local) data out to approximately 20 km. Lamont-Doherty Earth Observatory (LDEO), with funding from Lawrence Livermore Laboratory (LLNL), also in collaboration with NNC, collected regional data, 200 – 1000 km distant, leveraging the KZ regional seismic network that LDEO had recently installed in collaboration with NNC. The two teams also worked together to some extent, regarding instrumentation and planning. This report primarily addresses the near-source data collected by the LANL/NNC team.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Investigating Access Performance of Long Time Series with Restructured Big Model Data

Data sets generated by models are substantially increasing in volume, due to increases in spatial and temporal resolution, and the number of output variables. Many users wish to download subsetted data in preferred data formats and structures, as it is getting increasingly difficult to handle the original full-size data files. For example, application research users such as those involved with wind or solar energy, or extreme weather events are likely only interested in daily or hourly model data at a single point (or for a small area) for a long time period, and prefer to have the data downloaded in a single file. With native model file structures, such as hourly data from NASA Modern-Era Retrospective analysis for Research and Applications Version-2 (MERRA-2), it may take over 10 hours for the extraction of parameters-of-interest at a single point for 30 years. The NASA Goddard Earth Sciences Data and Information Services Center (GES DISC) is exploring methods to address this particular user need. One approach is to create value-added data by reconstructing the data files. Taking MERRA-2 data as an example, we have tested converting hourly data from one-day-per-file into different data cubes, such as one-month, or one-year. Performance is compared for reading local data files and accessing data through interoperable services, such as OPeNDAP. Results show that, compared to the original file structure, the new data cubes offer much better performance for accessing long time series. We have noticed that performance is associated with the cube size and structure, the compression method, and how the data are accessed. An optimized data cube structure will not only improve data access, but also may enable better online analysis services

reanalysis↗

Secure hierarchical processing using a secure ledger

Disclosed is a system and method for processing data using blockchain technology. The system includes a memory having programmable instructions stored thereon that, when executed by a processor, cause the system to: authenticate one or more sensors in anticipation of receiving component data; receive component data, upon successful authentication; store the component data locally or to a cloud-based server and/or calculate a root value for the component data; store or embed the root value with the stored component data; condense the component data and link the condensed component data to the stored component data via the root value. The system further includes instructions to log the condensed data, including the root value, to a ledger, and to identify a tag or transaction id corresponding to the logging event for subsequent retrieval of the condensed data using the tag or transaction id.

Zhao, Wenbing↗

A Locality-Based Threading Algorithm for the Configuration-Interaction Method

The Configuration Interaction (CI) method has been widely used to solve the non-relativistic many-body Schrodinger equation. One great challenge to implementing it efficiently on manycore architectures is its immense memory and data movement requirements. To address this issue, within each node, we exploit a hybrid MPI+OpenMP programming model in lieu of the traditional flat MPI programming model. Here in this paper, we develop optimizations that partition the workloads among OpenMP threads based on data locality,-which is essential in ensuring applications with complex data access patterns scale well on manycore architectures. The new algorithm scales to 256 threadson the 64-core Intel Knights Landing (KNL) manycore processor and 24 threads on dual-socket Ivy Bridge (Xeon) nodes. Compared with the original implementation, the performance has been improved by up to 7× on theKnights Landing processor and 3× on the dual-socket Ivy Bridge node.

97 MATHEMATICS AND COMPUTING↗

GRB 180128A: A second magnetar giant flare candidate from the Sculptor Galaxy

Magnetars are slowly rotating neutron stars that possess the strongest magnetic fields known in the cosmos (10 14 − 10 15 G). They display a range of transient high-energy electromagnetic activity. The brightest and most energetic of these events are the gamma-ray bursts (GRBs) known as magnetar giant flares (MGFs), with isotropic energies E iso ≈ 10 44 − 10 46 erg. Only seven MGF detections have been made to date: three unambiguous events occurred in our Galaxy and the Magellanic Clouds, and the other four MGF candidates are associated with nearby star-forming galaxies. As all seven identified MGFs are bright at Earth, additional weaker events likely remain unidentified in archival data. We conducted a search of the Fermi Gamma-ray Burst Monitor database for candidate extragalactic MGFs and, when possible, collected localization data from the Interplanetary Network (IPN) satellites. Our search yielded one convincing event, GRB 180128A. IPN localizes this burst within NGC 253, commonly known as the Sculptor Galaxy. The event is the second MGF in modern astronomy to be associated with this galaxy and the first time two bursts have been associated with a single galaxy outside our own. Here we detail the archival search criteria that uncovered this event and its spectral and temporal properties, which are consistent with expectations for a MGF. We also discuss the theoretical implications and finer burst structures resolved from various binning methods. Our analysis provides observational evidence of an eighth identified MGF.

Trigg, Aaron C. (ORCID:000900068598728X)↗

Jet-Surface Interaction Noise from High-Aspect Ratio Nozzles: Test Summary

Noise and flow data have been acquired for a 16:1 aspect ratio rectangular nozzle exhausting near a simple surface at the NASA Glenn Research Center as part of an ongoing effort to understand, model, and predict the noise produced by current and future concept aircraft employing a tightly integrated engine airframe designs. The particular concept under consideration in this experiment is a blended-wing-body airframe powered by a series of electric fans exhausting through slot nozzle over an aft deck. The exhaust Mach number and surface length were parametrically varied during the test. Far-field noise data were acquired for all nozzle surface geometries and exhaust flow conditions. Phased-array noise source localization data and in-flow pressure data were also acquired for a subset of the isolated (no surface) and surface configurations; these measurements provide data that have proven useful for modeling the jet-surface interaction noise source and the surface effect on the jet-mixing noise in round jets. A summary of the nozzle surface geometry, flow conditions tested, and data collected are presented.

Propulsion Noise↗

Novel usage of deep learning and high-performance computing in long-baseline neutrino oscillation experiments

Mención Internacional en el título de doctorDeep-learning methods are playing a crucial role in numerous scientific and industrialapplications. Over the past two decades, these techniques have helped in the collection,reconstruction, and analysis of large data samples in particle physics experiments. Themain topic of this PhD research is the study of deep-learning techniques in long-baselineneutrino oscillation experiments. Neutrinos are mysterious light elementary particles,and their investigation is essential to shed light on some of the remaining open questionsin physics. The work presented here describes an algorithm based on a convolutionalneural network developed to provide highly accurate and efficient selections of electronneutrino and muon neutrino interactions in the Deep Underground Neutrino Experiment(DUNE). With this algorithm, the electron neutrino (antineutrino) selection efficiencypeaks at 90% (94%) and exceeds 85% (90%) for reconstructed neutrino energies between2-5 GeV. The selection efficiency for muon neutrino (antineutrino) interactions is foundto have a maximum of 96% (97%) and exceeds 90% (95%) efficiency for reconstructedneutrino energies above 2 GeV. When considering all electron neutrino and antineutrinointeractions as signal (both those appearing from oscillations and those intrinsic tothe beam), a selection purity of 90% is achieved. These event selections are criticalto maximise the sensitivity of the experiment to CP-violating effects, key to furtherunderstand the matter-antimatter asymmetry of the Universe.In high-energy physics experiments, deep learning has also been explored for producingfast simulations and physically-motivated manipulations of simulated images. Some ofthose simulations, such as the light production and detection, are very computationallyexpensive and require novel methods to produce the necessary samples while controllingthe varied underlying physics model parameters. To do so, we invented the model-assistedgenerative adversarial network (MAGAN), first validated on simple generic case studiesand then successfully applied to the DUNE photon-detector simulation.Moreover, we also developed graph neural networks for 3D-voxel classification ofambiguities and optical crosstalk for a different particle physics experiment, most preciselyfor the proposed SuperFGD. This novel 3D-granular plastic-scintillator neutrino detectorwill be used to upgrade the near detector of the T2K neutrino oscillation experiment, and our method reports efficiencies and purities of 94-96% per event in the classificationof particle track voxels.Due to the growth and complexity of deep neural networks, researchers have beeninvestigating techniques to train those networks in a more computationally-efficient way.Many efforts have been made by the community to optimise deep-learning models byparallelising or distributing their training computation across multiple devices. In thisthesis, we study an approach based on data locality for those neural networks that cannotbenefit from scaling their computation due to a significant bottleneck in the data I/O.The research also includes a detailed study on the performance of deep neural networkson hardware accelerator boards.Los métodos de aprendizaje profundo son cada vez más utilizados en numerosas aplicacionescientíficas e industriales hoy en día. Durante las dos últimas décadas, estastécnicas se han empleado en la recolección, reconstrucción y análisis de la gran cantidadde datos generados por experimentos de física de partículas. El tema principal de estatesis doctoral es el uso de estos modelos de aprendizaje profundo en experimentos defísica de neutrinos, en concreto en los experimentos de larga distancia DUNE y T2K. Losneutrinos, partículas fundamentales neutras, de las más ligeras del Universo, pueden serclave para explicar algunas de las cuestiones todavía sin resolver en física fundamental.Entre las diferentes contribuciones que esta tesis ha hecho a su estudio, cabe destacar eldesarrollo de un algoritmo basado en una red de neuronas convolucional para seleccionarcon gran eficiencia y precisión las interacciones de neutrinos electrónicos y muónicos enel Deep Underground Neutrino Experiment (DUNE). La eficiencia de selección obtenidapara neutrinos (antineutrinos) electrónicos alcanza un máximo del 90% (94%) y supera el85% (90%) para neutrinos con energías reconstruidas en el rango 2-5 GeV. La selección deneutrinos (antineutrinos) muónicos tiene una eficiencia máxima del 96% (97%) y excedeel 90% (95%) para neutrinos con energías reconstruidas de más de 2 GeV. Considerandocomo señal todas las interacciones de neutrinos y antineutrinos electrónicos (procedentestanto de oscilaciones como intrínsecos en el haz inicial), se logra una pureza en la seleccióndel 90%. Dichas selecciones de eventos son fundamentales para maximizar la sensibilidaddel experimento a los efectos de violació...

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Distributed Monitoring of the R(sup 2) Statistic for Linear Regression

The problem of monitoring a multivariate linear regression model is relevant in studying the evolving relationship between a set of input variables (features) and one or more dependent target variables. This problem becomes challenging for large scale data in a distributed computing environment when only a subset of instances is available at individual nodes and the local data changes frequently. Data centralization and periodic model recomputation can add high overhead to tasks like anomaly detection in such dynamic settings. Therefore, the goal is to develop techniques for monitoring and updating the model over the union of all nodes data in a communication-efficient fashion. Correctness guarantees on such techniques are also often highly desirable, especially in safety-critical application scenarios. In this paper we develop DReMo a distributed algorithm with very low resource overhead, for monitoring the quality of a regression model in terms of its coefficient of determination (R2 statistic). When the nodes collectively determine that R2 has dropped below a fixed threshold, the linear regression model is recomputed via a network-wide convergecast and the updated model is broadcast back to all nodes. We show empirically, using both synthetic and real data, that our proposed method is highly communication-efficient and scalable, and also provide theoretical guarantees on correctness.

Bhaduri, Kanishka↗