SEARCH · Engineering Papers

Results for “sparse coding”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 343 records · Page 19

All sources NASA NTRS DOE OSTI

DOE OSTI2020

Sparse thermal data for cellular automata modeling of grain structure in additive manufacturing

Grain growth in the wake of the melt pool formed during alloy-based additive manufacturing (AM) is complex and multifaceted, depending on parameters governing heat transport, fluid flow, and solidification itself. Cellular automata (CA) models have proven effective in providing computationally efficient and physically sound predictions of grain structure for several AM problems, but their efficiency is tied to the performance of heat transport models. CA models use only a small portion of the problem's temperature data (near the moving melt pool boundary), and much of the CA calculations do not affect the final result due to re-melting of material. Coupling of and communication between heat transport and solidification models, and eliminating operations irrelevant towards final grain structure prediction, will be necessary for using these methods for efficient simulation of large parts. In this work, we introduce a procedure of decoupling the CA from temperature field simulation, using files of relevant temperature data written by the heat transport model. This approach is validated against the standard coupling approach using data obtained through the computational fluid dynamics software OpenFOAM. Negligible differences are seen in grain size, volume, and texture distributions for multilayer simulation of test problems, while the quantity of temperature data for these test problems was reduced by four orders of magnitude (from 100s of GB to 10s of MB) and the code performance sped up by a factor of around 50. Furthermore, variability in microstructure as a function of cell size, substrate, time step, and nucleation parameters is studied, and it is found that cell sizes less than or equal to 1.67 μm and sufficiently small time steps yield Αstatistically equivalent microstructures. Finally, a potential use case for this CA approach—the layer-wise convergence in grain structure starting from extremes in initial grain size—is examined. This approach's ability to simulate expected trends in nucleation and epitaxial grain growth for large regions of microstructure, simulated independently of heat transport models themselves, should prove useful for investigation of various microstructure uncertainties and prediction of part-scale experimental results.

36 MATERIALS SCIENCE↗

DOE OSTI2023

Latent code-based fusion: A Volterra neural network approach

We propose a deep structure encoder using Volterra Neural Networks (VNNs) to seek a latent representation of multi-modal data whose features are jointly captured by a union of subspaces. The so-called self-representation embedding of the latent codes leads to a simplified fusion which is driven by a similarly constructed decoding. The Volterra Filter architecture achieved reduction in parameter complexity is primarily due to controlled non-linearities being introduced by the higher-order convolutions in lieu of generalized activation functions. Experimental results on two different datasets have shown a significant improvement in the clustering performance for VNNs auto-encoder over conventional Convolutional Neural Networks (CNNs) auto-encoder. In addition, we also show that the proposed approach demonstrates a much-improved sample complexity over CNN-based auto-encoder with a robust classification performance.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Divergence study and emittance measurements for the electron beam emitted from a diamond pyramid

This paper reports the results of a divergence study and emittance measurements for an electron beam emitted from a single diamond pyramid in a sparse diamond field-emitter array (DFEA) cathode. DFEA cathodes are arrays of micrometer scale diamond pyramids with nanometer scale tips. A single diamond pyramid produces currents as high as 10 μA from a small surface area. DFEA cathodes are expected to be a good beam source for compact dielectric laser accelerators. For the electron beam divergence experiment, we have designed and assembled a test stand consisting of a DFEA cathode, a mesh anode, and a screen. We measured current and the size of the beam on the screen as functions of the distance between the cathode and the anode, the size of a pyramid’s base, and applied voltage on the cathode. In order to perform beam emittance measurements, we designed and fabricated a magnetic lens to be placed between the mesh and the screen. By measuring the size of the beam for different distances between the lens and the screen, we estimate the beam’s emittance. Here, we also simulated the electron beam dynamics with Computer Simulation Technology Studio and General Particle Tracer codes. Experimentally measured divergence angles and normalized transverse emittance show good agreement with simulations.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2012

Methods for Detector Placement and Analysis of Criticality Accident Alarm Systems

