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 181 records · Page 10

2010 Remediation Effectiveness Report for the U.S. Department of Energy Oak Ridge Reservation, Oak Ridge, Tennessee - Data and Evaluations

Under the requirements of the Oak Ridge Reservation (ORR) Federal Facility Agreement (FFA) established between the U.S. Department of Energy (DOE), the U.S. Environmental Protection Agency, (EPA) and the Tennessee Department of Environment and Conservation (TDEC) in 1992, all environmental restoration activities on the ORR are performed in accordance with the Comprehensive Environmental Response, Compensation, and Liability Act of 1980 (CERCLA). Since the 1990s, the environmental restoration activities have experienced a gradual shift from characterization to remediation. As this has occurred, it has been determined that the assessment of the individual and cumulative performance of all ORR CERCLA remedial actions (RAs) is most effectively tracked in a single document. The Remediation Effectiveness Report (RER) is an FFA document intended to collate all ORR CERCLA decision requirements, compare pre- and post-remediation conditions at CERCLA sites, and present the results of any required post-decision remediation effectiveness monitoring. First issued in 1997, the RER has been reissued annually to update the performance histories of completed actions and to add descriptions of new CERCLA actions. Monitoring information used in the 2010 RER to assess remedy performance was collected and/or compiled by DOE's Water Resources Restoration Program (WRRP). Only data used to assess performance of completed actions are provided. In addition to collecting CERCLA performance assessment data, the WRRP also collects baseline data to be used to gauge the effectiveness of future actions once implemented. These baseline data are maintained in the Oak Ridge Environmental Information System and will be reported in future RERs, as necessary, once the respective actions are completed. However, when insufficient data exist to assess the impact of the RAs, e.g., when the RA was only recently completed, a preliminary evaluation is made of early indicators of effectiveness at the watershed scale, such as contaminant trends at surface water integration points (IPs). Long-term stewardship (LTS) information used in this report is collected, compiled, and tracked by the WRRP in conjunction with the Bechtel Jacobs Company LLC (BJC) Surveillance and Maintenance (S&M) program, the BJC Radiation Protection Organization at East Tennessee Technology Park (ETTP), and the ETTP Environmental Compliance Program. Additionally, documentation verifying the implementation of administrative land use controls (LUCs) [i.e., property record restrictions, property record notices, zoning notices, and excavation/penetration permit (EPP) program] is also obtained from many sources throughout the fiscal year (FY), including County Register of Deeds offices for property record restrictions and property record notices, City Planning Commission for zoning notices, and BJC project engineers for EPP program verification. Copies of this documentation are obtained by the WRRP and maintained with the project RER files.

54 ENVIRONMENTAL SCIENCES↗

2011 Remediation Effectiveness Report for the U.S. Department of Energy Oak Ridge Reservation, Oak Ridge, Tennessee - Data and Evaluations

Under the requirements of the Oak Ridge Reservation (ORR) Federal Facility Agreement (FFA) established between the U.S. Department of Energy (DOE), the U.S. Environmental Protection Agency, (EPA) and the Tennessee Department of Environment and Conservation (TDEC) in 1992, all environmental restoration activities on the ORR are performed in accordance with the Comprehensive Environmental Response, Compensation, and Liability Act of 1980 (CERCLA). Since the 1990s, the environmental restoration activities have experienced a gradual shift from characterization to remediation. As this has occurred, it has been determined that the assessment of the individual and cumulative performance of all ORR CERCLA remedial actions (RAs) is most effectively tracked in a single document. The Remediation Effectiveness Report (RER) is an FFA document intended to collate all ORR CERCLA decision requirements, compare pre- and post-remediation conditions at CERCLA sites, and present the results of any required post-decision remediation effectiveness monitoring. First issued in 1997, the RER has been reissued annually to update the performance histories of completed actions and to add descriptions of new CERCLA actions. Monitoring information used in the 2011 RER to assess remedy performance was collected and/or compiled by DOE's Water Resources Restoration Program (WRRP). Only data used to assess performance of completed actions are provided. In addition to collecting CERCLA performance assessment data, the WRRP also collects baseline data to be used to gauge the effectiveness of future actions once implemented. These baseline data are maintained in the Oak Ridge Environmental Information System and will be reported in future RERs, as necessary, once the respective actions are completed. However, when insufficient data exist to assess the impact of the RAs, e.g., when the RA was only recently completed, a preliminary evaluation is made of early indicators of effectiveness at the watershed scale, such as contaminant trends at surface water integration points (IFs). Long-term stewardship (LTS) information used in this report is collected, compiled, and tracked by the WRRP in conjunction with the Bechtel Jacobs Company LLC (BJC) Surveillance and Maintenance (S&M) program, the BJC Radiation Protection Organization at East Tennessee Technology Park (ETTP), ETTP Environmental Compliance Program, B&W Y-12 Liquid Waste Treatment Operations, and UT Battelle Facilities Management Division. Additionally, documentation verifying the implementation of administrative land use controls (LUCs) [i.e., property record restrictions, property record notices, zoning notices, and excavation/penetration permit (EPP) program] is also obtained from many sources throughout the fiscal year (FY), including County Register of Deeds offices for property record restrictions and property record notices, City Planning Commission for zoning notices, and BJC project engineers for EPP program verification. Copies of this documentation are obtained by the WRRP and maintained with the project RER files.

