Search NASA⌕ Search

SEARCH · Search NASA

Results for “program 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 73 records · Page 4

ASDF: A Compiler for Qwerty, a Basis-Oriented Quantum Programming Language

Qwerty is a high-level quantum programming language built on bases and functions rather than circuits. This new paradigm introduces new challenges in compilation, namely synthesizing circuits from basis translations and automatically specializing adjoint or predicated forms of functions. This paper presents ASDF, an open-source compiler for Qwerty that answers these challenges in compiling basis-oriented languages. Enabled with a novel high-level quantum IR implemented in the MLIR framework, our compiler produces OpenQASM 3 or QIR for either simulation or execution on hardware. Our compiler is evaluated by comparing the fault-tolerant resource requirements of generated circuits with other compilers, finding that ASDF produces circuits with comparable cost to prior circuit-oriented compilers.

Adams, Austin J [Georgia Tech]↗

Understanding Portability of a High-Level Programming Model on Contemporary Heterogeneous Architectures

Accelerator-based heterogeneous computing is gaining momentum in the high-performance computing arena. However, the increased complexity of heterogeneous architectures demands more generic, high-level programming models. OpenACC is one such attempt to tackle this problem. Although the abstraction provided by OpenACC offers productivity, it raises questions concerning both functional and performance portability. In this article, the authors propose HeteroIR, a high-level, architecture-independent intermediate representation, to map high-level programming models, such as OpenACC, to heterogeneous architectures. They present a compiler approach that translates OpenACC programs into HeteroIR and accelerator kernels to obtain OpenACC functional portability. They then evaluate the performance portability obtained by OpenACC with their approach on 12 OpenACC programs on Nvidia CUDA, AMD GCN, and Intel Xeon Phi architectures. They study the effects of various compiler optimizations and OpenACC program settings on these architectures to provide insights into the achieved performance portability.

97 MATHEMATICS AND COMPUTING↗

iHarmonizer: improving the disk efficiency of I/O-intensive multithreaded codes

Challenged by serious power and thermal constraints, and limited by available instruction-level parallelism, processor designs have evolved to multi-core architectures. These architectures, many augmented with native simultaneous multithreading, are driving software developers to use multithreaded programs to exploit thread-level parallelism. While multithreading is well-known to introduce concerns of data dependency and CPU load balance, less known is that the uncertainty of relative progress of thread execution can cause patterns of I/O requests, issued by different threads, to be effectively random and so significantly degrade hard-disk efficiency. This effect can severely offset the performance gains from parallel execution, especially for I/O-intensive programs. Retaining the benefits of multithreading while not reducing I/O efficiency is an urgent and challenging problem. We propose a user-level scheme, iHarmonizer, to streamline the servicing of I/O requests from multiple threads in OpenMP programs. Specifically, we use the compiler to insert code into OpenMP programs so that data usage can be transmitted at run time to a supporting run-time library; this library in turn prefetches data in a disk-friendly way and coordinates threads execution according to the availability of their requested data. Transparently to the programmer, iHarmonizer makes a multithreaded program I/O efficient while maintaining the benefits of parallelism. Our experiments show that iHarmonizer can significantly speed up the execution of a representative set of I/O-intensive scientific benchmarks.

97 MATHEMATICS AND COMPUTING↗

CMM Data Analysis Tool

Due to the increase in the use of Coordinate Measuring Machines (CMMs) to measure fine details and complex geometries in manufacturing, many programs have been made to compile and analyze the data. These programs typically require extensive setup to determine the expected results in order to not only track the pass/fail of a dimension, but also to use statistical process control (SPC). These extra steps and setup times have been addressed through the CMM Data Analysis Tool, which only requires the output of the CMM to provide both pass/fail analysis on all parts run to the same inspection program as well as provide graphs which help visualize where the part measures within the allowed tolerances. This provides feedback not only to the customer for approval of a part during development, but also to machining process engineers to identify when any dimension is drifting towards an out of tolerance condition during production. This program can handle hundreds of parts with complex dimensions and will provide an analysis within minutes.