Determining the optimum placement to minimize the number of detectors for a criticality accident alarm system (CAAS) in a large manufacturing facility is a complex problem. There is typically a target for the number of detectors that can be used over a given zone of the facility. A study to optimize detector placement typically begins with some initial guess at the placement of the detectors and is followed by either predictive calculations of accidents at specific locations or adjoint calculations based on preferred detector locations. Within an area of a facility, there may be a large number of potential criticality accident sites. For any given placement of the detectors, the list of accident sites can be reduced to a smaller number of locations at which accidents may be difficult for detectors to detect. Developing the initial detector placement and determining the list of difficult accident locations are both based on the practitioner's experience. Simulations following fission particles released from an accident location are called 'forward calculations.' These calculations can be used to answer the question 'where would an alarm be triggered?' by an accident at a specified location. Conversely, 'adjoint calculations' start at a detector site using the detector response function as a source and essentially run in reverse. These calculations can be used to answer the question 'where would an accident be detected?' by a specified detector location. If the number of accidents, P, is much less than the number of detectors, Q, then forward simulations may be more convenient and less time-consuming. If Q is large or the detectors are not placed yet, then a mesh tally of dose observed by a detector at any location must be computed over the entire zone. If Q is much less than P, then adjoint calculations may be more efficient. Adjoint calculations employing a mesh tally can be even more advantageous because they do not rely on a list of specific difficult-to-detect accident sites, which may not have included every possible accident location. Analog calculations (no biasing) simply follow particles naturally. For sparse buildings and line-of-sight calculations, analog Monte Carlo (MC) may be adequate. For buildings with internal walls or large amounts of heavy equipment (dense geometry), variance reduction may be required. Calculations employing the CADIS method use a deterministic calculation to create an importance map and a matching biased source distribution that optimize the final MC to quickly calculate one specific tally. Calculations employing the FW-CADIS method use two deterministic calculations (one forward and one adjoint) to create an importance map and a matching biased source distribution that are designed to make the MC calculate a mesh tally with more uniform uncertainties in both high-dose and low-dose areas. Depending on the geometry of the problem, the number of detectors, and the number of accident sites, different approaches to CAAS placement studies can be taken. These are summarized in Table I. SCALE 6.1 contains the MAVRIC sequence, which can be used to perform any of the forward-based approaches outlined in Table I. For analog calculations, MAVRIC simply calls the Monaco MC code. For CADIS and FW-CADIS, MAVRIC uses the Denovo discrete ordinates (SN) deterministic code to generate the importance map and biased source used by Monaco. An adjoint capability is currently being added to Monaco and should be available in the next release of SCALE. An adjoint-based approach could be performed with Denovo alone - although fine meshes, large amounts of memory, and long computation times may be required to obtain accurate solutions. Coarse-mesh SN simulations could be employed for adjoint-based scoping studies until the adjoint capability in Monaco is complete. CAAS placement studies, especially those dealing with mesh tallies, require some extra utilities to aid in the analysis. Detectors must receive a minimum dose rate in order to alarm; therefore, a simple yes/no plot could be more useful to the analyst than a standard dose rate contour plot. Alarm systems that require several detectors to alarm simultaneously for a given accident would need to combine several yes/no plots in order to show accident sites where multiple detectors would be triggered. This could require a plot of 'areas of coverage' that is mapped over the building geometry. Several new utilities (which will be part of SCALE 6.2) were created to help with CAAS analysis.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2020

Scalable line and plane relaxation in a parallel structured multigrid solver

