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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Integrating Asynchronous Task Parallelism with OpenSHMEM, In: OpenSHMEM 2016: OpenSHMEM and Related Technologies. Enhancing OpenSHMEM for Hybrid Environments

Partitioned Global Address Space (PGAS) programming models combine shared and distributed memory features, and provide a foundation for high-productivity parallel programming using lightweight one-sided communications. The OpenSHMEM programming interface has recently begun gaining popularity as a lightweight library-based approach for developing PGAS applications, in part through its use of a symmetric heap to realize more efficient implementations of global pointers than in other PGAS systems. However, current approaches to hybrid inter-node and intra-node parallel programming in OpenSHMEM rely on the use of multithreaded programming models (e.g., pthreads, OpenMP) that harness intra-node parallelism but are opaque to the OpenSHMEM runtime. This OpenSHMEM+X approach can encounter performance challenges such as bottlenecks on shared resources, long pause times due to load imbalances, and poor data locality. Furthermore, OpenSHMEM+X requires the expertise of hero-level programmers, compared to the use of just OpenSHMEM. All of these are hard challenges to mitigate with incremental changes. This situation will worsen as computing nodes increase their use of accelerators and heterogeneous memories.

Computer Science↗
DOE OSTI2019

Structure of anomalies of 4d SCFTs from M5-branes, and anomaly inflow

We study the ’t Hooft anomalies of four-dimensional superconformal field theories that arise from M5-branes wrapped on a punctured Riemann surface. In general there are two independent contributions to the anomalies. There is a bulk term obtained by integrating the anomaly polynomial of the world-volume theory on the M5-branes over the Riemann surface; this contribution knows about the punctures only through its dependence on the Euler characteristic of the surface. The second set of contributions comes from local data at the punctures; these terms are independent from the bulk data of the surface. Using anomaly inflow in M-theory, we describe the general structure of the anomalies for cases when the four-dimensional theories preserve N=2 supersymmetry. We additionally discuss the anomalies corresponding to (p, q) punctures in N=1 theories.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Root identification in minirhizotron imagery with multiple instance learning

In this study, multiple instance learning (MIL) algorithms to automatically perform root detection and segmentation in minirhizotron imagery using only image-level labels are proposed. Root and soil characteristics vary from location to location, and thus, supervised machine learning approaches that are trained with local data provide the best ability to identify and segment roots in minirhizotron imagery. However, labeling roots for training data (or otherwise) is an extremely tedious and time-consuming task. This paper aims to address this problem by labeling data at the image level (rather than the individual root or root pixel level) and train algorithms to perform individual root pixel level segmentation using MIL strategies. Three MIL methods (multiple instance adaptive cosine coherence estimator, multiple instance support vector machine, multiple instance learning with randomized trees) were applied to root detection and compared to non-MIL approaches. The results show that MIL methods improve root segmentation in challenging minirhizotron imagery and reduce the labeling burden. In our results, multiple instance support vector machine outperformed other methods. The multiple instance adaptive cosine coherence estimator algorithm was a close second with an added advantage that it learned an interpretable root signature which identified the traits used to distinguish roots from soil and did not require parameter selection.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2018

Automated Segmentation and Quantification of Drusen in Fundus and Optical Coherence Tomography Images for Detection of ARMD

Age-related macular degeneration (ARMD) is one of the most common retinal syndromes that occurs in elderly people. Different eye testing techniques such as fundus photography and optical coherence tomography (OCT) are used to clinically examine the ARMD-affected patients. Many researchers have worked on detecting ARMD from fundus images, few of them also worked on detecting ARMD from OCT images. However, there are only few systems that establish the correspondence between fundus and OCT images to give an accurate prediction of ARMD pathology. In this paper, we present fully automated decision support system that can automatically detect ARMD by establishing correspondence between OCT and fundus imagery. The proposed system also distinguishes between early, suspect and confirmed ARMD by correlating OCT B-scans with respective region of the fundus image. In first phase, proposed system uses different B-scan based features along with support vector machine (SVM) to detect the presence of drusens and classify it as ARMD or normal case. In case input OCT scan is classified as ARMD, region of interest from corresponding fundus image is considered for further evaluation. The analysis of fundus image is performed using contrast enhancement and adaptive thresholding to detect possible drusens from fundus image and proposed system finally classified it as early stage ARMD or advance stage ARMD. The proposed system is tested on local data set of 100 patients with100 fundus images and 6800 OCT B-scans. Proposed system detects ARMD with the accuracy, sensitivity, and specificity ratings of 98.0, 100, and 97.14%, respectively.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2023

