Search NASA⌕ Search

SEARCH · Search NASA

Results for “data dependencies”

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 253 records · Page 14

PSR J0007+7303 In The CTA1 Supernova Remnant: New Gamma-Ray Results From Two Years Of Fermi Large Area Telescope Observations

One of the main results of the Fermi Gamma-Ray Space Telescope is the discovery of γ-ray selected pulsars. The high magnetic field pulsar, PSR J0007+7303 in CTA1, was the first ever to be discovered through its γ-ray pulsations. Based on analysis of 2 years of LAT survey data, we report on the discovery of γ-ray emission in the off-pulse phase interval at the ~ 6σ level. The flux from this emission in the energy range E ≥ 100 MeV is F100 = (1.73±0.40)×10 -8 photons cm -2 s -1 and is best fitted by a power law with a photon index of Γ = 2.54±0.14. The pulsed -ray flux in the same energy range is F100 = (3.95±0.07)×10 -7 photons cm -2 s -1 and is best fitted by an exponentially-cutoff power-law spectrum with a photon index of Γ = 1.41 ± 0.23 and a cutoff energy Ec = 4.04 ± 0.20 GeV. We find no flux variability neither at the 2009 May glitch nor in the long term behavior. We model the γ-ray light curve with two high-altitude emission models, the outer gap and slot gap, and find that the model that best fits the data depends strongly on the assumed origin of the off-pulse emission. Both models favor a large angle between the magnetic axis and observer line of sight, consistent with the nondetection of radio emission being a geometrical effect. Finally we discuss how the LAT results bear on the understanding of the cooling of this neutron star.

79 ASTRONOMY AND ASTROPHYSICS↗

INFRARED TRANSMISSION SPECTROSCOPY OF THE EXOPLANETS HD 209458b AND XO-1b USING THE WIDE FIELD CAMERA-3 ON THE HUBBLE SPACE TELESCOPE

Exoplanetary transmission spectroscopy in the near-infrared using the Hubble Space Telescope (HST) NICMOS is currently ambiguous because different observational groups claim different results from the same data, depending on their analysis methodologies. Spatial scanning with HST/WFC3 provides an opportunity to resolve this ambiguity. We here report WFC3 spectroscopy of the giant planets HD 209458b and XO-1b in transit, using spatial scanning mode for maximum photon-collecting efficiency. We introduce an analysis technique that derives the exoplanetary transmission spectrum without the necessity of explicitly decorrelating instrumental effects, and achieves nearly photon-limited precision even at the high flux levels collected in spatial scan mode. Our errors are within 6% (XO-1) and 26% (HD 209458b) of the photon-limit at a resolving power of {lambda}/{delta}{lambda} {approx} 70, and are better than 0.01% per spectral channel. Both planets exhibit water absorption of approximately 200 ppm at the water peak near 1.38 {mu}m. Our result for XO-1b contradicts the much larger absorption derived from NICMOS spectroscopy. The weak water absorption we measure for HD 209458b is reminiscent of the weakness of sodium absorption in the first transmission spectroscopy of an exoplanet atmosphere by Charbonneau et al. Model atmospheres having uniformly distributed extra opacity of 0.012 cm{sup 2} g{sup -1} account approximately for both our water measurement and the sodium absorption. Our results for HD 209458b support the picture advocated by Pont et al. in which weak molecular absorptions are superposed on a transmission spectrum that is dominated by continuous opacity due to haze and/or dust. However, the extra opacity needed for HD 209458b is grayer than for HD 189733b, with a weaker Rayleigh component.

79 ASTRONOMY AND ASTROPHYSICS↗

LQCD workflow execution framework: Models, provenance and fault-tolerance

