Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Compilation”

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 703 records · Page 39

SCA Tools - SCRM Value Add or Lossy Noise Machines

Software supply chain risk management (SCRM) depends upon accurate information regarding the software components that comprise any given software system. The collection of components included in a software package can be organized within a software bill of materials, or SBOM. SBOMs are ideally generated when the software components are put together, such as at compile time, but for many reasons that has not and is not always possible. For example, legacy or proprietary software packages often do not have SBOMs available to downstream consumers of that software. It’s not just end users that are affected, manufacturers themselves also must deal with this problem. To answer these questions, the market has seen the rise of several commercial software composition analysis (SCA) tools. These tools aim to peer into completed software systems, automatically identifying hidden software dependencies and looking up known vulnerabilities associated with those dependencies to enable end-users to enhance their cyber supply chain risk management processes. These tools are potentially a huge boon to end users of legacy and proprietary software – and a potential bane, depending on how accurate they are. This research asks that question – how accurate are currently available binary SCA tools – and provides answers to several other questions: What does it mean to be “accurate”? What limitations do the tools have in identifying common edge cases that take place in modern software development? Can they help you avoid a devastating supply chain attack, or is it all just noise? After researching SCA tools on the market, we identified three vendors that fit our use case and would provide analysis on compiled binaries. Using these tools, we submitted firmware for critical infrastructure devices for analysis and SBOM generation. The SBOM outputs were then cross referenced with SBOMs generated through manual analysis for comparison. In addition to the firmware samples, we also submitted edge case samples based off a popular open-source library that were specifically crafted to evaluate each tools’ ability to accurately identify components. These samples were customized to be consistent with modifications we have seen in modern software development as well as a couple that are representative of supply chain attacks.

97 MATHEMATICS AND COMPUTING↗

Evaluating Liquid Waste Transfers and their Impacts to the SRS Tank Farm to Support Operations and Closure

The Liquid Waste (LW) contractor at the Savannah River Site, Savannah River Mission Completion (SRMC), supports the storage, processing, and safe disposition of legacy, radioactive liquid waste. The LW Tank Farms contain approximately 127 million liters (33.5 million gallons) of liquid waste within 43 active, underground waste tanks. To meet mission critical milestones for the closure of waste tanks and processing of 34 million liters (9 million gallons) of salt waste per year by the LW Salt Waste Processing Facility (SWPF), an increase in Tank Farm operations, including waste tank transfers, is required. Waste is compiled in salt and sludge batches in the Tank Farms and transferred to SWPF and the Defense Waste Processing Facility (DWPF) for treatment. All waste tank transfers, such as waste removal and batch compilation transfers, must be pre-evaluated to ensure Documented Safety Analysis (DSA) requirements are met via Evaluated Transfer Approval Forms (ETAFs). Facility conditions and configurations may change as a result of a waste transfer. These changes must be reflected in the Tank Farms Emergency Response Datasheet (ERD), which contains data utilized for operation and emergency situations.

Peterson, Shelby R.↗

Universal Jaynes-Cummings Control of an Oscillator

The Jaynes-Cummings (JC) interaction-the coherent exchange of excitations between a two-level system and a harmonic oscillator-is one of the fundamental interactions of quantum optics, realized across platforms such as cavity quantum electrodynamics, trapped ions, mechanical resonators, and superconducting circuits. Although JC interactions and qubit rotations form a universal gate set for oscillator control, practical implementations have not been demonstrated. Here we develop and experimentally demonstrate universal JC-based oscillator control by compiling arbitrary unitary gates into sequences of JC interactions and qubit rotations. In our experiment, the oscillator is realized using a mode of a high quality factor microwave cavity and the ancilla qubit using a superconducting transmon circuit, with the JC interaction implemented by a sideband interaction enabled by the Josephson nonlinearity. The native gates are constructed to be closed below a chosen cutoff photon number, encoding a qudit with suppressed leakage errors, while ancilla relaxation errors are detectable. We further find that the dispersive shift serves as a compilation resource that reduces circuit depths. We demonstrate universal qudit control and implement a single-qutrit gate set with a mean post-selected process fidelity of 96%, as well as ququart and ququint shift gates. These results establish Jaynes-Cummings control as a practical route to universal oscillator control, enabling programmable bosonic processors across a variety of quantum platforms.