The efficient solution of sparse, linear systems that arise through the discretization of partial differential equations remains a key challenge for a range of high performance scientific simulations. One approach for reducing data movement and improving performance is by exposing and exploiting structure in a problem through the use of robust structured multilevel solvers. By choosing coarsening that preserves the structure of the problem, these methods maintain efficient structured computation and communication throughout the multigrid hierarchy. However, when coarsening is not permitted to be dependent on the operator, anisotropy must be addressed by the smoother — producing error compatible for coarse-grid correction with structured coarsening. Here, the components required in a scalable parallel structured solver are described with a focus on memory and communication efficiency of robust smoothers. While the implementation of communication and memory reduction techniques in smoothers integrated in a complete 3D solver present a significant engineering challenge, a novel approach is proposed that addresses these challenges systematically through a change to the solver’s execution model. Enabled by user-level threading paired with a set of data and communication abstractions, this approach permits seamless aggregation of communication in plane smoothers — directly reusing code for a 2D distributed multilevel cycle. Results show an effective reduction in communication costs for coarse-grid problems, and result in a speedup of 8.7x in smoothing routines shown in Fig. 12 using this approach. This produces a significant improvement to strong scalability while maintaining favorable weak scaling behavior. Finally, a parallel scaling study using a series of refined meshes is included that demonstrates the effectiveness of this approach in an application of interest.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Scattering of radiofrequency waves by randomly modulated density interfaces in the edge of fusion plasmas

In the scrape-off layer and the edge region of a tokamak, the plasma is strongly turbulent and scatters the radiofrequency (RF) electromagnetic waves that propagate through this region. It is important to know the spectral properties of these scattered RF waves, whether used for diagnostics or for heating and current drive. The spectral changes influence the interpretation of the obtained diagnostic data, and the current and heating profiles. A full-wave, three-dimensional (3-D) electromagnetic code ScaRF has been developed for studying the RF wave propagation through turbulent plasma. ScaRF is a finite-difference frequency-domain (FDFD) method used for solving Maxwell's equations. The magnetized plasma is defined through the cold plasma by the anisotropic permittivity tensor. As a result, ScaRF can be used to study the scattering of any cold plasma RF wave. It can also be used for the study of the scattering of electron cyclotron waves in ITER-type and medium-sized tokamaks such as TCV, ASDEX-U and DIII-D. For the case of medium-sized tokamaks, there is experimental evidence that drift waves and rippling modes are present in the edge region. Hence, we have studied the scattering of RF waves by periodic density interfaces (plasma gratings) in the form of a superposition of spatial modes with varying periodicity and random amplitudes. The power reflection coefficient (a random variable) is calculated for different realizations of the density interface. In this work, the uncertainty of the power reflection coefficient is rigorously quantified by use of the Polynomial Chaos Expansion method in conjunction with the Smolyak sparse-grid integration, which is known as the PCE-SG method. The PCE-SG method is proven to be accurate and more efficient compared with alternative methods such as the Monte Carlo (MC) approach.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

NASA NTRS1996

Methodology for Sensitivity Analysis, Approximate Analysis, and Design Optimization in CFD for Multidisciplinary Applications

An incremental iterative formulation together with the well-known spatially split approximate-factorization algorithm, is presented for solving the large, sparse systems of linear equations that are associated with aerodynamic sensitivity analysis. This formulation is also known as the 'delta' or 'correction' form. For the smaller two dimensional problems, a direct method can be applied to solve these linear equations in either the standard or the incremental form, in which case the two are equivalent. However, iterative methods are needed for larger two-dimensional and three dimensional applications because direct methods require more computer memory than is currently available. Iterative methods for solving these equations in the standard form are generally unsatisfactory due to an ill-conditioned coefficient matrix; this problem is overcome when these equations are cast in the incremental form. The methodology is successfully implemented and tested using an upwind cell-centered finite-volume formulation applied in two dimensions to the thin-layer Navier-Stokes equations for external flow over an airfoil. In three dimensions this methodology is demonstrated with a marching-solution algorithm for the Euler equations to calculate supersonic flow over the High-Speed Civil Transport configuration (HSCT 24E). The sensitivity derivatives obtained with the incremental iterative method from a marching Euler code are used in a design-improvement study of the HSCT configuration that involves thickness. camber, and planform design variables.

Taylor, Arthur C., III↗

DOE OSTI2018

Bayesian Calibration of Inertial Confinement Fusion Models with Very Expensive Data