Source record↗

RPCSIM-SCO2 (Reactor Power and Control SIMulator for Supercritical CO2)

The RPCSIM-SCO2 code performs a dynamic simulation of a supercritical CO2 (carbon dioxide) Brayton cycle loop. The code is based on the MathLabTM program SimulinkTM from Mathworks. The Supercritical CO2 (S-CO2) model uses direct calls to the National Institute of Standards Refprop 9.0 Fortran library for the Equation-of-State (EOS) model for the CO2 working fluid (Lemmon, 2010). The calls to Refprop are made in the form of Simulink s-Functions that use a C interface to directly call the compiled Refprop fortran program library functions. Minor changes to the code can be made to use other working fluids. The code is intended to be used to perform many different types of dynamic cycle analysis for supercritical CO2 power producing systems. The code will calculate the transient temperature and pressure and all other thermodynamic properties at the inlet and outlet of each component given user supplied inputs such as rotor shaft speed, and heater power.

Wright, Steven A.↗

COMET: A Domain-Specific Compilation of High-Performance Computational Chemistry

The computational power increases over the past decades have greatly enhanced the ability to simulate chemical reactions and understand ever more complex transformations. Tensor contractions are the fundamental computational building block of these simulations. These simulations have often been tied to one platform and restricted in generality by the interface provided to the user. The expanding prevalence of accelerators and researcher demands necessitate a more general approach which is not tied to specific hardware or requires contortion of algorithms to specific hardware platforms. In this paper we present COMET, a domain-specific programming language and compiler infrastructure for tensor contractions targeting heterogeneous accelerators. We present a system of progressive lowering through multiple layers of abstraction and optimization that achieves up to 1.98×speedup for 30 tensor contractions commonly used in computational chemistry and beyond.

Mutlu, Erdal↗

Teuchos C++ memory management classes, idioms, and related topics, the complete reference : a comprehensive strategy for safe and efficient memory management in C++ for high performance computing.

The ubiquitous use of raw pointers in higher-level code is the primary cause of all memory usage problems and memory leaks in C++ programs. This paper describes what might be considered a radical approach to the problem which is to encapsulate the use of all raw pointers and all raw calls to new and delete in higher-level C++ code. Instead, a set of cooperating template classes developed in the Trilinos package Teuchos are used to encapsulate every use of raw C++ pointers in every use case where it appears in high-level code. Included in the set of memory management classes is the typical reference-counted smart pointer class similar to boost::shared ptr (and therefore C++0x std::shared ptr). However, what is missing in boost and the new standard library are non-reference counted classes for remaining use cases where raw C++ pointers would need to be used. These classes have a debug build mode where nearly all programmer errors are caught and gracefully reported at runtime. The default optimized build mode strips all runtime checks and allows the code to perform as efficiently as raw C++ pointers with reasonable usage. Also included is a novel approach for dealing with the circular references problem that imparts little extra overhead and is almost completely invisible to most of the code (unlike the boost and therefore C++0x approach). Rather than being a radical approach, encapsulating all raw C++ pointers is simply the logical progression of a trend in the C++ development and standards community that started with std::auto ptr and is continued (but not finished) with std::shared ptr in C++0x. Using the Teuchos reference-counted memory management classes allows one to remove unnecessary constraints in the use of objects by removing arbitrary lifetime ordering constraints which are a type of unnecessary coupling [23]. The code one writes with these classes will be more likely to be correct on first writing, will be less likely to contain silent (but deadly) memory usage errors, and will be much more robust to later refactoring and maintenance. The level of debug-mode runtime checking provided by the Teuchos memory management classes is stronger in many respects than what is provided by memory checking tools like Valgrind and Purify while being much less expensive. However, tools like Valgrind and Purify perform a number of types of checks (like usage of uninitialized memory) that makes these tools very valuable and therefore complement the Teuchos memory management debug-mode runtime checking. The Teuchos memory management classes and idioms largely address the technical issues in resolving the fragile built-in C++ memory management model (with the exception of circular references which has no easy solution but can be managed as discussed). All that remains is to teach these classes and idioms and expand their usage in C++ codes. The long-term viability of C++ as a usable and productive language depends on it. Otherwise, if C++ is no safer than C, then is the greater complexity of C++ worth what one gets as extra features? Given that C is smaller and easier to learn than C++ and since most programmers don't know object-orientation (or templates or X, Y, and Z features of C++) all that well anyway, then what really are most programmers getting extra out of C++ that would outweigh the extra complexity of C++ over C? C++ zealots will argue this point but the reality is that C++ popularity has peaked and is becoming less popular while the popularity of C has remained fairly stable over the last decade22. Idioms like are advocated in this paper can help to avert this trend but it will require wide community buy-in and a change in the way C++ is taught in order to have the greatest impact. To make these programs more secure, compiler vendors or static analysis tools (e.g. klocwork23) could implement a preprocessor-like language similar to OpenMP24 that would allow the programmer to declare (in comments) that certain blocks of code should be ''pointer-free'' or allow smaller blocks to be 'pointers allowed'. This would significantly improve the robustness of code that uses the memory management classes described here.