Large computing clusters used for scientific processing suffer from systemic failures when operated over long continuous periods for executing workflows. Diagnosing job problems and faults leading to eventual failures in this complex environment i s difficult, specifically when the success of an entire workflow might be affected by a single job failure. In this paper, we introduce a model-based, hierarchical, reliable execution framework that encompass workflow specification, data provenance, execu tion tracking and online monitoring of each workflow task, also referred to as participants. The sequence of participants is described in an abstract parameterized view, which is translated into a concrete data dependency based sequence of participants wi th defined arguments. As participants belonging to a workflow are mapped onto machines and executed, periodic and on-demand monitoring of vital health parameters on allocated nodes is enabled according to pre-specified rules. These rules specify condition s that must be true pre-execution, during execution and post-execution. Monitoring information for each participant is propagated upwards through the reflex and healing architecture, which consists of a hierarchical network of decentralized fault manageme nt entities, called reflex engines. They are instantiated as state machines or timed automatons that change state and initiate reflexive mitigation action(s) upon occurrence of certain faults. We describe how this cluster reliability framework is combined with the workflow execution framework using formal rules and actions specified within a structure of first order predicate logic that enables a dynamic management design that reduces manual administrative workload, and increases cluster-productivity.

Piccoli, Luciano↗

TWO MODERATE-REDSHIFT ANALOGS TO COMPACT MASSIVE EARLY-TYPE GALAXIES AT HIGH REDSHIFTS

From a search of a portion of the sky covered by the Sloan Digital Sky Survey and UKIRT Infrared Sky Survey databases, we have located two galaxies at z {approx} 0.5 that have properties similar to those of the luminous passive compact galaxies found at z {approx} 2.5. From Keck moderate-resolution spectroscopy and laser-guided adaptive-optics imaging of these galaxies, we can begin to put together a more detailed picture of what their high-redshift counterparts might be like. Spectral-synthesis models that fit the u to K photometry also seem to give good fits to the spectral features. From these models, we estimate masses in the range of 3-4 x 10{sup 11} M {sub sun} for both galaxies. Under the assumption that these are spheroidal galaxies, our velocity dispersions give estimated masses about a factor of 3 smaller. However, our high-resolution imaging data indicate that these galaxies are not normal spheroids, and the interpretation of the kinematic data depends critically on the actual morphologies and the nature of the stellar orbits. While recent suggestions that the population of high-redshift compact galaxies is present locally as the inner regions of local massive elliptical galaxies are quite plausible, the peak mass surface densities of the two galaxies we discuss here appear to be up to a factor of 10 higher than those of the highest density local ellipticals, assuming that our photometric masses are roughly correct. It thus seems possible that some dynamical 'puffing-up' of the high-redshift galaxies might still be required in this scenario.

79 ASTRONOMY AND ASTROPHYSICS↗

Transient superconductivity without superconductivity

Recent experiments on K 3 C 60 and layered copper-oxide materials have reported substantial changes in the optical response following application of an intense THz pulse. These data have been interpreted as the stimulation of a transient superconducting state even at temperatures well above the equilibrium transition temperature. We propose an alternative phenomenology based on the assumption that the pulse creates a nonsuperconducting, though nonequilibrium, situation in which the linear response conductivity is negative. The negative conductivity implies that the spatially uniform prepulse state is unstable and evolves to a new state with a spontaneous electric polarization. Furthermore, this state exhibits coupled oscillations of entropy and electric charge whose coupling to incident probe radiation modifies the reflectivity, leading to an apparently superconductinglike response that resembles the data. Dependencies of the reflectivity on polarization and angle of incidence of the probe are predicted and other experimental consequences are discussed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

POWTEX visits POWGEN