54 ENVIRONMENTAL SCIENCES↗

OpenMP for Accelerators

OpenMP [13] is the dominant programming model for shared-memory parallelism in C, C++ and Fortran due to its easy-to-use directive-based style, portability and broad support by compiler vendors. Similar characteristics are needed for a programming model for devices such as GPUs and DSPs that are gaining popularity to accelerate compute-intensive application regions. This paper presents extensions to OpenMP that provide that programming model. Our results demonstrate that a high-level programming model can provide accelerated performance comparable to hand-coded implementations in CUDA.

97 MATHEMATICS AND COMPUTING↗

Exploiting first-class arrays in Fortran for accelerator programming

Emerging architectures for high performance computing often are well suited to a data parallel programming model. This paper presents a simple programming methodology based on existing languages and compiler tools that allows programmers to take advantage of these systems. We will work with the array features of Fortran 90 to show how this infrequently exploited, standardized language feature is easily transformed to lower level accelerator code. Our transformations are based on a mapping from Fortran 90 to C++ code with OpenCL extensions. The sheer complexity of programming for clusters of many or multi-core processors with tens of millions threads of execution make the simplicity of the data parallel model attractive. Furthermore, the increasing complexity of todays applications (especially when convolved with the increasing complexity of the hardware) and the need for portability across hardware architectures make a higher-level and simpler programming model like data parallel attractive. The goal of this work has been to exploit source-to-source transformations that allow programmers to develop and maintain programs at a high-level of abstraction, without coding to a specific hardware architecture. Furthermore these transformations allow multiple hardware architectures to be targeted without changing the high-level source. It also removes the necessity for application programmers to understand details of the accelerator architecture or to know OpenCL.

43 PARTICLE ACCELERATORS↗

Tough Errors Are no Match (TEAM): Optimizing the Quantum Compiler for Noise Resilience

This report summarizes research performed under the Tough Errors Are no Match (TEAM) project. The primary focus of TEAM has been to research and develop a compilation toolbox leveraging techniques from quantum characterization and control, probabilistic programming, and approximate computing. Our goal was to develop robust protocols that can be integrated into quantum compilers to optimize and enhance the robustness of noisy computation. Here, we provide a summary of TEAM work focused on characterization and control of quantum systems.

97 MATHEMATICS AND COMPUTING↗

The Epoch of Giant Planet Migration Planet Search Program. I. Near-infrared Radial Velocity Jitter of Young Sun-like Stars