Calibrating computer simulations against experimental data is a ubiquitous problem in science and is particularly difficult when experimental data are expensive or diffi- cult to collect. In inertial confinement fusion experiments, where a single data point can cost 10 5 –10 6 USD, calibration of large-scale design calculations is particularly challenging. We present a framework that aims to provide calibrated predictions far from the available data that can be trained using a small number of data points. The approach aims to retain as much of the physics (summarized by the simulation code) as possible and is based on a truncated polynomial chaos expansion in the space of simulation inputs, augmented with a non-parametric correction for higher distribution modes. Due to the difficulty of the problem, understanding the sources of uncertainty in the model is essential; we demonstrate this through an application of our approach to a series of 6 experimental laser shots. As a result, we validate our approach, show that the uncertainties in our predictions of experimental performance are dominated by shot-shot fluctuations and regression uncertainties, and discuss paths towards an improved prediction model.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

GCoD: Graph Convolutional Network Acceleration via Dedicated Algorithm and Accelerator Co-Design

Graph Convolutional Networks (GCNs) have emerged as the state-of-the-art graph learning model. However, it remains notoriously challenging to inference GCNs over large graph datasets, limiting their application to large real-world graphs and hindering the exploration of deeper and more sophisticated GCN graphs. This is because real-world graphs can be extremely large and sparse. Furthermore, the node degree of GCNs tends to follow the power-law distribution and therefore have highly irregular adjacency matrices, resulting in prohibitive inefficiencies in both data processing and movement and thus substantially limiting the achievable GCN acceleration efficiency. To this end, this paper proposes the first GCN algorithm and accelerator Co-Design framework dubbed GCoD which can largely alleviate the aforementioned GCN irregularity and boost GCNs' inference efficiency. Specifically, on the algorithm level, GCoD integrates a divide and conquer GCN training strategy that polarizes the graphs to be either denser or sparser in local neighborhoods without compromising the model accuracy, resulting in graph adjacency matrices that (mostly) have merely two levels of workload and enjoys largely enhanced regularity and thus ease of acceleration. On the hardware level, we further develop a dedicated two-pronged accelerator with a separated engine to process each of the aforementioned workloads, further boosting the overall utilization and acceleration efficiency. Extensive experiments and ablation studies validate that our GCoD consistently outperforms state-of-the-art designs in terms of accelerator efficiency while maintaining or even improving the task accuracy. Additionally, we visualize GCoD trained graph adjacency matrices to better understand its advantages. All codes and pre-trained models will be released upon acceptance.

You, Haoran↗

DOE OSTI2021

Scattering of radio frequency waves by randomly modulated density interfaces in the edge of fusion plasmas

In the scrape-off layer and the edge region of a tokamak, the plasma is strongly turbulent and scatters the radio frequency (RF) electromagnetic waves that propagate through this region. It is important to know, whether used for diagnostics or for heating and current drive, the spectral properties of these scattered RF waves. The spectral changes influences the interpretation of the diagnostic-data obtained and the current and heating profiles. A full-wave, 3D electromagnetic code ScaRF (see Papadopoulos et al. 2019) has been developed for studying the RF wave propagation through turbulent plasma. ScaRF is a finite-difference frequency-domain (FDFD) method for solving Maxwell's equations. The magnetized plasma is defined through the cold plasma, anisotropic permittivity tensor. As a result, ScaRF can be used to study the scattering of any cold plasma RF wave. It can be for the study of scattering of electron cyclotron waves in ITER-type and medium-sized tokamaks such as TCV, ASDEX-U, DIII-D. For the case of medium-sized tokamaks, there's experimental evidence that drift waves and rippling modes are present in the edge region (see Ritz et al. 1984). Hence, we study the scattering of RF waves by periodic density interfaces (plasma gratings) in the form of a superposition of spatial modes with varying periodicity and random amplitudes (see Papadopoulos et al. 2019). The power reflection coefficient (a random variable) is calculated for different realizations of the density interface. In this work, the uncertainty of the power reflection coefficient is rigorously quantified by use of the Polynomial Chaos Expansion (see Xiu & Karniadakis 2002) method in conjunction with the Smolyak sparse grid integration (see Papadopoulos et al. 2018) (PCE-SG). The PCE-SG method is proven accurate and much more efficient (roughly 2-orders of magnitude shorter execution time) compared to alternative methods such as the Monte Carlo (MC) approach.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2018