Huang, Jordan [Rutgers U., Piscataway]↗

Jagged Tiling for Intra-tile Parallelism and Fine-Grain Multithreading

In this paper, we have developed a novel methodology that takes into consideration multithreaded many-core designs to better utilize memory/processing resources and improve memory residence on tileable applications. It takes advantage of polyhedral analysis and transformation in the form of PLUTO, combined with a highly optimized finegrain tile runtime to exploit parallelism at all levels. The main contributions of this paper include the introduction of multi-hierarchical tiling techniques that increases intra tile parallelism; and a data-flow inspired runtime library that allows the expression of parallel tiles with an efficient synchronization registry. Our current implementation shows performance improvements on an Intel Xeon Phi board up to 32.25% against instances produced by state-of-the-art compiler frameworks for selected stencil applications.

compiler↗

Relativistic large scale CI calculations of energies, transition rates and lifetimes in Ca-like ions between Co VIII and Zn XI

Energies, E1, E2 and M1 transition rates and lifetimes are reported for the lowest 134 fine-structure levels of the 3p{sup 6}3d{sup 2}, 3p{sup 6}3d4s, 3p{sup 5}3d{sup 3} and 3p{sup 6}3d4p configurations in all Ca-like ions between Co VIII and Zn XI. The calculations have been performed using the multiconfiguration Dirac–Hartree–Fock (MCDHF) and relativistic configuration interaction (RCI) methods. Important core–valance and core–core electron correlation effects are systematically accounted with large scale configuration interaction expansion. The Breit interaction and leading quantum-electrodynamical (QED) contributions such as the vacuum polarization and self-energy corrections are also included in the RCI calculations. The results are compared with the compiled data from the NIST ASD and other calculations to evaluate the accuracy of the present calculations. Our results have good agreement with previous relativistic many-body perturbation theory (RMBPT) calculations and the data from the NIST ASD, except for Zn XI. Present calculations provide some missing data, especially for Cu X and Zn XI, in the NIST ASD.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Review of experimental photon-induced K{sub β}/K{sub α} intensity ratios

In this paper, we present a compilation of the measured photon-induced K{sub β}/K{sub α} intensity ratio values published in the literature from 1969 to 2018. In the considered period, we found about 1118 values (127 papers) for elements with 11≤Z≤96. The analysis of the distribution of these experimental data values in function of the atomic number shows that almost all the elements from {sub 11}Na to {sub 96}Cm are covered, except some isolated cases with no data or less than two data values were found. It has been observed that the most exploited targets are in the region 22≤Z≤30 and 39≤Z≤42 and include an important number of data values. A critical examination of these data using weighted average values (K{sub β}/K{sub α}){sub w} have been calculated for each element and recommended weighted values have been proposed.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

B(E2) Evaluation for 0{sub 1}{sup +}→2{sub 1}{sup +} Transitions in Even-Even Nuclei

A collaborative study by Brookhaven-McMaster-Central Michigan is underway to evaluate B(E2)↑ for 0{sub 1}{sup +}→2{sub 1}{sup +} transitions. This work is a continuation of a previous USNDP evaluation and has been motivated by a large number of recent measurements and nuclear theory developments. It includes an extended compilation, data evaluation procedures and shell model calculations. The subset of B(E2)↑ recommended values for nuclei of relevance to the double-beta decay problem is presented, and evaluation policies of experimental data and systematics are discussed. Future plans for completion of the B(E2;0{sub 1}{sup +}→2{sub 1}{sup +}) evaluation project are also described.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

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↗

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↗

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↗

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↗