We present early results from the Epoch of Giant Planet Migration program, a precise radial velocity (RV) survey of more than 100 intermediate-age (∼20–200 Myr) G and K dwarfs with the Habitable Zone Planet Finder spectrograph (HPF) at McDonald Observatory’s Hobby–Eberly Telescope. The goals of this program are to determine the timescale and dominant physical mechanism of giant planet migration interior to the water ice line of Sun-like stars. Here, we summarize results from the first 14 months of this program, with a focus on our custom RV pipeline for HPF, a measurement of the intrinsic near-infrared RV activity of young Solar analogs, and modeling the underlying population-level distribution of stellar jitter. We demonstrate on-sky stability at the sub-2 m s{sup −1} level for the K2 standard HD 3765 using a least-squares matching method to extract precise RVs. Based on a subsample of 29 stars with at least three RV measurements from our program, we find a median rms level of 34 m s{sup −1}. This is nearly a factor of 2 lower than the median rms level in the optical of 60 m s{sup −1} for a comparison sample with similar ages and spectral types as our targets. The observed near-infrared jitter measurements for this subsample are well reproduced with a log-normal parent distribution with μ = 4.15 and σ = 1.02. Finally, by compiling rms values from previous planet search programs, we show that near-infrared jitter for G and K dwarfs generally decays with age in a similar fashion to optical wavelengths, albeit with a shallower slope and lower overall values for ages ≲1 Gyr.

79 ASTRONOMY AND ASTROPHYSICS↗

UPC++

UPC++ is a Partitioned Global Address Space (PGAS) extension for C++, with three main objectives: 1) to provide an object-oriented PGAS programming model in the context of the popular C++ language; 2) to add useful parallel programming idioms unavailable in UPC, such as asynchronous remote function invocation and multidimensional arrays, to support complex scientific applications; 3) to offer an easy on-ramp to PGAS programming through interoperability with other existing parallel programming systems (e.g., MPI, OpenMP, CUDA). UPC++ includes two main features beyond UPC: 1) One of the major limitations of UPC in the context of DOE application is the relatively weak notion of multidimensional arrays, which it inherited from C. To remedy this problem in UPC++, we included a multidimensional domain and array library based on that of Titanium. Titanium's library is similar to Chapel's dense and strided domains, as both were inspired by the dense and strided regions and arrays in ZPL. 2) Another feature provided by UPC++ but not by UPC is remote function invocation, which is inspired by Phalanx, X10, Habanero-C, and C++11. The user may start an asynchronous remote function invocation with the following syntax: "async(place)(function, args...);". UPC++ provides two programming constructs for specifying dynamic dependencies among tasks: 1) event-driven execution as in Phalanx and Habanero-C; 2) finish-async as in X10. We implemented UPC++ with a "compiler-free" approach using C++ templates and runtime libraries. The UPC++ front-end consists of a set of C++ header files that enables the C++ compiler to "translate" UPC++ features in a user program to runtime library calls. In particular, we use templates and operator overloading to customize the behavior of UPC++ types. This software package has been replaced with UPCC++ V 1.0

Amir Kamil, YiliZheng↗

sKokkos: Enabling Kokkos with Transparent Device Selection on Heterogeneous Systems using OpenACC

This paper presents a new feature to enable Kokkos with transparent device selection. For application developers, it is not easy toidentify which device is the most appropriate to use in a heterogeneous system, since this depends on the characteristics of both the application and the hardware. In Kokkos, a backend is associated with one specific programming model/hardware. Programmers decide which backend to use at compilation time. This new feature implemented on the OpenACC backend eliminates the burden of deciding which device to use, providing a highly productive programming solution for Kokkos applications. This work includes implementation details and a performance study conducted with a set of mini-benchmarks (i.e., AXPY and dot product), kernels (Lattice-Bolzmann method), and two mini-apps (LULESH and miniFE) on two heterogeneous systems with different hardware capabilities. This new Kokkos feature provides high accelerations of up to 35× thanks to automatic and transparent device selection.

Lee, Seyong↗

An MLIR-based Compiler Flow for System-Level Design and Hardware Acceleration

The generation of custom hardware accelerators for applications implemented within high-level productive programming frameworks requires considerable manual effort. To automate this process, we introduce \sodaopt, a compiler tool that extends the MLIR infrastructure. \sodaopt automatically searches, outlines, tiles, and pre-optimizes relevant code regions to generate high-quality accelerators through high-level synthesis. \sodaopt can support any high-level programming framework and domain-specific language that interface with the MLIR infrastructure. By leveraging MLIR, \sodaopt solves compiler optimization problems with specialized abstractions. Backend synthesis tools connect to \sodaopt through progressive intermediate representation lowerings. \sodaopt interfaces to a design space exploration engine to identify the combination of compiler optimization passes and options that provides high-performance generated designs for different backends and targets. We demonstrate the practical applicability of the compilation flow by exploring the automatic generation of accelerators for deep neural networks operators outlined at arbitrary granularity and by combining outlining with tiling on large convolution layers. Experimental results with kernels from the PolyBench benchmark show that \sodaopt high-level optimizations improve execution delays of synthesized accelerators up to 60x. We also show that for the selected kernels, our solution outperforms the current of state-of-the art in more than 70% of the benchmarks and provides better average speedup in 55% of them.