Modeling the 4D discharge of lithium-ion batteries with a multiscale time-dependent deep learning framework

The lithium-ion battery (LIB) field is moving towards the direction of investigating spatially resolved physical phenomena in the 3D porous microstructure of electrodes. These pore-scale simulations give new insights into the local dynamics of lithiation/de-lithiation and charge transport, Nevertheless, the computational time of these simulations limits the integration of these models in optimization workflows of cycling conditions or electrode manufacturing processes. Machine learning models present a way of assessing in real-time the performance of materials. While several successful techniques for replicating simulations with machine learning have been proposed, this case study presents a more demanding problem, due to the necessity of understanding the behavior of heterogeneous 3D local data, as it evolves in time: this poses both a scientific and a technical challenge. To this end, we propose an autoregressive multiscale convolutional neural network model to predict relevant quantities at the pore-scale in the solid phase: the lithium concentration (in the active material) and potential (in the active material and carbon binder). Here, these are ultimately used to reconstruct the battery discharge curve. 3D images of the electrode microstructures are the input to the network, trained with a dataset of finite element method simulations to predict the discharge behavior of the cathode side in lithium ion batteries. We propose this machine learning model as a proof-of-concept of the applicability of multiscale networks for time-dependent physics problems. The trained model exhibits very high accuracy (with errors lower than 2 %) in forecasting the discharge behavior of new unseen cathodes.

25 ENERGY STORAGE↗
DOE OSTI2020

A high-temperature mixed potential CO gas sensor for in situ combustion control

An in situ, accurate and robust sensor that can sustain a high temperature of above 1000 °C is needed for on-site combustion monitoring because it can give real-time and local data to the control system to adjust the overall combustion efficiency. In this work, we find that nickel oxide (NiO) is a promising sensing material for CO which is a direct indicator of the status of the combustion process of a power plant. Under the conditions of 0.5–3% O 2 and 1000 °C, the fabricated yttrium-stabilized zirconia (YSZ)-based mixed potential sensor using porous NiO demonstrates good sensitivity to CO, showing a signal as high as 36 mV to 1000 ppm CO. The effects of gas transport, structure and geometry of the NiO electrode on the sensing performance are studied. Results show that fast gas transport is much beneficial to improved sensitivity. NiO having a porous structure is much more sensitive to CO than that having a dense structure. But the t90 (time to achieve 90% final signal magnitude) of the former is much longer due to slower gas diffusion inside the pores. It's worth noting that the NiO sensor exhibits a positive relationship with the CO content, opposite to other reported results of mixed potential sensors to detect CO. We find that this might be due to the electrochemical reduction, instead of oxidation of CO during the interaction with NiO at 1000 °C. Selectivity tests on how CO 2 , CH 4 and steam affect CO sensing are also demonstrated. NiO is insensitive to even 10% CO 2 . CH 4 does not shift the average value of the CO sensing response. However, it makes the sensing signal fluctuate more intensively. 2% steam exerts a great influence on NiO sensitivity to CO: it magnifies the sensitivity of the porous NiO electrode to a low CO range of 0–100 ppm, but inhibits its sensitivity to a CO range of 100 ppm to 1000 ppm. Lastly, an 11 day stability test demonstrates the promising stability property of the proposed NiO-based YSZ sensor.

20 FOSSIL-FUELED POWER PLANTS↗
DOE OSTI2017

Performance of GeantV EM Physics Models

The recent progress in parallel hardware architectures with deeper vector pipelines or many-cores technologies brings opportunities for HEP experiments to take advantage of SIMD and SIMT computing models. Launched in 2013, the GeantV project studies performance gains in propagating multiple particles in parallel, improving instruction throughput and data locality in HEP event simulation on modern parallel hardware architecture. Due to the complexity of geometry description and physics algorithms of a typical HEP application, performance analysis is indispensable in identifying factors limiting parallel execution. In this report, we will present design considerations and preliminary computing performance of GeantV physics models on coprocessors (Intel Xeon Phi and NVidia GPUs) as well as on mainstream CPUs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

A case study evaluating the portability of an executable computable phenotype algorithm across multiple institutions and electronic health record environments

