Search NASA⌕ Search

SEARCH · Search NASA

Results for “compilers”

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 1,585 records · Page 88

Atlas of Nuclear Isomers

We present an atlas of nuclear isomers containing the experimental data for the isomers with a half-life ≥ 10 ns together with their various properties such as excitation-energy, half-life, decay mode(s), spin-parity, energies and multipolarities of emitted gamma transitions, etc. The ENSDF database complemented by the XUNDL database has been extensively used in extracting the relevant data. Recent literature from primary nuclear physics journals, and the NSR bibliographic database have been searched to ensure that the compiled data Table is as complete and current as possible. The data from NUBASE-12 have also been checked for completeness, but as far as possible original references have been cited. Many interesting systematic features of nuclear isomers emerge, some of them new; these are discussed and presented in various graphs and figures. The cutoff date for the extraction of data from the literature is August 15, 2015.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Nuclear Data Sheets for A = 52

The nuclear structure data belonging to all nuclei with mass number A=52 have been compiled and evaluated using experimental nuclear reaction data and decay data available before July 10, 2015. This evaluaton supersedes the previous publication for this msss chain (2007Hu08, Nuclear Data Sheets 108, 773 (2007)). The data for the ε decay of {sup 52}Co (104 ms) and the ε decay of {sup 52}Ni (40.8 ms) are both incomplete, so new studies would be useful.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optimization with the OpenACC-to-FPGA framework on the Arria 10 and Stratix 10 FPGAs

The reconfigurable computing paradigm with field programmable gate arrays (FPGAs) has received renewed interest in the high-performance computing field due to FPGAs’ unique combination of performance and energy efficiency. However, difficulties in programming and optimizing FPGAs have prevented them from being widely accepted as general-purpose computing devices. In accelerator-based heterogeneous computing, portability across diverse heterogeneous devices is also an important issue, but the unique architectural features in FPGAs make this difficult to achieve. To address these issues, a directive-based, high-level FPGA programming and optimization framework was previously developed. In this work, developed optimizations were combined holistically using the directive-based approach to show that each individual benchmark requires a unique set of optimizations to maximize performance. We perform this exploration on Intel Arria 10 and Stratix 10 FPGAs. We also explored the relationships between performance, resource usages, and compilation times, and investigated implications for performance portability. Finally, we present an initial evaluation of a real-world proxy application, LULESH.

97 MATHEMATICS AND COMPUTING↗

Nuclear Reaction Data File for Astrophysics (NRDF/A) in Hokkaido University Nuclear Reaction Data Center

The activities of the Japan Nuclear Reaction Data Centre is explained. The main task of the centre is data compilation of Japanese nuclear reaction data in collaboration of the International Network of Nuclear Reaction Data Centres. As one of recent activities, preparation of a new database (NRDF/A) and evaluation of astronuclear reaction data are reported. Collaboration in the nuclear data activities among Asian countries is proposed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Consistency among distance measurements: transparency, BAO scale and accelerated expansion

We explore consistency among different distance measures, including Supernovae Type Ia data, measurements of the Hubble parameter, and determination of the Baryon acoustic oscillation scale. We present new constraints on the cosmic transparency combining H(z) data together with the latest Supernovae Type Ia data compilation. This combination, in the context of a flat ΛCDM model, improves current constraints by nearly an order of magnitude although the constraints presented here are parametric rather than non-parametric. We re-examine the recently reported tension between the Baryon acoustic oscillation scale and Supernovae data in light of possible deviations from transparency, concluding that the source of the discrepancy may most likely be found among systematic effects of the modelling of the low redshift data or a simple ∼ 2-σ statistical fluke, rather than in exotic physics. Finally, we attempt to draw model-independent conclusions about the recent accelerated expansion, determining the acceleration redshift to be z{sub acc} = 0.35{sup +0.20}{sub −0.13} (1-σ)

79 ASTRONOMY AND ASTROPHYSICS↗

Architecture Independent Integrated Early Performance and Energy Estimation

The end of Dennard’s scaling, coupled to the necessity to keep increasing computational performance in constrained power envelopes, is leading developers towards the need to opti- mize applications not only for performance, but also for energy consumption. In such a scenario, solutions that enable estimating performance and energy consumption of a program as early as possible, even during development and without the necessity to access the final target hardware, can become fundamental tools to reduce the design space, the optimization effort, and provide potential opportunities to automate the optimization process itself. In this position paper, we discuss the design of a performance and energy estimation framework based on a retargetable com- piler. Our proposed approach targets the Intermediate Repre- sentation (IR) of the LLVM compiler. The IR based approach enables, after a model is built, estimation from a host different from the target architecture, even considering dynamic infor- mation. We present the rationale behind such a framework, identify opportunities and components readily available (such as the provided static analysis, quick ways to add instrumentation for dynamic profiling, and the multiple backends), and aspects that still need further research efforts (such as more effective non-linear, or machine learning based models). We also discuss a hand-developed case study, based on a simple sparse matrix vector multiplication with a linear model, to motivate the needs for such a framework.

Estimation, Compilers, Performance Analysis↗

Towards Ultra-high-resolution E3SM Land Modeling on Exascale Computers