The high-intensity time-of-flight (TOF) neutron diffractometer POWTEX for powder and texture analysis is currently being built prior to operation in the eastern guide hall of the research reactor FRM II at Garching close to Munich, Germany. Because of the world-wide 3 He crisis in 2009, the authors promptly initiated the development of 3 He-free detector alternatives that are tailor-made for the requirements of large-area diffractometers. Herein is reported the 2017 enterprise to operate one mounting unit of the final POWTEX detector on the neutron powder diffractometer POWGEN at the Spallation Neutron Source located at Oak Ridge National Laboratory, USA. As a result, presented here are the first angular- and wavelength-dependent data from the POWTEX detector, unfortunately damaged by a 50 g shock but still operating, as well as the efforts made both to characterize the transport damage and to successfully recalibrate the voxel positions in order to yield nonetheless reliable measurements. Also described is the current data reduction process using the PowderReduceP2D algorithm implemented in Mantid [Arnold et al. (2014). Nucl. Instrum. Methods Phys. Res. A , 764 , 156–166]. The final part of the data treatment chain, namely a novel multi-dimensional refinement using a modified version of the GSAS-II software suite [Toby & Von Dreele (2013). J. Appl. Cryst. 46 , 544–549], is compared with a standard data treatment of the same event data conventionally reduced as TOF diffraction patterns and refined with the unmodified version of GSAS-II . This involves both determining the instrumental resolution parameters using POWGEN's powdered diamond standard sample and the refinement of a friendly-user sample, BaZn(NCN) 2 . Although each structural parameter on its own looks similar upon comparing the conventional (1D) and multi-dimensional (2D) treatments, also in terms of precision, a closer view shows small but possibly significant differences. For example, the somewhat suspicious proximity of the a and b lattice parameters of BaZn(NCN) 2 crystallizing in Pbca as resulting from the 1D refinement (0.008 Å) is five times less pronounced in the 2D refinement (0.038 Å). Similar features are found when comparing bond lengths and bond angles, e.g. the two N—C—N units are less differently bent in the 1D results (173 and 175°) than in the 2D results (167 and 173°). The results are of importance not only for POWTEX but also for other neutron TOF diffractometers with large-area detectors, like POWGEN at the SNS or the future DREAM beamline at the European Spallation Source.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

HERCULES: Strong Patterns towards More Intelligent Predictive Modeling, In: 2014 43rd International Conference on Parallel Processing

Recent work has shown that program analysis techniques to select meaningful code features of programs are important in the task of deciding the best compiler optimizations. Although, there are many successful state-of-the-art program analysis techniques, they often do not provide a simple method to extract the most expressive information about loops, especially when a target program is computationally intensive with complex loops and data dependencies. In this paper, we introduce a static technique to characterize a program using a pattern-driven system named HERCULES. This characterization technique not only helps a user to understand programs by searching pattern-of-interests, but also can be used for a predictive model that effectively selects the proper compiler optimizations. We formulated 35 loop patterns, then evaluated our characterization technique by comparing the predictive models constructed using HERCULES to three other state-of-the-art characterization methods. We show that our models outperform three state-of-the-art program characterization techniques on two multicore systems in selecting the best optimization combination from a given loop transformation space. We achieved up to 67% of the best possible speedup achievable with the optimization search space we evaluated.

Computer Science↗

Scalable FPGA Accelerator for Deep Convolutional Neural Networks with Stochastic Streaming

Here, FPGA-based heterogeneous computing platform, due to its extreme logic reconfigurability, emerges to be a strong contender as computing fabric in modern AI. As a result, various FPGA-based accelerators for deep CNN—the key driver of modern AI—have been proposed due to their advantages of high performance, reconfigurability, and fast development round, etc. In general, the consensus among researchers is that, although FPGA-based accelerator can achieve much higher energy efficiency, its raw computing performance lags behind when compared with GPUs with similar logic density. In this paper, we develop an alternative methodology to efficiently implement CNNs with FPGAs that outperform GPUs in terms of both power consumption and performance. Our key idea is to design a scalable hardware architecture and circuit design for large-scale CNNs that leverages a stochastic-based computing principle. Specifically, there are three major performance advantages. First, all key components of our deep learning CNN are designed and implemented to compute stochastically, thus achieving excellent computing performance and energy efficiency. Second, because our proposed CNN architecture enables a stream-mode computing, all of its stages can process even the partial results from preceding stages, therefore not incurring unnecessary latency due to data dependency. Finally, our FPGA-based deep CNN also provides a superior hardware scalability when compared with conventional FPGA implementations by reducing the bandwidth requirement between layers. The results show that our proposed CNN architecture significantly outperforms all previous FPGA-based deep CNN implementation approaches. It achieves 1.58x more GOPS, 6.42x more GOPS/Slice, and 10.92x more GOPS/W when compared with state-of-the-art CNN architecture. The top-5 accuracy of stochastic VGG-16 CNN is 86.77 percent with 18.91 fps frame rate.

97 MATHEMATICS AND COMPUTING↗

Streamline Integration Using MPI-Hybrid Parallelism on a Large Multicore Architecture