SIESTA-SIPs: Massively parallel spectrum-slicing eigensolver for an ab initio molecular dynamics package

Integration of Shift-and-Invert Parallel spectral transformation (SIPs) eigensolver (as implemented in the SLEPc library) into an ab initio molecular dynamics package, SIESTA, is described. The effectiveness of the code is demonstrated on applications to polyethylene chains, boron nitride sheets, and bulk water clusters. For problems with the same number of orbitals, the performance of the SLEPc eigensolver depends on the sparsity of the matrices involved, favoring reduced dimensional systems such as polyethylene or boron nitride sheets in comparison to bulk systems like water clusters. For all problems investigated, performance of SIESTA-SIPs exceeds the performance of SIESTA with default solver (ScaLAPACK) at the larger number of cores and the larger number of orbitals. A method that improves the load-balance with each iteration in the self-consistency cycle by exploiting the emerging knowledge of the eigenvalue spectrum is demonstrated

ab initio↗

DOE OSTI2021

COVID-19 dynamics across the US: A deep learning study of human mobility and social behavior

This paper presents a deep learning framework for epidemiology system identification from noisy and sparse observations with quantified uncertainty. The proposed approach employs an ensemble of deep neural networks to infer the time-dependent reproduction number of an infectious disease by formulating a tensor-based multi-step loss function that allows us to efficiently calibrate the model on multiple observed trajectories. The method is applied to a mobility and social behavior-based SEIR model of COVID-19 spread. The model is trained on Google and Unacast mobility data spanning a period of 66 days, and is able to yield accurate future forecasts of COVID-19 spread in 203 US counties within a time-window of 15 days. Interestingly, a sensitivity analysis that assesses the importance of different mobility and social behavior parameters reveals that attendance of close places, including workplaces, residential, and retail and recreational locations, has the largest impact on the effective reproduction number. Furthermore, the model enables us to rapidly probe and quantify the effects of government interventions, such as lock-down and re-opening strategies. Taken together, the proposed framework provides a robust workflow for data-driven epidemiology model discovery under uncertainty and produces probabilistic forecasts for the evolution of a pandemic that can judiciously provide information for policy and decision making. All codes and data accompanying this manuscript are available at https://github.com/PredictiveIntelligenceLab/DeepCOVID19.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2022

Automated identification of local contamination in remote atmospheric composition time series

Abstract. Atmospheric observations in remote locations offer a possibility of exploring trace gas and particle concentrations in pristine environments. However, data from remote areas are often contaminated by pollution from local sources. Detecting this contamination is thus a central and frequently encountered issue. Consequently, many different methods exist today to identify local contamination in atmospheric composition measurement time series, but no single method has been widely accepted. In this study, we present a new method to identify primary pollution in remote atmospheric datasets, e.g., from ship campaigns or stations with a low background signal compared to the contaminated signal. The pollution detection algorithm (PDA) identifies and flags periods of polluted data in five steps. The first and most important step identifies polluted periods based on the derivative (time derivative) of a concentration over time. If this derivative exceeds a given threshold, data are flagged as polluted. Further pollution identification steps are a simple concentration threshold filter, a neighboring points filter (optional), a median, and a sparse data filter (optional). The PDA only relies on the target dataset itself and is independent of ancillary datasets such as meteorological variables. All parameters of each step are adjustable so that the PDA can be “tuned” to be more or less stringent (e.g., flag more or fewer data points as contaminated). The PDA was developed and tested with a particle number concentration dataset collected during the Multidisciplinary drifting Observatory for the Study of Arctic Climate (MOSAiC) expedition in the central Arctic. Using strict settings, we identified 62 % of the data as influenced by local contamination. Using a second independent particle number concentration dataset also collected during MOSAiC, we evaluated the performance of the PDA against the same dataset cleaned by visual inspection. The two methods agreed in 94 % of the cases. Additionally, the PDA was successfully applied to a trace gas dataset (CO2), also collected during MOSAiC, and to another particle number concentration dataset, collected at the high-altitude background station Jungfraujoch, Switzerland. Thus, the PDA proves to be a useful and flexible tool to identify periods affected by local contamination in atmospheric composition datasets without the need for ancillary measurements. It is best applied to data representing primary pollution. The user-friendly and open-access code enables reproducible application to a wide suite of different datasets. It is available at https://doi.org/10.5281/zenodo.5761101 (Beck et al., 2021).

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2011