Here we present an ultra-high-resolution E3SM land model (uELM) for high-fidelity land simulations targeting new Exascale computers. After considering modeling infrastructure compatibility and ELM software features, we designed a parallel model for the uELM development targeting hybrid architectures of new US Exascale computers. We also described a function unit test framework to expedite the piece-wise code porting (with compiler directives), verification, and global variable management. Furthermore, in this study, we report an early uELM model development using OpenACC within a function unit test framework on a pre-Exascale computer, demonstrate the performance of a uLEM submodel with a 3.0-time speedup, and summarize the code porting experience regarding global variable handling, deepcopy, memory reduction, and parallel loop reconstruction.

97 MATHEMATICS AND COMPUTING↗

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗

Nevada National Security Site 2011 Data Report: Groundwater Monitoring Program Area 5 Radioactive Waste Management Site

This report is a compilation of the groundwater sampling results from the Area 5 Radioactive Waste Management Site (RWMS). The data have been collected since 1993 and include calendar year 2011 results. During 2011, groundwater samples were collected and static water levels were measured at the three pilot wells surrounding the Area 5 RWMS. Samples were collected at UE5PW-1 on March 8, August 2, August 24, and October 19, 2011; at UE5PW-2 on March 8, August 2, August 23, and October 19, 2011; and at UE5PW-3 on March 8, August 2, August 23, and October 19, 2011. Static water levels were measured at each of the three pilot wells on March 1, June 7, August 1, and October 17, 2011. Groundwater samples were analyzed for the following indicators of contamination: pH, specific conductance, total organic carbon, total organic halides, and tritium. Indicators of general water chemistry (cations and anions) were also measured. Initial total organic carbon and total organic halides results for samples collected in August 2011 were above previous measurements and, in some cases, above the established investigation limits. However, after field sample pumps and tubing were disinfected with Clorox solution, the results returned to normal levels. Final results from samples collected in 2011 were within the limits established by agreement with the Nevada Division of Environmental Protection for each analyte. These data indicate that there has been no measurable impact to the uppermost aquifer from the Area 5 RWMS. There were no significant changes in measured groundwater parameters compared to previous years. The report contains an updated cumulative chronology for the Area 5 RWMS Groundwater Monitoring Program and a brief description of the site hydrogeology.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Center for Scalable Application Development Software (Final Report)

The Center for Scalable Application Development Software (CScADS) was established as a part- nership between Rice University, Argonne National Laboratory, University of California Berkeley, University of Tennessee – Knoxville, and University of Wisconsin – Madison. CScADS pursued an integrated set of activities with the aim of increasing the productivity of DOE computational scientists by catalyzing the development of systems software, libraries, compilers, and tools for leadership computing platforms. Principal Center activities were workshops to engage the research community in the challenges of leadership computing, research and development of open-source software, and work with computational scientists to help them develop codes for leadership computing platforms. This final report summarizes CScADS activities at Rice University in these areas.

97 MATHEMATICS AND COMPUTING↗

Co-ordination of the International Network of Nuclear Structure and Decay Data Evaluators

The 21st meeting of the International Network of Nuclear Structure and Decay Data Evaluators was convened at the IAEA Headquarters, Vienna, from 20 to 24 April 2015 under the auspices of the IAEA Nuclear Data Section. This meeting was attended by 36 scientists from 15 Member States, plus IAEA staff, concerned with the compilation, evaluation and dissemination of nuclear structure and decay data. A summary of the meeting, data centre reports, various proposals considered, and actions agreed by the participants, as well as recommendations/conclusions are presented within this document.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The ARES High-level Intermediate Representation

The LLVM intermediate representation (IR) lacks semantic constructs for depicting common high-performance operations such as parallel and concurrent execution, communication and synchronization. Currently, representing such semantics in LLVM requires either extending the intermediate form (a signi cant undertaking) or the use of ad hoc indirect means such as encoding them as intrinsics and/or the use of metadata constructs. In this paper we discuss a work in progress to explore the design and implementation of a new compilation stage and associated high-level intermediate form that is placed between the abstract syntax tree and when it is lowered to LLVM's IR. This highlevel representation is a superset of LLVM IR and supports the direct representation of these common parallel computing constructs along with the infrastructure for supporting analysis and transformation passes on this representation.

97 MATHEMATICS AND COMPUTING↗

Thermodynamic Data for Geochemical Modeling of Carbonate Reactions Associated with CO2 Sequestration – Literature Review