Streamline computation in a very large vector field data set represents a significant challenge due to the nonlocal and data-dependent nature of streamline integration. In this paper, we conduct a study of the performance characteristics of hybrid parallel programming and execution as applied to streamline integration on a large, multicore platform. With multicore processors now prevalent in clusters and supercomputers, there is a need to understand the impact of these hybrid systems in order to make the best implementation choice. We use two MPI-based distribution approaches based on established parallelization paradigms, parallelize over seeds and parallelize over blocks, and present a novel MPI-hybrid algorithm for each approach to compute streamlines. Our findings indicate that the work sharing between cores in the proposed MPI-hybrid parallel implementation results in much improved performance and consumes less communication and I/O bandwidth than a traditional, nonhybrid distributed implementation.

97 MATHEMATICS AND COMPUTING↗

HSLOT: The HERCULES Scriptable Loop Transformations Engine

HSLOT arms users with a rich set of configurable transformation directives, to be used as-they-are or to be specialized and combined into powerful custom transformations. We offer a plethora of loop transformations, which includes both the classic set (unroll, fuse, fission, tile, and so on) as well as unique ones (specialize, swap nest, split, fork, and so on) that are not found in other state-of-the-art systems. We show how HSLOT enables more transformations such as merging two loops that cannot be fused because of data dependencies and how HSLOT can be used in a simple and systematic fashion to improve memory accesses and expose better parallelism. To use our system, users simply annotate loops with the transformations sequence and compile with our Open64-based HSLOTimplementing Fortran compiler, HSLF90, which produces both object files and optionally source. We describe our experiment results using a set of scientific kernels written in Fortran with HSLOT directives on AMD 32 core system.

Kartsaklis, Christos↗

Climatology of Aerosol Optical Depth at Mid-Continental US Site: Ground-based Observations

The total aerosol burden in the atmosphere is typically represented by aerosol optical depth (AOD). To capture important and climate-relevant signatures of the aerosol burden, such as year-to-year and seasonal variability, continuous multi-year AOD observations are required. For more than two decades, these observations have been performed at the mid-continental Atmospheric Radiation Measurement (ARM) Southern Great Plains (SGP) Central Facility (CF) using ground-based passive remote sensing. The partially overlapping and fragmentary AOD records at the ARM SGP CF have been provided by four individual instruments, namely two co-located (C1 and E13) Multifilter Rotating Shadowband Radiometers (MFRSRs), a Normal Incidence Multifilter Radiometer (NIMFR), and a Cimel Sunphotometer (CSPHOT). Since these individual records are sporadic with instrument- and time-dependent data quality, development of a continuous multi-year high-quality AOD dataset is a challenging task. In this work, an initial development of a continuous 20-year (1997-2017) high-quality AOD product is introduced. The development involves (1) incorporation of the available data quality information and delivery of the historical time series of AOD with high quality from four individual instruments, (2) comparison of multiple AOD retrievals to identify potential instrument-related issues and/or retrieval problems, and (3) merging these individual time series, generation of a two-decade continuous climatology of high-quality AOD and reporting of the uncertainty estimations of the merged product.

Ground based remote sensing, Atmospheric Radiation↗

Real-time dose computation: GPU-accelerated source modeling and superposition/convolution