99 GENERAL AND MISCELLANEOUS↗

Principles of Product Quality Control of German Radioactive Waste Forms from the Reprocessing of Spent Fuel: Vitrification, Compaction and Numerical Simulation - 12529

The German product quality control is inter alia responsible for control of two radioactive waste forms of heat generating waste: a) homogeneous vitrified HLW and b) heterogeneous compacted hulls, end-pieces and technological metallic waste. In either case, significantly different metrology is employed at the site of the conditioning plant for the obligatory nuclide inventory declaration. To facilitate an independent evaluation and checking of the accompanying documentation numerical simulations are carried out. The physical and chemical properties of radioactive waste residues are used to assess the data consistency and uncertainty margins, as well as to predict the long-term behavior of the radioactive waste. This is relevant for repository acceptance and safety considerations. Our new numerical approach follows a bottom-up simulation starting from the burn-up behavior of the fuel elements in the reactor core. The output of these burn-up calculations is then coupled with a program that simulates the material separation in the subsequent dissolution and extraction processes normalized to the mass balance. Follow-up simulations of the separated reprocessing lines of a) the vitrification of highly-active liquid and b) the compaction of residual intermediate-active metallic hulls remaining after fuel pellets dissolution, end-pieces and technological waste, allows calculating expectation values for the various repository relevant properties of either waste stream. The principles of the German product quality control of radioactive waste residues from the spent fuel reprocessing have been introduced and explained. Namely, heat generating homogeneous vitrified HLW and heterogeneous compacted metallic MLW have been discussed. The advantages of a complementary numerical property simulation have been made clear and examples of benefits are presented. We have compiled a new program suite to calculate the physical and radio-chemical properties of common nuclear waste residues. The immediate benefit is the independent assessment of radio-active inventory declarations and much facilitated product quality control of waste residues that need to be returned to Germany and submitted to a German HLW-repository requirements. Wherever possible, internationally accepted standard programs are used and embedded. The innovative coupling of burn-up calculations (SCALE) with neutron and gamma transport codes (MCPN-X) allows an application in the world of virtual waste properties. If-then-else scenarios of hypothetical waste material compositions and distributions provide valuable information of long term nuclide property propagation under repository conditions over a very long time span. Benchmarking the program with real residue data demonstrates the power and remarkable accuracy of this numerical approach, boosting the reliability of the confidence aforementioned numerous applications, namely the proof tool set for on-the-spot production quality checking and data evaluation and independent verification. Moreover, using the numerical bottom-up approach helps to avoid the accumulation of fake activities that may gradually build up in a repository from the so-called conservative or penalizing nuclide inventory declarations. The radioactive waste properties and the hydrolytic and chemical stability can be predicted. The interaction with invasive chemicals can be assessed and propagation scenarios can be developed from reliable and sound data and HLW properties. Hence, the appropriate design of a future HLW repository can be based upon predictable and quality assured waste characteristics. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Beam Propagator for Weather Radars, Modules 1 and 2

