Search NASA⌕ Search

SEARCH · Search NASA

Results for “Irregular schedules”

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.

7 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Near-Real-Time Forecast of Satellite-Based Soil Moisture Using Long Short-Term Memory with an Adaptive Data Integration Kernel

Nowcasts, or near-real-time (NRT) forecasts, of soil moisture based on the Soil Moisture Active and Passive (SMAP) mission could provide substantial value for a range of applications including hazards monitoring and agricultural planning. To provide such a NRT forecast with high fidelity, we enhanced a time series deep learning architecture, long short-term memory (LSTM), with a novel data integration (DI) kernel to assimilate the most recent SMAP observations as soon as they become available. The kernel is adaptive in that it can accommodate irregular observational schedules. Testing over the CONUS, this NRT forecast product showcases predictions with unprecedented accuracy when evaluated against subsequent SMAP retrievals. It showed smaller error than NRT forecasts reported in the literature, especially at longer forecast latency. The comparative advantage was due to LSTM’s structural improvements, as well as its ability to utilize more input variables and more training data. The DI-LSTM was compared to the original LSTM model that runs without data integration, referred to as the projection model here. We found that the DI procedure removed the autocorrelated effects of forcing errors and errors due to processes not represented in the inputs, for example, irrigation and floodplain/lake inundation, as well as mismatches due to unseen forcing conditions. The effects of this purely data-driven DI kernel are discussed for the first time in the geosciences. Furthermore, this work presents an upper-bound estimate for the random component of the SMAP retrieval error.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2024

Efficient Parallelization of Irregular Applications on GPU Architectures

With the enlarging computation capacity of general Graphics Processing Units (GPUs), leveraging GPUs to accelerate parallel applications has become a critical topic in academia and industry. However, a wide range of irregular applications with the computation-/memory-intensive nature cannot easily achieve high GPU utilization. The challenges mainly involve the following aspects: first, data dependence leads to coarse-grained kernel and inefficient parallelism; second, heavy GPU memory usage may cause frequent memory evictions and extra overhead of I/O; third, specific computation patterns produce memory redundancies; last, workload balance and data reusability conjunctly benefit the overall performance, but there may exist a dynamic trade-off between them. Targeting these challenges, this dissertation proposes multiple optimizations to accelerate two real-world applications: many-body correlation functions to simulate nuclear physics in a large-scale scientific system; the other is the eALS-based matrix factorization recommendation system. To accelerate the calculations of many-body correlation functions, this dissertation presents three frameworks in GPU memory management and multi-GPU scheduling. Firstly, an optimized systematic GPU memory management framework, MemHC, utilizes a series of new memory reduction designs in GPU memory allocation, CPU/GPU communications, and GPU memory oversubscription. Secondly, an enhanced multi-GPU scheduling framework, MICCO, particularly by taking both data dimension (e.g., data reuse and data eviction) and computation dimension into account. MICCO designs a heuristic scheduling algorithm and a machine learning-based regression model to generate the optimal settings of a proposed new concept to manage the trade-off. Thirdly, a locality-aware multi-GPU scheduling framework. This scheduler leverages pipeline batch generation with a looking-ahead strategy by building local dependency graphs for memory transfer reduction and better data reuse, achieving up to 79.92% memory cost reduction and 1.67x speedup. To parallelize the eALS-based recommendation system, this dissertation proposes an efficient CPU/GPU heterogeneous recommendation system, HEALS. HEALS employs newly designed architecture-adaptive data formats to achieve load balance and good data locality on CPU and GPU. To mitigate the data dependence, HEALS presents a CPU/GPU collaboration model for both task parallelism and data parallelism with multiple kernel computation optimizations. In summary, this dissertation efficiently accelerates two typical irregular applications on GPUs by building four frameworks, including CPU/GPU collaboration, GPU memory management, and multi-GPU scheduling.

Wang, Qihan↗
DOE OSTI2022

A Framework for Neural Network Inference on FPGA-Centric SmartNICs

FPGA-based SmartNICs offer great potential to significantly improve the performance of high-performance computing and warehouse data processing by tightly coupling support for reconfigurable data-intensive computation with cross-node communication, thereby mitigating the von Neumann bottleneck. Existing work, however, has been generally been limited in that it assumes an accelerator model where kernels are offloaded to SmartNICs, but most control tasks are left to the CPUs. This leads to frequent waiting, inferior performance, and scaling challenges. In this work, we propose a new distributive data-centric computing framework, named FCsN, for reconfigurable SmartNIC-based systems. Through a lightweight task circulation execution model and its implementation architecture, FCsN allows the complete detaching of kernel execution, control logic, system scheduling, and network communication to the SmarNICs. This boosts performance by: (i) avoiding the control dependency with CPUs and (ii) supporting streaming kernel execution and network communication at line rate and in a very fine-grained manner. We demonstrate the efficiency and flexibility of FCsN using various types of neural network applications including graph neural networks; as these last are both irregular and data intensive they offer an especially robust demonstration. Evaluations using commonly-used neural network models and graph datasets show that a system with the support of FCsN can achieve, on average, 144 speedups over the MPI-based standard CPU baselines.

Guo, Anqi↗
DOE OSTI2021