Purpose: To accelerate dose calculation to interactive rates using highly parallel graphics processing units (GPUs). Methods: The authors have extended their prior work in GPU-accelerated superposition/convolution with a modern dual-source model and have enhanced performance. The primary source algorithm supports both focused leaf ends and asymmetric rounded leaf ends. The extra-focal algorithm uses a discretized, isotropic area source and models multileaf collimator leaf height effects. The spectral and attenuation effects of static beam modifiers were integrated into each source's spectral function. The authors introduce the concepts of arc superposition and delta superposition. Arc superposition utilizes separate angular sampling for the total energy released per unit mass (TERMA) and superposition computations to increase accuracy and performance. Delta superposition allows single beamlet changes to be computed efficiently. The authors extended their concept of multi-resolution superposition to include kernel tilting. Multi-resolution superposition approximates solid angle ray-tracing, improving performance and scalability with a minor loss in accuracy. Superposition/convolution was implemented using the inverse cumulative-cumulative kernel and exact radiological path ray-tracing. The accuracy analyses were performed using multiple kernel ray samplings, both with and without kernel tilting and multi-resolution superposition. Results: Source model performance was <9 ms (data dependent) for a high resolution (400{sup 2}) field using an NVIDIA (Santa Clara, CA) GeForce GTX 280. Computation of the physically correct multispectral TERMA attenuation was improved by a material centric approach, which increased performance by over 80%. Superposition performance was improved by {approx}24% to 0.058 and 0.94 s for 64{sup 3} and 128{sup 3} water phantoms; a speed-up of 101-144x over the highly optimized Pinnacle{sup 3} (Philips, Madison, WI) implementation. Pinnacle{sup 3} times were 8.3 and 94 s, respectively, on an AMD (Sunnyvale, CA) Opteron 254 (two cores, 2.8 GHz). Conclusions: The authors have completed a comprehensive, GPU-accelerated dose engine in order to provide a substantial performance gain over CPU based implementations. Real-time dose computation is feasible with the accuracy levels of the superposition/convolution algorithm.

60 APPLIED LIFE SCIENCES↗

Measurement of the photon identification efficiencies with the ATLAS detector using LHC Run-1 data

The algorithms used by the ATLAS Collaboration to reconstruct and identify prompt photons are described. Measurements of the photon identification efficiencies are reported, using 4.9 fb –1 of pp collision data collected at the LHC at √s = 7 TeV and 20.3 fb –1 at √s = 8 TeV. The efficiencies are measured separately for converted and unconverted photons, in four different pseudorapidity regions, for transverse momenta between 10 GeV and 1.5 TeV. The results from the combination of three data-driven techniques are compared to the predictions from a simulation of the detector response, after correcting the electromagnetic shower momenta in the simulation for the average differences observed with respect to data. Data-to-simulation efficiency ratios used as correction factors in physics measurements are determined to account for the small residual efficiency differences. These factors are measured with uncertainties between 0.5% and 10% in 7 TeV data and between 0.5% and 5.6% in 8 TeV data, depending on the photon transverse momentum and pseudorapidity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Search for long-lived neutral particles in pp collisions at root s=13 TeV that decay into displaced hadronic jets in the ATLAS calorimeter

This paper describes a search for pairs of neutral, long-lived particles decaying in the ATLAS calorimeter. Long-lived particles occur in many extensions to the Standard Model and may elude searches for new promptly decaying particles. The analysis considers neutral, long-lived scalars with masses between 5 and 400 GeV, produced from decays of heavy bosons with masses between 125 and 1000 GeV, where the long-lived scalars decay into Standard Model fermions. The analysis uses either 10.8 fb -1 or 33.0 fb -1 of data (depending on the trigger) recorded in 2016 at the LHC with the ATLAS detector in proton–proton collisions at a centre-of-mass energy of 13 TeV. No significant excess is observed, and limits are reported on the production cross section times branching ratio as a function of the proper decay length of the long-lived particles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Case for Application Oblivious Energy-Efficient MPI Runtime

Power has become the major impediment in designing large scale high-end systems. Message Passing Interface (MPI) is the {\em de facto} communication interface used as the back-end for designing applications, programming models and runtime for these systems. Slack --- the time spent by an MPI process in a single MPI call --- provides a potential for energy and power savings, if an appropriate power reduction technique such as core-idling/Dynamic Voltage and Frequency Scaling (DVFS) can be applied without perturbing application's execution time. Existing techniques that exploit slack for power savings assume that application behavior repeats across iterations/executions. However, an increasing use of adaptive, data-dependent workloads combined with system factors (OS noise, congestion) makes this assumption invalid. This paper proposes and implements Energy Aware MPI (EAM) --- an application-oblivious energy-efficient MPI runtime. EAM uses a combination of communication models of common MPI primitives (point-to-point, collective, progress, blocking/non-blocking) and an online observation of slack for maximizing energy efficiency. Each power lever incurs time overhead, which must be amortized over slack to minimize degradation. When predicted communication time exceeds a lever overhead, the lever is used {\em as soon as possible} --- to maximize energy efficiency. When mis-prediction occurs, the lever(s) are used automatically at specific intervals for amortization. We implement EAM using MVAPICH2 and evaluate it on ten applications using up to 4096 processes. Our performance evaluation on an InfiniBand cluster indicates that EAM can reduce energy consumption by 5--41\% in comparison to the default approach, with negligible (less than 4\% in all cases) performance loss.