This program simulates the beam propagation of weather radar pulses under particular and realistic atmospheric conditions (without using the assumption of standard refraction conditions). It consists of two modules: radiosondings_refract_index_many.pro (MAIN MODULE) beam_propagation_function.pro(EXTERNAL FUNCTION) FOR THE MAIN MODULE, THE CODE DOES OUTPUT--INTO A FILE--THE BEAM HEIGHT AS A FUNCTION OF RANGE. THE RADIOSONDE INPUT FILES SHOULD BE ALREADY AVAILABLE BY THE USER. FOR EXAMPLE, RADIOSONDE OBSERVATION FILES CAN BE OBTAINED AT: RADIOSONDE OBSERVATIONS DOWNLOADED AT "http://weather.uwyo.edu/upperair/soounding.html" OR "http://jervis.pyr.ec.gc.ca" THE EXTERNAL FUNCTION DOES THE ACTUAL COMPUTATION OF BEAM PROPAGATION. IT INCLUDES CONDITIONS OF ANOMALOUS PROPAGATION AND NEGATIVE ELEVATION ANGLES. THE EQUATIONS USED HERE WERE DERIVED BY EDWIN CAMPOS, BASED ON THE SNELL-DESCARTES LAW OF REFRACTION, CONSIDERING THE EARTH CURVATURE. THE PROGRAM REQUIRES A COMPILER FOR THE INTERACTIVE DATA LANGUAGE (IDL). DESCRIPTION AND VALIDATION DETAILS HAVE BEEN PUBLISHED IN THE PEER-REVIEWED SCIENTIFIC LITERATURE, AS FOLLOWS: Campos E. 2012. Estimating weather radar coverage over complex terrain, pp.26-32, peer reviewed, in Weather Radar and Hydrology, edited by Moore RJ, Cole SJ and Illingworth AJ. International Association of Hydrological Sciences (IAHS) Press, IAHS Publ. 351. ISBN 978-1-907161-26-1.

Ortega, EdwinCampos↗

ASC Tri-lab Co-design Level 2 Milestone Report 2015

In 2015, the three Department of Energy (DOE) National Laboratories that make up the Advanced Sci- enti c Computing (ASC) Program (Sandia, Lawrence Livermore, and Los Alamos) collaboratively explored performance portability programming environments in the context of several ASC co-design proxy applica- tions as part of a tri-lab L2 milestone executed by the co-design teams at each laboratory. The programming environments that were studied included Kokkos (developed at Sandia), RAJA (LLNL), and Legion (Stan- ford University). The proxy apps studied included: miniAero, LULESH, CoMD, Kripke, and SNAP. These programming models and proxy-apps are described herein. Each lab focused on a particular combination of abstractions and proxy apps, with the goal of assessing performance portability using those. Performance portability was determined by: a) the ability to run a single application source code on multiple advanced architectures, b) comparing runtime performance between \native" and \portable" implementations, and c) the degree to which these abstractions can improve programmer productivity by allowing non-portable implementation details to be hidden from the application developer. This report captures the work that was completed for this milestone, and outlines future co-design work to be performed by application developers, programming environment developers, compiler writers, and hardware vendors.

97 MATHEMATICS AND COMPUTING↗

Feasibility Study to Identify Potential Reductions in Energy Use in Tribal Buildings