Abstract Electronic health record (EHR) algorithms for defining patient cohorts are commonly shared as free-text descriptions that require human intervention both to interpret and implement. We developed the Phenotype Execution and Modeling Architecture (PhEMA, http://projectphema.org) to author and execute standardized computable phenotype algorithms. With PhEMA, we converted an algorithm for benign prostatic hyperplasia, developed for the electronic Medical Records and Genomics network (eMERGE), into a standards-based computable format. Eight sites (7 within eMERGE) received the computable algorithm, and 6 successfully executed it against local data warehouses and/or i2b2 instances. Blinded random chart review of cases selected by the computable algorithm shows PPV ≥90%, and 3 out of 5 sites had >90% overlap of selected cases when comparing the computable algorithm to their original eMERGE implementation. This case study demonstrates potential use of PhEMA computable representations to automate phenotyping across different EHR systems, but also highlights some ongoing challenges.

Pacheco, Jennifer A.↗
DOE OSTI2020

Constraining the destruction rate of K 40 in stellar nucleosynthesis through the study of the Ar 40 ( p , n ) K 40 reaction

Background: We present that K 40 plays a significant role in the radiogenic heating of Earth-like exoplanets, which can affect the development of a habitable environment on their surfaces. The initial amount of K 40 in the interior of these planets depends on the composition of the interstellar clouds from which they formed. Within this context, nuclear reactions that regulate the production of K 40 during stellar evolution can play a critical role. Purpose: In this study, we constrain for the first time the astrophysical reaction rate of K 40 ( n , p ) Ar 40 , which is responsible for the destruction of K 40 during stellar nucleosynthesis. We provide to the nuclear physics community high-resolution data on the cross section and angular distribution of the Ar 40 ( p , n ) K 40 reaction. These are important to various applications involving Ar 40 . The associated reaction rate of the Ar 40 ( p , n ) K 40 process addresses a reaction rate gap in the Joint Institute for Nuclear Astrophysics REACLIB database in the region of intermediate-mass isotopes. Methods: We performed differential cross-section measurements on the Ar 40 ( p , n ) K 40 reaction, for six energies in the center-of-mass system between 3.2 and 4.0 MeV and various angles between 0 ° and 135 ° . The experiment took place at the Edwards Accelerator Laboratory at Ohio University using the beam swinger target location and a standard neutron time-of-flight technique. We extracted total and partial cross sections by integrating the double differential cross sections we measured. Results: The total and partial cross sections varied with energy due to the contribution from isobaric analog states and Ericson type fluctuations. The energy-averaged neutron angular distributions were symmetrical relative to 90 ° . Based on the experimental data, local transmission coefficients were extracted and were used to calculate the astrophysical reaction rates of Ar 40 ( p , n ) K 40 and K 40 ( n , p ) Ar 40 reactions. The new rates were found to vary significantly from the theoretical rates in the REACLIB library. We implemented the new rates in network calculations to study nucleosynthesis via the slow neutron capture process, and we found that the produced abundance of K 40 is reduced by up to 10% compared to calculations with the library rates. At the same time, the above result removes a significant portion of the previous theoretical uncertainty on the K 40 yields from stellar evolution calculations. Conclusions: Our results support a destruction rate of K 40 in massive stars via the K 40 ( n , p ) Ar 40 reaction that is larger compared to previous estimates. The rate of K 40 destruction via the K 40 ( n , p ) Ar 40 reaction now has a dramatically reduced uncertainty based on our measurement. Lastly, this result directly affects the predicted stellar yields of K 40 from nucleosynthesis, which is a critical input parameter for the galactic chemical evolution models that are currently employed for the study of significant properties of exoplanets.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Dynamical Sketching for Enhanced Communication Efficiency in Federated Learning

Federated learning (FL) has revolutionized distributed machine learning by enabling collaborative model training without sharing local data. However, communication efficiency and privacy guarantees remain significant challenges. This paper introduces a dynamic sketching mechanism in FL, optimizing the trade-off between communication efficiency and model accuracy. By dynamically selecting the sketch matrix size, our approach adapts to the evolving characteristics of the data and the model, ensuring optimal performance across diverse scenarios. We leverage Bayesian optimization to systematically tune the sketch parameters, achieving an effective balance between resource efficiency and model performance. Experimental results on the MNIST dataset using a convolutional neural network (CNN) architecture validate the proposed method's efficiency and scalability. Our dynamic sketching approach significantly outperforms fixed-size sketching techniques, achieving higher compression ratios (up to 62x) and providing better privacy guarantees while maintaining high model accuracy. These findings highlight the robustness and versatility of our approach and make it a valuable solution for privacy-preserving, communication-efficient federated learning.

Afrose, Sharmin [ORNL]↗
DOE OSTI2016

Flexible Data-Aware Scheduling for Workflows over an In-Memory Object Store

This paper explores novel techniques for improving the performance of many-task workflows based on the Swift scripting language. We propose novel programmer options for automated distributed data placement and task scheduling. These options trigger a data placement mechanism used for distributing intermediate workflow data over the servers of Hercules, a distributed key-value store that can be used to cache file system data. We demonstrate that these new mechanisms can significantly improve the aggregated throughput of many-task workflows with up to 86x, reduce the contention on the shared file system, exploit the data locality, and trade off locality and load balance.

Duro, Francisco Rodrigo↗
DOE OSTI2017

Generating Performance Models for Irregular Applications

Many applications have irregular behavior --- non-uniform input data, input-dependent solvers, irregular memory accesses, unbiased branches --- that cannot be captured using today's automated performance modeling techniques. We describe new hierarchical critical path analyses for the \Palm model generation tool. To create a model's structure, we capture tasks along representative MPI critical paths. We create a histogram of critical tasks with parameterized task arguments and instance counts. To model each task, we identify hot instruction-level sub-paths and model each sub-path based on data flow, instruction scheduling, and data locality. We describe application models that generate accurate predictions for strong scaling when varying CPU speed, cache speed, memory speed, and architecture. We present results for the Sweep3D neutron transport benchmark; Page Rank on multiple graphs; Support Vector Machine with pruning; and PFLOTRAN's reactive flow/transport solver with domain-induced load imbalance.

analytical performance models↗
DOE OSTI2020

SQUARE: Strategic Quantum Ancilla Reuse for Modular Quantum Programs via Cost-Effective Uncomputation

Compiling high-level quantum programs to machines that are size constrained (i.e. limited number of quantum bits) and time constrained (i.e. limited number of quantum operations) is challenging. In this paper, we present SQUARE (Strategic QUantum Ancilla REuse), a compilation infrastructure that tackles allocation and reclamation of scratch qubits (called ancilla) in modular quantum programs. At its core, SQUARE strategically performs uncomputation to create opportunities for qubit reuse. Current Noisy Intermediate-Scale Quantum (NISQ) computers and forward-looking Fault-Tolerant (FT) quantum computers have fundamentally different constraints such as data locality, instruction parallelism, and communication overhead. Our heuristic-based ancilla-reuse algorithm balances these considerations and fits computations into resource-constrained NISQ or FT quantum machines, throttling parallelism when necessary. To precisely capture the workload of a program, we propose an improved metric, the "active quantum volume," and use this metric to evaluate the effectiveness of our algorithm. Furthermore, our results show that SQUARE improves the average success rate of NISQ applications by 1.47X. Surprisingly, the additional gates for uncomputation create ancilla with better locality, and result in substantially fewer swap gates and less gate noise overall. SQUARE also achieves an average reduction of 1.5X (and up to 9.6X) in active quantum volume for FT machines.

compiler optimization↗
DOE OSTI2021

A High Performance Sparse Tensor Algebra Compiler in MLIR

Sparse tensor algebra is widely used in many applications, including scientific computing, machine learning, and data analytics. The performance of sparse tensor algebra kernels strongly depends on the intrinsic characteristics of the input tensors, hence many storage formats are designed for tensors to achieve optimal performance for particular applications/architectures, which makes it challenging to implement and optimize every tensor operation of interest on a given architecture. We propose a tensor algebra domain-specific language (DSL) and compiler framework to automatically generate kernels for mixed sparse-dense tensor algebra operations. The proposed DSL provides high-level programming abstractions that resemble the familiar Einstein notation to represent tensor algebra operations. The compiler introduces a new Sparse Tensor Algebra dialect built on top of LLVM's extensible MLIR compiler infrastructure for efficient code generation while covering a wide range of tensor storage formats. Our compiler also leverages input-dependent code optimization to enhance data locality for better performance. Our results show that the performance of automatically generated kernels outperforms the state-of-the-art sparse tensor algebra compiler, with up to 20.92x, 6.39x, and 13.9x performance improvement over state-of-the-art tensor algebra compilers, for parallel SpMV, SpMM, and TTM, respectively.

Tian, Ruiqin↗
DOE OSTI2016

Efficient Unsteady Flow Visualization with High-Order Access Dependencies

We present a novel high-order access dependencies based model for efficient pathline computation in unsteady flow visualization. By taking longer access sequences into account to model more sophisticated data access patterns in particle tracing, our method greatly improves the accuracy and reliability in data access prediction. In our work, high-order access dependencies are calculated by tracing uniformly-seeded pathlines in both forward and backward directions in a preprocessing stage. The effectiveness of our proposed approach is demonstrated through a parallel particle tracing framework with high-order data prefetching. Results show that our method achieves higher data locality and hence improves the efficiency of pathline computation.

Zhang, Jiang↗
DOE OSTI2024

Shifting Between Compute and Memory Bounds: A Compression-Enabled Roofline Model

In the evolving landscape of high-performance computing, especially to fight the end of Moore’s Law and Dennard’s Scaling, the ability to shift between compute-bound and memory-bound states is critical for enhancing adaptability and flexibility to diverse system and domain-specific architectures. Such capability is vital for optimizing performance across distinguished hardware configurations, such as accelerators, memory hierarchies, and cache systems. Despite that ad hoc optimization techniques, such as compressed/approximate computation, have been enabled for compute-/data-intensive computing for improved performance in distinct hardware settings, there lacks an understanding of 1) the rational behind performance improvement; 2) capability of different optimizations; 3) what optimization to respond to specific computational and memory demands. This work proposes a compression-enabled roofline model to facilitate this adaptability with data compression techniques to balance and transform between computational and memory demands. This model enables applications to adjust in response to the specific strengths and limitations of the underlying hardware and system to optimize resource utilization. The effectiveness of this approach is demonstrated with matrix multiplication kernels on different input sizes, with turning on/off various compression techniques, including 1) low-precision floating point; 2) sparse matrix formulation; and 3) compressed arrays with ZFP. By reducing memory transfer volumes and cache misses and increasing data locality and computational intensity through compression, the specific roofline model can transform between compute and memory bounds to align more efficiently with system capabilities. This advancement not only improves overall performance but also maximizes adaptability in diverse computing environments.