A design for a V&V and UQ discovery process.

There is currently sparse literature on how to implement systematic and comprehensive processes for modern V&V/UQ (VU) within large computational simulation projects. Important design requirements have been identified in order to construct a viable 'system' of processes. Significant processes that are needed include discovery, accumulation, and assessment. A preliminary design is presented for a VU Discovery process that accounts for an important subset of the requirements. The design uses a hierarchical approach to set context and a series of place-holders that identify the evidence and artifacts that need to be created in order to tell the VU story and to perform assessments. The hierarchy incorporates VU elements from a Predictive Capability Maturity Model and uses questionnaires to define critical issues in VU. The place-holders organize VU data within a central repository that serves as the official VU record of the project. A review process ensures that those who will contribute to the record have agreed to provide the evidence identified by the Discovery process. VU expertise is an essential part of this process and ensures that the roadmap provided by the Discovery process is adequate. Both the requirements and the design were developed to support the Nuclear Energy Advanced Modeling and Simulation Waste project, which is developing a set of advanced codes for simulating the performance of nuclear waste storage sites. The Waste project served as an example to keep the design of the VU Discovery process grounded in practicalities. However, the system is represented abstractly so that it can be applied to other M&S projects.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

DOE OSTI2012

Fundamental hydrogen interactions with beryllium: a magnetic fusion perspective

Increasingly, basic models such as density functional theory and molecular dynamics are being used to simulate different aspects of hydrogen recycling from plasma facing materials. These models provide valuable insight into hydrogen diffusion, trapping, and recombination from surfaces, but their validation relies on knowledge of the detailed behavior of hydrogen at an atomic scale. Despite being the first wall material for ITER, basic single crystal beryllium surfaces have been studied only sparsely from an experimental standpoint. In prior cases researchers used electron spectroscopy to examine surface reconstruction or adsorption kinetics during exposure to a hydrogen atmosphere. While valuable, these approaches lack the ability to directly detect the positioning of hydrogen on the surface. Ion beam techniques, such as low energy ion scattering (LEIS) and direct recoil spectroscopy (DRS), are two of the only experimental approaches capable of providing this information. In this study, we applied both LEIS and DRS to examine how hydrogen binds to the Be(0001) surface. Our measurements were performed using an angle-resolved ion energy spectrometer (ARIES) to probe the surface with low energy ions (500 eV - 3 keV He + and Ne + ). We were able to obtain a 'scattering maps' of the crystal surface, providing insight on how low energy ions are focused along open surface channels. Once we completed a characterization of the clean surface, we dosed the sample with atomic hydrogen using a heated tungsten capillary. A distinct signal associated with adsorbed hydrogen emerged that was consistent with hydrogen residing between atom rows. To aid in the interpretation of the experimental results, we developed a computational model to simulate ion scattering at grazing incidence. For this purpose, we incorporated a simplified surface model into the Kalypso molecular dynamics code. This approach allowed us to understand how the incident ions interacted with the surface hydrogen, providing confirmation of the preferred binding site.

08 HYDROGEN↗

DOE OSTI2019

PAPI software-defined events for in-depth performance analysis