Bohm Agostini, Nicolas↗

Experiences in extending parallware to support OpenACC. In: WACCPD '15 Proceedings of the Second Workshop on Accelerator Programming using Directives, Article No. 4

Porting scientific codes to accelerator-based computers using OpenACC and OpenMP is an important topic for the HPC community. Programmability, performance portability and developer productivity are key issues for the widespread use of these systems. In the scope of general-purpose parallel computing, Parallware is a new commercial OpenMP-enabling source-to-source compiler that automatically adds OpenMP capabilities in scientific programs. Thus, extending Parallware with OpenACC or OpenMP 4.x support would contribute to improve programmability and developer productivity. In contrast, the performance portability of such approach needs to be demonstrated in practice. This paper presents a preliminary study to extend Parallware with OpenACC support for GPU devices. A simple benchmark suite has been designed to mimic important features and computational patterns of real scientific applications. Handcoded OpenACC versions are compared to OpenMP versions automatically generated by Parallware. Performance is evaluated with the PGI OpenACC compiler on systems accelerated with NVIDIA GPUs.

Lobeiras, Jacobo↗

Panda: A Compiler Framework for Concurrent CPU $+$ GPU Execution of 3D Stencil Computations on GPU-accelerated Supercomputers

We present a new compiler framework for truly heterogeneous 3D stencil computation on GPU clusters. Our framework consists of a simple directive-based programming model and a tightly integrated source-to-source compiler. Annotated with a small number of directives, sequential stencil C codes can be automatically parallelized for large-scale GPU clusters. The most distinctive feature of the compiler is its capability to generate hybrid MPI$+$ CUDA$+$ OpenMP code that uses concurrent CPU$+$ GPU computing to unleash the full potential of powerful GPU clusters. The auto-generated hybrid codes hide the overhead of various data motion by overlapping them with computation. Test results on the Titan supercomputer and the Wilkes cluster show that auto-translated codes can achieve about 90 % of the performance of highly optimized handwritten codes, for both a simple stencil benchmark and a real-world application in cardiac modeling. The user-friendliness and performance of our domain-specific compiler framework allow harnessing the full power of GPU-accelerated supercomputing without painstaking coding effort.

97 MATHEMATICS AND COMPUTING↗

PABS: A Computer Program to Normalize Emission Probabilities and Calculate Realistic Uncertainties

The program PABS normalizes relative particle emission probabilities to an absolute scale and calculates the relevant uncertainties on this scale. The program is written in Java using the JDK 1.6 library. For additional information about system requirements, the code itself, and compiling from source, see the README file distributed with this program. The mathematical procedures used are given below.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Final Technical Report for Award DE-FG02-98ER41080

The prime motivation of the project at McMaster University was to carry out the critical evaluation and compilation of Nuclear Structure and Decay data, and of nuclear astrophysics data with continued participation in the United States Nuclear Data Program (US-NDP). A large body of evaluated and compiled structure data were supplied for databases such as ENSDF, XUNDL, NSR, etc. residing on webpage of National Nuclear Data Center of the Brookhaven National Laboratory, Upton, New York, USA. Thermonuclear reaction rates of importance to stellar explosions, such as novae, x-ray bursts and supernovae, were evaluated as well. This effort was closely coupled to our ongoing experimental effort, which took advantage of radioactive ion beam and stable beam facilities worldwide to study these key reaction rates. This report contains brief descriptions of the various activities together with references to all the publications in peer-reviewed journals which were the result of work carried out with the award DE-FG02-98-ER41080, during 1998-2013.

Chen, Alan↗

LLM Benchmarking with LLaMA2: Evaluating Code Development Performance Across Multiple Programming Languages