Venkatesh, Akshay↗

User-Assisted Store Recycling for Dynamic Task Graph Schedulers

The emergence of the multi-core era has led to increased interest in designing effective yet practical parallel programming models. Models based on task graphs that operate on single-assignment data are attractive in several ways: they can support dynamic applications and precisely represent the available concurrency. However, they also require nuanced algorithms for scheduling and memory management for efficient execution. In this paper, we consider memory-efficient dynamic scheduling of task graphs. Specifically, we present a novel approach for dynamically recycling the memory locations assigned to data items as they are produced by tasks. We develop algorithms to identify memory-efficient store recycling functions by systematically evaluating the validity of a set of (user-provided or automatically generated) alternatives. Because recycling function can be input data-dependent, we have also developed support for continued correct execution of a task graph in the presence of a potentially incorrect store recycling function. Experimental evaluation demonstrates that our approach to automatic store recycling incurs little to no overheads, achieves memory usage comparable to the best manually derived solutions, often produces recycling functions valid across problem sizes and input parameters, and efficiently recovers from an incorrect choice of store recycling functions.

97 MATHEMATICS AND COMPUTING↗

A single-tree algorithm to compute the Euclidean minimum spanning tree on GPUs

Computing the Euclidean minimum spanning tree (Emst) is a computationally demanding step of many algorithms. While work-efficient serial and multithreaded algorithms for computing Emst are known, designing an efficient GPU algorithm is challenging due to a complex branching structure, data dependencies, and load imbalances. In this paper, we propose a single-tree $Bor\mathring{u}vka$-based algorithm for computing Emst on GPUs. We use an efficient nearest neighbor algorithm and reduce the number of the required distance calculations by avoiding traversing subtrees with leaf nodes in the same component. The developed algorithms are implemented in a performance portable way using ArborX, an open-source geometric search library based on the Kokkos framework. We evaluate the proposed algorithm on various 2D and 3D datasets, show and compare it with the current state-of-the-art open-source CPU implementations. We demonstrate 4-24 × speedup over the fastest multi-threaded implementation. We prove the portability of our implementation by providing results on a variety of hardware: AMD EPYC 7763, Nvidia A100 and AMD MI250X. We show scalability of the implementation, computing Emst for 37 million 3D cosmological dataset in under a 0.5 second on a single A100 Nvidia GPU.

Prokopenko, Andrey↗

Chemical classification program synthesis using generative artificial intelligence

Accurately classifying chemical structures is essential for cheminformatics and bioinformatics, including tasks such as identifying bioactive compounds of interest, screening molecules for toxicity to humans, finding non-organic compounds with desirable material properties, or organizing large chemical libraries for drug discovery or environmental monitoring. However, manual classification is labor-intensive and difficult to scale to large chemical databases. Existing automated approaches either rely on manually constructed classification rules, or are deep learning methods that lack explainability. This work presents an approach that uses generative artificial intelligence to automatically write chemical classifier programs for classes in the Chemical Entities of Biological Interest (ChEBI) database. These programs can be used for efficient deterministic run-time classification of SMILES structures, with natural language explanations. The programs themselves constitute an explainable computable ontological model of chemical class nomenclature, which we call the ChEBI Chemical Class Program Ontology (C3PO). We validated our approach against the ChEBI database, and compared our results against deep learning models and a naive SMARTS pattern based classifier. C3PO outperforms the naive classifier, but does not reach the performance of state of the art deep learning methods. However, C3PO has a number of strengths that complement deep learning methods, including explainability and reduced data dependence. C3PO can be used alongside deep learning classifiers to provide an explanation of the classification, where both methods agree. The programs can be used as part of the ontology development process, and iteratively refined by expert human curators.

Artificial Intelligence↗