The methodology and standardization layer provided by the Performance Application Programming Interface (PAPI) has played a vital role in application profiling for almost two decades. It has enabled sophisticated performance analysis tool designers and performance-conscious scientists to gain insights into their applications by simply instrumenting their code using a handful of PAPI functions that “just work” across different hardware components. In the past, PAPI development had focused primarily on hardware-specific performance metrics. However, the rapidly increasing complexity of software infrastructure poses new measurement and analysis challenges for the developers of large-scale applications. In particular, acquiring information regarding the behavior of libraries and runtimes—used by scientific applications—requires low-level binary instrumentation, or APIs specific to each library and runtime. No uniform API for monitoring events that originate from inside the software stack has emerged. In this article, we present our efforts to extend PAPI’s role so that it becomes the de facto standard for exposing performance-critical events, which we refer to as software-defined events (SDEs), from different software layers. Upgrading PAPI with SDEs enables monitoring of both types of performance events—hardware- and software-related events—in a uniform way, through the same consistent PAPI. The goal of this article is threefold. First, we motivate the need for SDEs and describe our design decisions regarding the functionality we offer through PAPI’s new SDE interface. Second, we illustrate how SDEs can be utilized by different software packages, specifically, by showcasing their use in the numerical linear algebra library MAGMA-Sparse, the tensor algebra library TAMM that is part of the NWChem suite, and the compiler-based performance analysis tool Byfl. Third, we provide a performance analysis of the overhead that results from monitoring SDEs and discuss the trade-offs between overhead and functionality.

Jagode, Heike↗

NASA NTRS2019

Online Visualization and Analysis of NASA Satellite-Based Global and Regional Precipitation Products Through Giovanni

Observational data are essential for Earth science research and applications. Traditional ground-based observations suffer from many limitations (e.g. costly deployment). As a result, data are often sparse and inconsistent, especially over vast oceans that cover nearly 71% of the Earth's surface, and for remote continents. Precipitation is one of the important physical parameters in the global hydrological cycle and other disciplines. Each year, severe floods and droughts happen in different parts of the world and cause significant damage to the economy, as well as human casualties (e.g. Hurricane Katrina, the Dust Bowl). Accurate and timely precipitation observations and predictions are important for research and applications. However, ground-based precipitation observations are quite limited, especially in remote and mountainous regions. Since the satellite era began, satellite-based precipitation products have gained popularity in Earth science research, applications, and education. Accessing satellite products can be a daunting task to many users, especially those who do not have prior experience or knowledge with satellite data. Recognizing this obstacle, the NASA Goddard Earth Sciences and Data and Information Services Center (GES DISC), home to data archives for the NASA-JAXA Tropical Rainfall Measuring Mission (TRMM) and Global Precipitation Measurement (GPM), has developed data services including an online visualization and analysis tool, Giovanni (the Geospatial Interactive Online Visualization ANd aNalysis Infrastructure), enabling users at different levels to access, explore, and evaluate NASA satellite-based data products without downloading either data and software, or requiring coding. Currently, global and regional precipitation products from different satellite missions (TRMM, GPM) and projects (e.g. the Modern Era Retrospective-analysis for Research and Applications Version 2 (MERRA-2), and the North American Land Data Assimilation System (NLDAS)), ranging from half-hourly to monthly temporal resolution, are available in Giovanni. There are over 1900 variables in Giovanni, covering measurements in precipitation, hydrology, atmospheric dynamics, atmospheric chemistry, etc. In this poster presentation, we will provide a live demonstration of Giovanni and its latest development, including precipitation-related variables, and new basic features such as polar projections. The session will also provide a Q&A opportunity for attendees.

Giovanni↗

DOE OSTI2019

Modeling the asynchronous Jacobi method without communication delays

Asynchronous iterative methods for solving linear systems are gaining renewed interest due to the high cost of synchronization points in massively parallel codes. Historically, theory on asynchronous iterative methods has focused on asymptotic behavior, while the transient behavior remains poorly understood. In this paper, we study a model of the asynchronous Jacobi method without communication delays, which we call simplified asynchronous Jacobi. Simplified asynchronous Jacobi can be used to model asynchronous Jacobi implemented in shared memory or distributed memory with fast communication networks. Our analysis uses the idea of a propagation matrix, which is similar in concept to an iteration matrix. We show that simplified asynchronous Jacobi can continue to reduce the residual when some processes are slower than other processes. We also show that simplified asynchronous Jacobi can converge when synchronous Jacobi does not. We verify our analysis of simplified asynchronous Jacobi using results from asynchronous Jacobi implemented in shared and distributed memory.

97 MATHEMATICS AND COMPUTING↗