The rapid evolution of large language models (LLMs) has opened new possibilities for automating various tasks in software development. This paper evaluates the capabilities of the LLaMA 2-70B model in automating these tasks for scientific applications written in commonly used programming languages. Using representative test problems, we assess the model's capacity to generate code, documentation, and unit tests, as well as its ability to translate existing code between commonly used programming languages. Our comprehensive analysis evaluates the compilation, runtime behavior, and correctness of the generated and translated code. Additionally, we assess the quality of automatically generated code, documentation, and unit tests. Here, our results indicate that while LLaMA 2-70B frequently generates syntactically correct and functional code for simpler numerical tasks, it encounters substantial difficulties with more complex, parallelized, or distributed computations, requiring considerable manual corrections. We identify key limitations and suggest areas for future improvements to better leverage AI-driven automation in scientific computing workflows.

97 MATHEMATICS AND COMPUTING↗

Nuclear Archival Electronic Database

The Nuclear Archival Electronic Database (NAED) supports a work scope that has been focused on providing a framework for and preserving key experimental programs and experiences which are critical to the licensing basis of currently operating nuclear reactors or which could be used in the safety basis for the next generation of reactors. It aims at preserving the results of experimental programs for the safety of light water cooled and advanced reactors by locating and documenting, to the extent possible, where the experimental test information for these programs has been archived. The NAED is a compilation of the following: (a) list of experiments or experiences categorized by coolant type, (b) results of an information search, and documentation, of the experiments and experiences that are already considered archived and (c) results of a deep dive and interview on a single experimental program or experience. The intent is to use the NAED as a technology source document by reactor vendors, regulators, and utility personnel.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Tough Errors are no Match (TEAM): Optimizing the Quantum Compiler for Noise Resilience

This project builds toward a comprehensive error-mitigating toolkit that makes quantum programming more robust and adaptive to the noisy, resource-limited nature of today’s quantum hardware. To that end, it integrates established error-mitigation methods — such as zero-noise extrapolation and dynamical decoupling — directly into compiler infrastructures. These techniques will be packaged as modules that can automatically adjust and combine based on performance analysis, enabling compilers to explore large design spaces and produce optimized, low-noise quantum programs with minimal manual intervention. In parallel, this project also explores new approaches to analog quantum programming or quantum simulation, and has developed the programming language SimuQ which treats quantum Hamiltonian evolution as the central object.

97 MATHEMATICS AND COMPUTING↗

Using Coarrays to Parallelize Legacy Fortran Applications: Strategy and Case Study

This paper summarizes a strategy for parallelizing a legacy Fortran 77 program using the object-oriented (OO) and coarray features that entered Fortran in the 2003 and 2008 standards, respectively. OO programming (OOP) facilitates the construction of an extensible suite of model-verification and performance tests that drive the development. Coarray parallel programming facilitates a rapid evolution from a serial application to a parallel application capable of running on multicore processors and many-core accelerators in shared and distributed memory. We delineate 17 code modernization steps used to refactor and parallelize the program and study the resulting performance. Our initial studies were done using the Intel Fortran compiler on a 32-core shared memory server. Scaling behavior was very poor, and profile analysis using TAU showed that the bottleneck in the performance was due to our implementation of a collective, sequential summation procedure. We were able to improve the scalability and achieve nearly linear speedup by replacing the sequential summation with a parallel, binary tree algorithm. We also tested the Cray compiler, which provides its own collective summation procedure. Intel provides no collective reductions. With Cray, the program shows linear speedup even in distributed-memory execution. We anticipate similar results with other compilers once they support the new collective procedures proposed for Fortran 2015.

Radhakrishnan, Hari↗

A Polyhedral Transformation Framework for Compiler Optimization (Final Project Report)

The project developed the polyhedral compiler transformation module PolyOpt/Fortran in the ROSE compiler framework. PolyOpt/Fortran performs automated transformation of affine loop nests within FORTRAN programs for enhanced data locality and parallel execution. A FORTAN version of the Polybench library was also developed by the project. A third development was a dynamic analysis approach to gauge vectorization potential within loops of programs; software (DDVec) for automated instrumentation and dynamic analysis of programs was developed.

97 MATHEMATICS AND COMPUTING↗