Naraparaju, Ramasoumya [University of Washington]↗
DOE OSTI2022

Co-scheduling Ensembles of In Situ Workflows

Molecular dynamics (MD) simulations are widely used to study large-scale molecular systems. HPC systems are ideal platforms to run these studies, however, reaching the necessary simulation timescale to detect rare processes is challenging, even with modern supercomputers. To overcome the timescale limitation, the simulation of a long MD trajectory is replaced by multiple short-range simulations that are executed simultaneously in an ensemble of simulations. Analyses are usually co-scheduled with these simulations to efficiently process large volumes of data generated by the simulations at runtime, thanks to in situ techniques. Executing a workflow ensemble of simulations and their in situ analyses requires efficient co- scheduling strategies and sophisticated management of computational resources so that they are not slowing down each other. In this paper, we propose an efficient method to co-schedule simulations and in situ analyses such that the makespan of the workflow ensemble is minimized. We present a novel approach to allocate resources for a workflow ensemble under resource constraints by using a theoretical framework modeling the workflow ensemble’s execution. We evaluate the proposed approach using an accurate simulator based on the WRENCH simulation framework on various workflow ensemble configurations. Results demonstrate the significance of co-scheduling simulations and in situ analyses that couple data together to benefit from data locality, in which inefficient scheduling decisions can lead to slowdown in makespan up to a factor of 30.