Under this project, the Confederated Salish and Kootenai Tribes (CSKT) assessed the technical and economic feasibility of energy efficiency improvements to existing Tribally-owned buildings. The feasibility study followed a systematic approach in identifying, selecting, and ranking recommended measures, recognizing that the appropriateness of a measure would depend not only on technical issues but also on institutional and organizational issues, such as financing options and occupant requirements. The completed study provided the Tribes with the information needed to commit necessary resources to reduce the energy use and cost in approximately 40 Tribal buildings, including the changes that may be needed in each facility’s operation and maintenance and personnel requirements. It also presented an economic analysis of energy-efficiency capital improvements and an annotated list of financing options and possible funding sources for implementation and an overall strategy for implementation. This project was located in various Tribal communities located throughout the Flathead Indian Reservation in Western Montana. Notice: The following is a compilation of Annual Program Review Presentations, Award Modifications, and Quarterly Progress Reports submitted to the Department of Energy’s (DOE) Office of Indian Energy Policy and Programs by the Confederated Salish and Kootenai Tribes under agreement DE-EE0005171. This report covers project activities from September 30, 2011 through December 31, 2014 and has been uploaded to OSTI by DOE as a substitute for the required Final Technical Report which was not received by DOE from the project recipient.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Analysis of SNL/MSU/DOE Fatigue Database Trends for Wind Turbine Blade Materials 2010-2015.