Facilitating Staging-based Unstructured Mesh Processing to Support Hybrid In-Situ Workflows

In-situ and in-transit processing alleviate the gap between the computing and I/O capabilities by scheduling data analytics close to the data source. Hybrid in-situ processing splits data analytics into two stages: the data processing that runs in-situ aims to extract regions of interest, which are then transferred to staging services for further in-transit analytics. To facilitate this type of hybrid in-situ processing, the data staging service needs to support complex intermediate data representations generated/consumed by the in-situ tasks. Unstructured (or irregular) mesh is one such derived data representation that is typically used and bridges simulation data and analytics. However, how staging services efficiently support unstructured mesh transfer and processing remains to be explored. This paper investigates design options for transferring and processing unstructured mesh data using staging services. Using polygonal mesh data as an example, we show that hybrid in-situ workflows with staging-based unstructured mesh processing can effectively support hybrid in-situ workflows, and can significantly decrease data movement overheads.

data-driven↗
DOE OSTI2022

High-Fidelity Heavy-Duty Vehicle Modeling Using Sparse Telematics Data

Heavy-duty commercial vehicles consume a significant amount of energy due to their large size and mass, directly leading to vehicle operators prioritizing energy efficiency to reduce operational costs and comply with environmental regulations. One tool that can be used for the evaluation of energy efficiency in heavy-duty vehicles is the evaluation of energy efficiency using vehicle modeling and simulation. Simulation provides a path for energy efficiency improvement by allowing rapid experimentation of different vehicle characteristics on fuel consumption without the need for costly physical prototyping. The research presented in this paper focuses on using real-world, sparsely sampled telematics data from a large fleet of heavy-duty vehicles to create high-fidelity models for simulation. Samples in the telematics dataset are collected sporadically, resulting in sparse data with an infrequent and irregular sampling rate. Captured in the dataset was geospatial information, time series measurements, and vehicle-specific metadata from a subset of 96 vehicles from varied geographic regions across North America. A series of custom algorithms was developed to process vehicle data and derive both vehicle model input parameters and representative drive cycles. Derived models provide a basis on which to simulate real-world vehicles and iterate on vehicle aerodynamics, auxiliary power loads, transmission shift schedules, and other parameters to achieve reduced fuel consumption and increase energy efficiency. Notably, these models were developed without the use of expensive field data collection, using only data collected through fleet telematics. Processed representative drive cycles are used to validate the fuel economy of derived models. The models developed through this research allow for more representative vehicle simulations with increased flexibility regarding vehicle-to-vehicle variations.

ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2021

Asynchronous distributed-memory task-parallel algorithm for compressible flows on unstructured 3D Eulerian grids

Here, we discuss the implementation of a finite element method, used to numerically solve the Euler equations of compressible flows, using an asynchronous runtime system (RTS). The algorithm is implemented for distributed-memory machines, using stationary unstructured 3D meshes, combining data-, and task-parallelism on top of the Charm++ RTS. Charm++’s execution model is asynchronous by default, allowing arbitrary overlap of computation and communication. Task-parallelism allows scheduling parts of an algorithm independently of, or dependent on, each other. Built-in automatic load balancing enables continuous redistribution of computational load by migration of work units based on real-time CPU load measurement. The RTS also features automatic checkpointing, fault tolerance, resilience against hardware failure, and supports power-, and energy-aware computation. We demonstrate scalability up to 25 x 10 9 cells at $\mathscr{O}$10 4 compute cores and the benefits of automatic load balancing for irregular workloads. The full source code with documentation is available at https://quinoacomputing.org.

42 ENGINEERING↗
DOE OSTI2023

Designing an Optimal LSST Deep Drilling Program for Cosmology with Type Ia Supernovae

The Vera C. Rubin Observatory's Legacy Survey of Space and Time (LSST) is forecast to collect a large sample of Type Ia supernovae (SNe Ia) expected to be instrumental in unveiling the nature of dark energy. The feat, however, requires accurately measuring the two components of the Hubble diagram, distance modulus and redshift. Distance is estimated from SN Ia parameters extracted from light-curve fits, where the average quality of light curves is primarily driven by survey parameters. An optimal observing strategy is thus critical for measuring cosmological parameters with high accuracy. We present in this paper a three-stage analysis to assess the impact of the deep drilling (DD) strategy parameters on three critical aspects of the survey: redshift completeness, the number of well-measured SNe Ia, and cosmological measurements. We demonstrate that the current DD survey plans (internal LSST simulations) are characterized by a low completeness (z ~ 0.55–0.65), and irregular and low cadences (several days), which dramatically decrease the size of the well-measured SN Ia sample. We propose a method providing the number of visits required to reach higher redshifts. We use the results to design a set of optimized DD surveys for SN Ia cosmology taking full advantage of spectroscopic resources for host galaxy redshift measurements. The most accurate cosmological measurements are achieved with deep rolling surveys characterized by a high cadence (1 day), a rolling strategy (at least two seasons of observation per field), and ultradeep (z ≳ 0.8) and deep (z ≳ 0.6) fields. A deterministic scheduler including a gap recovery mechanism is critical to achieving a high-quality DD survey.

79 ASTRONOMY AND ASTROPHYSICS↗