Permanent storage of anthropogenic CO2 in deep geologic formations is being considered as a means to reduce the concentration of atmospheric CO2 and thus its contribution to global climate change. To ensure safe and effective geologic sequestration, numerous studies have been completed of the extent to which the CO2 migrates within geologic formations and what physical and geochemical changes occur in these formations when CO2 is injected. Sophisticated, computerized reservoir simulations are used as part of field site and laboratory CO2 sequestration studies. These simulations use coupled multiphase flow-reactive chemical transport models and/or standalone (i.e., no coupled fluid transport) geochemical models to calculate gas solubility, aqueous complexation, reduction/oxidation (redox), and/or mineral solubility reactions related to CO2 injection and sequestration. Thermodynamic data are critical inputs to modeling geochemical processes. The adequacy of thermodynamic data for carbonate compounds has been identified as an important data requirement for the successful application of these geochemical reaction models to CO2 sequestration. A review of thermodynamic data for CO2 gas and carbonate aqueous species and minerals present in published data compilations and databases used in geochemical reaction models was therefore completed. Published studies that describe mineralogical analyses from CO2 sequestration field and natural analogue sites and laboratory studies were also reviewed to identify specific carbonate minerals that are important to CO2 sequestration reactions and therefore require thermodynamic data. The results of the literature review indicated that an extensive thermodynamic database exists for CO2 and CH4 gases, carbonate aqueous species, and carbonate minerals. Values of ΔfG298° and/or log Kr,298° are available for essentially all of these compounds. However, log Kr,T° or heat capacity values at temperatures above 298 K exist for less than approximately one-third of these compounds. Because the temperatures of host formations that will be used for CO2 injection and sequestration will be at tempera¬tures in the range of 50ºC to 100ºC or greater, the lack of high temperature thermodynamic values for key carbonate compounds especially minerals, will impact the accuracy of some modeling calculations.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Numerical gate synthesis for quantum heuristics on bosonic quantum processors

There is a recent surge of interest and insights regarding the interplay of quantum optimal control and variational quantum algorithms. We study the framework in the context of qudits which are, for instance, definable as controllable electromagnetic modes of a superconducting cavity system coupled to a transmon. By employing recent quantum optimal control approaches described in (Petersson and Garcia, 2021), we showcase control of single-qudit operations up to eight states, and two-qutrit operations, mapped respectively onto a single mode and two modes of the resonator. We discuss the results of numerical pulse engineering on the closed system for parametrized gates useful to implement Quantum Approximate Optimization Algorithm (QAOA) for qudits. The results show that high fidelity ( > 0.99) is achievable with sufficient computational effort for most cases under study, and extensions to multiple modes and open, noisy systems are possible. The tailored pulses can be stored and used as calibrated primitives for a future compiler in circuit quantum electrodynamics (cQED) systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Revisiting studies of the statistical property of a strong gravitational lens system and model-independent constraint on the curvature of the universe

In this paper, we use a recently compiled data set, which comprises 118 galactic-scale strong gravitational lensing (SGL) systems to constrain the statistical property of the SGL system as well as the curvature of the universe without assuming any fiducial cosmological model. Based on the singular isothermal ellipsoid (SIE) model of the SGL system, we obtain that the constrained curvature parameter Ω{sub k} is close to zero from the SGL data, which is consistent with the latest result of Planck measurement. More interestingly, we find that the parameter f in the SIE model is strongly correlated with the curvature Ω{sub k}. Neglecting this correlation in the analysis will significantly overestimate the constraining power of SGL data on the curvature. Furthermore, the obtained constraint on f is different from previous results: f=1.105±0.030 (68% confidence level [C.L.]), which means that the standard singular isothermal sphere (SIS) model (f = 1) is disfavored by the current SGL data at more than a 3σ C.L. We also divide all of the SGL data into two parts according to the centric stellar velocity dispersion σ{sub c} and find that the larger the value of σ{sub c} for the subsample, the more favored the standard SIS model is. Finally, we extend the SIE model by assuming the power-law density profiles for the total mass density, ρ=ρ{sub 0}(r/r{sub 0}){sup −α}, and luminosity density, ν=ν{sub 0}(r/r{sub 0}){sup −δ}, and obtain the constraints on the power-law indices: α=1.95±0.04 and δ=2.40±0.13 at a 68% C.L. When assuming the power-law index α=δ=γ, this scenario is totally disfavored by the current SGL data, χ{sub min,γ}{sup 2}−χ{sub min,SIE}{sup 2}≃53.

79 ASTRONOMY AND ASTROPHYSICS↗

Nasa pert time ii

Compiler language for NASA PERT Time II COMPUTER processing

PERT PROJECT↗

Initial Kernel Timing Using a Simple PIM Performance Model

This presentation will describe some initial results of paper-and-pencil studies of 4 or 5 application kernels applied to a processor-in-memory (PIM) system roughly similar to the Cascade Lightweight Processor (LWP). The application kernels are: * Linked list traversal * Sun of leaf nodes on a tree * Bitonic sort * Vector sum * Gaussian elimination The intent of this work is to guide and validate work on the Cascade project in the areas of compilers, simulators, and languages. We will first discuss the generic PIM structure. Then, we will explain the concepts needed to program a parallel PIM system (locality, threads, parcels). Next, we will present a simple PIM performance model that will be used in the remainder of the presentation. For each kernel, we will then present a set of codes, including codes for a single PIM node, and codes for multiple PIM nodes that move data to threads and move threads to data. These codes are written at a fairly low level, between assembly and C, but much closer to C than to assembly. For each code, we will present some hand-drafted timing forecasts, based on the simple PIM performance model. Finally, we will conclude by discussing what we have learned from this work, including what programming styles seem to work best, from the point-of-view of both expressiveness and performance.

BRIEFING CHARTS↗