Wind turbine blades are designed to several major structural conditions, including tip deflection, strength and b uckling during severe loading, as well as very high numbers of fatigue cycles and various service environments. The MSU Database Program has, since 1989, addressed the broad range of properties needed for current and potential blade materials through stati c and fatigue testing and test development in cooperation with Sandia National Laboratories and wind industry and supplier partners. This report is the latest in a series, giving test results and analysis for the period 2010 - 2015. Program data are compiled in a public database [1] and other reports and publications given in the cited references. The report begins with an executive summary and introductory material including background discussion of previous related studies. Section 3 describes experimental methods including processing, test methods, instrumentation and test development. Section 4 provides static tension, compression and shear stress - strain properties in three directions using coupons sectioned from a thick infused unidirectional glass/epoxy laminate. The nonlinear, shear dominated static properties were characterized with loading - u nloading - reloading (LUR) tests in tension and compression to increasing load levels, for +-45O laminates. Section 5 explores the origins of tensile fatigue sensitivity in glass fiber dominated laminates with variations in fabric architecture including speci ally prepared fabrics and aligned strand laminates. Several types of resins are considered, with variations in resin toughness and bonding to fibers, as well as cure cycle variations for an epoxy. Conclusions are drawn as to the limits of tensile fatigue r esistance and the effects of resin type and fabric architecture, including the behavior of a commercial aligned glass strand product. Interactions between cyclic fatigue response and creep are addressed for off - axis (+-45O) glass/epoxy laminates in Sectio n 6. The nonlinear fatigue and creep stress - strain and cumulative strain response are characterized in tension and compression as a function of stress level, cycles and cumulative time, using square and sinewave loading over a broad range of frequency. The results are analyzed in terms of the cycles and cumulative time under load. A cumulative strain failure criterion is established, and used to construct shear and tension constant life diagrams (CLD's) with data for nine R - values. The effects of a more duc tile urethne resin are also explored. A previous study of thick adhesives testing is extended to mixed mode fracture mechanics testing in Section 7. Mechanisms of static and fatigue crack extension near the laminate adherend interface are reported in deta il. Data are presented for mixed mode adhesive fracture, compared to mixed mode fracture in ply delamination. Fatigue crack growth exponents are also developed for a mixed mode cracked lap shear coupon. The data for fatigue trends and relative failure stra ins and exponents are compared for various blade component materials in Section 8. The effects of temperature and seawater saturation are considered for selected materials of interest for wind and hydrokinetic turbine blades in Section 9. Section 10 gives detailed conclusions for each section. A cknowledgements The research presented in this report was carried out under Sandia National Laboratories purchase orders 1325028 an d 1543945 between 2010 and 2015, with support from the DOE Wind and Water Technologies Office . In addition to the authors listed, significant contributions were made by Patrick Flaherty, Pancastya Agastra, Michael Schuster, and Michael Voth. Industry m aterials suppliers include Vectorply, Saertex, OCV, AGY, Bayer, Ashland, 3M and Nextel. Industry suppliers with significant contributions to the study were Hexion, PPG, Reichhold, Gurit and NEPTCO. Intentionally Left Blank

17 WIND ENERGY↗

Using modularity to segment binary code

We consider the problem of recovering program structure from compiled binary code. We first extract the call graph and layout of functions in memory from the compiled code and represent this information in a graphical format. We then employ Louvain's modularity algorithm to identify clusters of functions that are considered to be related. We find that the quality and properties of clusters extracted by our technique are greatly impacted by the relative importance we assign to the call graph and the ordering of functions in memory.

97 MATHEMATICS AND COMPUTING↗

Protocols for Uranium Carbon Analysis

In 1998, MST-6 (now SIGMA) installed a Horiba EMIA-8200 Carbon/Sulfur analyzer to provide the ability to perform in-house chemical analysis on a variety of materials including uranium. While many of the results and procedures were detailed in program files, no compiled record of the overall analytic process was ever published. This retrospective utilizes existing logbooks, operator interviews, instrument manuals, and notes to catalog what is known about the past procedures and protocols for carbon analysis that were established and present the data informing those decisions.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Program structure-based blocking

Embodiments relate to program structure-based blocking. An aspect includes receiving source code corresponding to a computer program by a compiler of a computer system. Another aspect includes determining a prefetching section in the source code by a marking module of the compiler. Yet another aspect includes performing, by a blocking module of the compiler, blocking of instructions located in the prefetching section into instruction blocks, such that the instruction blocks of the prefetching section only contain instructions that are located in the prefetching section.

97 MATHEMATICS AND COMPUTING↗

Program structure-based blocking

Embodiments relate to program structure-based blocking. An aspect includes receiving source code corresponding to a computer program by a compiler of a computer system. Another aspect includes determining a prefetching section in the source code by a marking module of the compiler. Yet another aspect includes performing, by a blocking module of the compiler, blocking of instructions located in the prefetching section into instruction blocks, such that the instruction blocks of the prefetching section only contain instructions that are located in the prefetching section.

97 MATHEMATICS AND COMPUTING↗

Can Large Language Models Understand Intermediate Representations?

Intermediate Representations (IRs) are essential in compiler design and program analysis, yet their comprehension by Large Language Models (LLMs) remains underexplored. This paper presents a pioneering empirical study to investigate the capabilities of LLMs, including GPT-4, GPT-3, Gemma 2, LLaMA 3.1, and Code Llama, in understanding IRs. We analyze their performance across four tasks: Control Flow Graph (CFG) reconstruction, decompilation, code summarization, and execution reasoning. Our results indicate that while LLMs demonstrate competence in parsing IR syntax and recognizing high-level structures, they struggle with control flow reasoning, execution semantics, and loop handling. Specifically, they often misinterpret branching instructions, omit critical IR operations, and rely on heuristic-based reasoning, leading to errors in CFG reconstruction, IR decompilation, and execution reasoning. The study underscores the necessity for IR-specific enhancements in LLMs, recommending fine-tuning on structured IR datasets and integration of explicit control flow models to augment their comprehension and handling of IR-related tasks.

Jiang, Hailong↗

Establishing Malware Attribution and Binary Provenance Using Multicompilation Techniques

Malware is a serious problem for computer systems and costs businesses and customers billions of dollars a year in addition to compromising their private information. Detecting malware is particularly difficult because malware source code can be compiled in many different ways and generate many different digital signatures, which causes problems for most anti-malware programs that rely on static signature detection. Our project uses a convolutional neural network to identify malware programs but these require large amounts of data to be effective. Towards that end, we gather thousands of source code files from publicly available programming contest sites and compile them with several different compilers and flags. Building upon current research, we then transform these binary files into image representations and use them to train a long-term recurrent convolutional neural network that will eventually be used to identify how a malware binary was compiled. This information will include the compiler, version of the compiler and the options used in compilation, information which can be critical in determining where a malware program came from and even who authored it.

97 MATHEMATICS AND COMPUTING↗