Do, Tu Mai Anh↗
DOE OSTI2019

Modeling the impact of liana infestation on the demography and carbon cycle of tropical forests

There is mounting empirical evidence that lianas affect the carbon cycle of tropical forests. However, no single vegetation model takes into account this growth form, although such efforts could greatly improve the predictions of carbon dynamics in tropical forests. In this study, we incorporated a novel mechanistic representation of lianas in a dynamic global vegetation model (the Ecosystem Demography Model). We developed a liana-specific plant functional type and mechanisms representing liana-tree interactions (such as light competition, liana-specific allometries, and attachment to host trees) and parameterized them according to a comprehensive literature meta-analysis. We tested the model for an old-growth forest (Paracou, French Guiana) and a secondary forest (Gigante Peninsula, Panama). The resulting model simulations captured many features of the two forests characterized by different levels of liana infestation as revealed by a systematic comparison of the model outputs with empirical data, including local census data from forest inventories, eddy flux tower data, and terrestrial laser scanner-derived forest vertical structure. The inclusion of lianas in the simulations reduced the secondary forest net productivity by up to 0.46 t C ha -1 year -1 , which corresponds to a limited relative reduction of 2.6% in comparison with a reference simulation without lianas. However, this resulted in significantly reduced accumulated above-ground biomass after 70 years of regrowth by up to 20 t C /ha (19% of the reference simulation). Ultimately, the simulated negative impact of lianas on the total biomass was almost completely cancelled out when the forest reached an old-growth successional stage. Our findings suggest that lianas negatively influence the forest potential carbon sink strength, especially for young, disturbed, liana-rich sites. In light of the critical role that lianas play in the profound changes currently experienced by tropical forests, this new model provides a robust numerical tool to forecast the impact of lianas on tropical forest carbon sinks.

59 BASIC BIOLOGICAL SCIENCES↗