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 487 records · Page 27

Recent SCALE Activities Within the Nuclear Criticality Safety Program

The role of SCALE in the Department of Energy’s Nuclear Criticality Safety Program (NCSP) is defined according to the Five-Year Plan, and summarized as follows. 1. Sustain/improve SCALE NCS features through user driven enhancements, software quality assurance (SQA) and validation and verification (V&V). 2. Assure adaptability to various computing platforms and compilers. 3. Improve user interfaces/documentation consistent with modern engineering software. 4. Support responsive communication to SCALE criticality safety users through SCALE Newsletters, email notices, and updates on the SCALE website. 5. Modernize software infrastructure and capabilities to improve quality and reliability and to ensure long term sustainability of the NCS capabilities. This paper describes the specific activities which have been performed within each area above for the NCSP in the fiscal year (FY) 2018, from October 1, 2017, to September 30, 2018.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Applying Best Practices to Florida Local Government Retrofit Programs, Central Florida (Fact Sheet)

In some communities, local government and non-profit entities have funds to purchase and renovate distressed, foreclosed homes for resale in the affordable housing market. Numerous opportunities to improve whole house energy efficiency are inherent in these comprehensive renovations. BA-PIRC worked together in a multi-year field study making recommendations in individual homes, meanwhile compiling improvement costs, projected energy savings, practical challenges, and labor force factors surrounding common energy-related renovation measures. The field study, Phase 1 of this research, resulted in a set of best practices appropriate to the current labor pool and market conditions in central Florida to achieve projected annual energy savings of 15-30% and higher. This report describes Phase 2 of the work where researchers worked with a local government partner to implement and refine the "current best practices". A simulation study was conducted to characterize savings potential under three sets of conditions representing varying replacement needs for energy-related equipment and envelope components. The three scenarios apply readily to the general remodeling industry as for renovation of foreclosed homes for the affordable housing market. Our new local government partner, the City of Melbourne, implemented the best practices in a community-scale renovation program that included ten homes in 2012.

30% SAVINGS↗

Graph Algorithms in PGAS: Chapel and UPC++

The Partitioned Global Address Space (PGAS) programming model can be implemented «««< HEAD either with programming language features or with runtime library APIs, each implementation favoring different aspects (e.g., productivity, abstraction, flexibility, or performance). Certain language and runtime features, such as collectives, explicit and asynchronous communication primitives, and constructs facilitating overlap of communication and computation (such as futures and conjoined futures) can enable better performance and scaling for irregular applications, in particular for distributed graph analytics. We compare graph algorithms in one of each of these environments: the Chapel PGAS programming language and the UPC++ PGAS runtime library. We implement algorithms for breadth-first search and triangle counting graph kernels in both environments. We discuss the code in each of the environments, and compile performance data on a Cray Aries and an Infiniband platform. Our results show that the library-based approach of UPC++ currently provides strong performance while Chapel provides a high-level abstraction that, harder to optimize, still provides comparable performance. We argue that various language primitives and runtime library features should be considered in conjunction with each other to design future graph analytics libraries so as to incorporate the best of both worlds.

Distributed Algorithms, Graph algorithms, HPC↗

The SODA Approach: Leveraging High-Level Synthesis for Hardware/Software Co-design and Hardware Specialization: Invited

Novel "converged" applications combine phases of scientific simulation with data analysis and machine learning. Each computational phase can benefit from specialized accelerators. However, algorithms evolve so quickly that mapping them on existing accelerators is suboptimal or even impossible. This paper presents the SODA (Software Defined Accelerators) framework, a modular, multi-level, open-source, no-human-in-the-loop, hardware synthesizer that enables end-to-end generation of specialized accelerators. SODA is composed of SODA-Opt, a high-level frontend developed in MLIR that interfaces with domain-specific programming frameworks and allows performing system level design, and Bambu, a state-of-the-art high-level synthesis engine that can target different device technologies. The framework implements design space exploration as compiler optimization passes. We show how the modular, yet tight, integration of the high-level optimizer and lower-level HLS tools enables the generation of accelerators optimized for the computational patterns of converged applications. We then discuss some of the research opportunities that such a framework allows, including system-level design, profile driven optimization, and supporting new optimization metrics.

Bohm Agostini, Nicolas↗

Manycore Performance-Portability: Kokkos Multidimensional Array Library

Large, complex scientific and engineering application code have a significant investment in computational kernels to implement their mathematical models. Porting these computational kernels to the collection of modern manycore accelerator devices is a major challenge in that these devices have diverse programming models, application programming interfaces (APIs), and performance requirements. The Kokkos Array programming model provides library-based approach to implement computational kernels that are performance-portable to CPU-multicore and GPGPU accelerator devices. This programming model is based upon three fundamental concepts: (1) manycore compute devices each with its own memory space, (2) data parallel kernels and (3) multidimensional arrays. Kernel execution performance is, especially for NVIDIA® devices, extremely dependent on data access patterns. Optimal data access pattern can be different for different manycore devices – potentially leading to different implementations of computational kernels specialized for different devices. The Kokkos Array programming model supports performance-portable kernels by (1) separating data access patterns from computational kernels through a multidimensional array API and (2) introduce device-specific data access mappings when a kernel is compiled. An implementation of Kokkos Array is available through Trilinos [Trilinos website, http://trilinos.sandia.gov/, August 2011].

Edwards, H. Carter↗

miniWeather

The code “miniWeather” solves the 2-D Euler equations with a Finite-Volume method on a regular Cartesian grid with Runge-Kutta time stepping, 4th-order hypervisocisty, and 4th-order spatial accuracy. The code is primarily a parallel programming training mini application in Fortran, C, and C++ with MPI, OpenMP, OpenMP offload, OpenACC, and C++ portability approaches. It can also serve as a mini application for acceptance testing for new machines and compilers for both functionality and performance.

Norman, MatthewR↗

A Report on the Implementation of Smart Grids in Mexico

As part of Mexico's implementation of its constitutional energy reform and the transformation of its electric power industry, Mexico is addressing the central importance of a modernized grid. The energy sector reform laws establish a Smart Grid Program to make Mexico's power grid capable of meeting the country's lofty clean energy goals while improving efficiencies, maintaining system reliability, and increasing its security. Implementing Smart Grids in Mexico required a compilation of data and information from many sources that document Mexico's progress in implementing a Smart Grid. In this report, various knowledge experts contribute with an assessment on the topics of the legislation that created the sectoral transformation now underway; the state of smart grid technology in Mexico's power sector and the efforts undertaken to date; a review of policy in the power sector describing the development of the Smart Grid Implementation Plan by the Ministry of Energy; a review of Mexico's priorities for smart grid deployment; the mapping of several smart grid measures to the specific smart grid drivers; substantial detail from smart grid experts from NREL and from Swedish smart grid research centers describing smart grid measures to assist Mexico's move to a cleaner, more-efficient grid; institutional policies that are recommended for smart grid growth; discussion of some of the barriers to smart grid deployment, including cybersecurity concerns and consumer receptivity.

24 POWER TRANSMISSION AND DISTRIBUTION↗

OpenACC Profiling Support for Clang and LLVM using Clacc and TAU

Since its launch in 2010, OpenACC has evolved into one of the most widely used portable programming models for accelerators on HPC systems today. Clacc is a project funded by the US Exascale Computing Project (ECP) to bring OpenACC support for C and C++ to the popular Clang and LLVM compiler infrastructure. In this paper, we describe Clacc's support for the OpenACC Profiling Interface, a critical component of the OpenACC specification that standardizes an interface that profiling tools and libraries can depend upon across OpenACC implementations. As part of Clacc's general strategy to build OpenACC support upon OpenMP, we describe how Clacc builds OpenACC Profiling Interface support upon an extended version of OMPT. We then describe how a major profiling and tracing toolkit within ECP, the TAU Performance System, takes advantage of this support. We also describe TAU's selective instrumentation support for OpenACC. Finally, using Clacc and TAU, we present example visualizations for several SPEC ACCEL OpenACC benchmarks running on an IBM AC922 node, and we show that the associated performance overhead is negligible.

Coti, Camille↗

Verification and Analysis of Spent Fuel Safety Information Database in Korea - 18252

The Public Engagement Commission on SNF management (PECOS) published the recommendation report on the spent fuel management of Korea in June, 2015. Based on this report, the national basic policy for high level radioactive waste management of Korea was established and promulgated, taking into consideration the national/international trends on policy and technology development. According to the national plan, the siting for deep geological disposal facility of high level radioactive waste will be proceeded by 2028. Once the site is selected at somewhere, centralized spent fuel storage facility will be constructed by 2035 at the same site while research program is ongoing to determine the compatibility of the site for disposal facility. According to the enforcement decree of the nuclear safety act, the definition of 'interim storage' is that a safe storage of spent fuel which is received from NPP operator for a specified period, until it is processed or permanently disposed of. It means that spent fuels should be taken over with integrated information of spent fuel from NPP operator to the KORAD (Korea Radioactive waste agency). The aim of this study is to confirm and analyze present and future spent fuel data in order to provide the basic information to the safety research on the transport and storage of spent fuel in Korea. AMORES (Automatic Multi-batch ORIGEN Runner for Evaluation of Spent fuel) was used for the aim of this study. All 16,160 bundles of PWR spent fuel database as of the end of 2015 and the expected spent fuel which will be generated from 2016 to 2053 are evaluated and verified based on national basic plan. Through scenario analysis, it was estimated that approximately 15,000 MTU of spent fuel will be transported to intermediate storage facilities by 2052. Therefore, 44%, 6%, and 33% of spent fuel will be left in Kori, Hanbit and Hanul sites, respectively. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Low-GWP HVAC System with Ultra-small Centrifugal Compression

Mechanical Solutions, Incorporated (MSI) was awarded a contract from the United States Department of Energy under Contract DE-EE0007042 to advance the potential of vapor compression utilizing an advanced high speed centrifugal compressor with an advanced heat exchanger design. The design was mandated to maintain high efficiency while utilizing a low GWP refrigerant. The specific goal of this program was to develop an advanced 5 ton air conditioning system. The target of the air conditioner is residential and commercial. To accomplish these goals, MSI teamed with Lennox International, a leading air conditioning manufacturer. MSI would design, oversee manufacturing, assemble, and test the compressor, while Lennox designed the heat exchanger and tested the overall air conditioner. Lennox initiated the project with a detailed cycle analysis that examined systems and refrigerants. At various break points, MSI performed a preliminary compressor design to identify realizable targets. Initially, the refrigerant that was targeted was R1234ze(E), but this was subsequently rejected over concerns of flammability. R515a was ultimately accepted as a qualified fluid based upon its GWP and flammability rating. MSI performed a complete design of the centrifugal compressor based upon the cycle system design and analysis. The design was based upon advanced aerodynamics utilizing transient Computational Fluid Dynamics (CFD), as well as mechanical and rotordynamic analysis. A detailed materials investigation was conducted to ensure mechanical integrity and refrigerant compatibility. To achieve the high rotational speed required by the compressor (105,300 rpm), foil bearings were designed by MSI, as was a high speed motor to provide the required torque for the compressor. All elements of the design complied with Design for Manufacturing and Assembly (DFMA) principles. The compressor was manufactured in components, utilizing specializing subcontractors throughout the country. The components were assembled into an operational compressor in MSI’s Albany facility, where it was tested in the MSI refrigeration test loop. The compressor achieved 90% of its maximum speed during testing at MSI. The interaction between the inverter and the high speed motor was the reason that full speed could not be attained. The compressor operated smoothly and quietly at all speeds, with the bearings performing as expected. The compressor was then shipped to Lennox’s facilities in Texas, where it was tested in the entire air conditioning system. Lennox was able to achieve 95% of the maximum rotational speed. They employed the same inverter as MSI. Lennox compiled the results of the testing and based upon the results, a go forward plan has been developed to correct the issues with the inverter, as well as redesign some parts that proved to be a challenge during the program. The consensus of the team is that a fully functional air conditioning system can be developed to achieve all of the goals identified in this program.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

The Kokkos OpenMPTarget Backend: Implementation and Lessons Learned

As the supercomputing landscape diversifies, solutions such as Kokkos to write vendor agnostic applications and libraries have risen in popularity. Kokkos provides a programming model designed for performance portability, which allows developers to write a single source implementation that can run efficiently on various architectures. At its heart, Kokkos maps parallel algorithms to architecture and vendor specific backends written in lower level programming models such as CUDA and HIP. Another approach to writing vendor agnostic parallel code is using OpenMP’s directives based approach, which lets developers annotate code to express parallelism. It is implemented at the compiler level and is supported by all major high performance computing vendors, as well as the primary Open Source toolchains GNU and LLVM. Since its inception, Kokkos has used OpenMP to parallelize on CPU architectures. In this paper, we explore leveraging OpenMP for a GPU backend and discuss the challenges we encountered when mapping the Kokkos APIs and semantics to OpenMP target constructs. As an exemplar workload we chose a simple conjugate gradient solver for sparse matrices. We find that performance on NVIDIA and AMD GPUs varies widely based on details of the implementation strategy and the chosen compiler. Furthermore, the performance of the OpenMP implementations decreases with increasing complexity of the investigated algorithms.

Gayatri, Rahulkumar↗

NbTaV_BCC_SolidSolution_128atoms_VASP6

We performed density functional theory (DFT) calculations for body-centered-cubic (BCC) structures with 128 lattices sites of solid solution ternary alloys niobium-tantalum-vanadium (Nb-Ta-V). The first-principle code that has been used to run the calculations is the closed-source Vienna Ab-Initio Simulation Package (VASP). The calculations have been collected by sampling chemical compositions across the entire compositional range. The chemical compositions have been sampled by progressively changing the number of atoms per constituent by 8. For each chemical composition of binaries and ternaries, the first-principle calculations have been run for 100 randomized arrangements of the constituents on the BCC lattice sites. We collected data for a total of 10,500 randomized atomic structures over 105 chemical compositions. The calculations have been collected on NERSC-Perlmutter using the VASP 6.3.2. The VASP calculations for every atomic structure have been performed in 2 main steps: 1. Starting from an ideal body-centered-cubic (BCC) structure, geometry optimization with low precision has been executed to perform a preliminary optimization of the atomic structure. The output for this calculations is available in the files 0.CONTCAR, 0.OUTCAR, rlx1.out. 2. Using the atomic structure resulting from the preliminary geometry optimization, a second geometry optimization has been performed using normal precision. The output for this calculations is available in the files CONTCAR, OUTCAR, rlx2.out, vaspout.h5, and vasprun.xml. Every chemical composition sampled across the composition range in the dataset has its own directory. The convention used to name the directories for ternary alloys is AXBYCZ, where A, B, and C refer to the constituents, and X, Y, and Z are positive integers that represent the number of atoms for each constituent and their values still sum up to 128. Each atomic structure associated with a specific chemical composition has its own sub-directory within the directory of the corresponding chemical composition. The sub-directories for each atomic structure for each chemical composition are named 'case-*', where * is a positive integer that spans all the values from 1 through 100, extremes included. The files contained in each sub-directory 'case-*' for each atomic structure are as follows: 1. INCAR: input file that contains various parameters and settings for controlling the behavior of the electronic structure calculations 2. 0.POSCAR: input file that defines the atomic structure of a system 3. 0.CONTCAR: output file that provides the atomic positions and cell parameters after the first geometry optimization has been run with the precision variable set to PREC=Low in the INCAR file 4. 0.OUTCAR: output file that contains detailed information about the progress of a calculation after the first geometry optimization has been run with the precision variable set to PREC=Low in the INCAR file 5. rlx1.out: file with diagnostic information about the execution of the first geometry optimization with precision variable set to PREC=Low in the INCAR file 6. POSCAR: input file that defines the atomic structure of a system after the first geometry optimization has been run at low precision. This represents the input for the second geometry optimization run with the precision variable set to PREC=Normal in the INCAR file 7. CONTCAR: output file that provides the atomic positions and cell parameters after the second geometry optimization has been run with the precision variable set to PREC=Normal in the INCAR file 8. OUTCARL: output file that contains detailed information about the progress of a calculation after the second geometry optimization has been run with the precision variable set to PREC=Normal in the INCAR file 9. rlx2.out: file with diagnostic information about the execution of the second geometry optimization with precision variable set to PREC=Normal in the INCAR file 10. vaspout.h5: hierarchical HDF5 file containing the inputs and outputs of a VASP calculation. To analyze the data in this file we recommend using py4vasp. This file is only produced if the VASP version used is compiled with HDF5 support 11. vasprun.xml: contains similar information to OUTCAR, but in an xml format. This research is sponsored by the Artificial Intelligence Initiative as part of the Laboratory Directed Research and Development (LDRD) Program of Oak Ridge National Laboratory, managed by UT-Battelle, LLC, for the US Department of Energy under contract DE-AC05-00OR22725. This work used resources of the Oak Ridge Leadership Computing Facility, which is supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC05-00OR22725, under Directorate Discretionary awards MAT025 (Materials Science) and LRN026 (Machine Learning), and INCITE award MAT201. This work also used resources of the National Energy Research Scientific Computing Center, which is supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231, under award ERCAP0025216.

36 MATERIALS SCIENCE↗

REBUS-PC v1.5 Verification Test Summary

Motivated in part by its usage for analysis of the University of Missouri Research Reactor (MURR), the verification of the REBUS-PC software for θ-R-Z geometries is discussed and displayed in this manuscript. Of particular importance is to show that the eigenvalue, flux, power, and burnup outputs of the software given a user problem is correct. REBUS-PC contains many features and MURR only makes use of some of those aspects. As an example, the use of region specific cross section sets, interpolation of the cross section data with respect to burnup, and automatic movement of control rods during the fuel cycle is discussed and displayed. To demonstrate the accuracy, 22 verification tests based upon 7 physical geometries are discussed. Geometry descriptions are provided in Section 2 and the REBUS-PC results for each verification test are discussed in Section 3. These verification tests consist of both analytic problems with known solutions and a more complicated input consistent with usage of REBUS-PC on the MURR reactor itself called STRZ. In this verification test summary report, the REBUS-PC software is repeatedly demonstrated to reproduce, or closely match, the eigenvalue, flux, and power distributions from analytic test problem solutions, demonstrating that the implemented finite difference approximation in θ-R-Z is working as intended. Several additional REBUS-PC features are tested, such as control rod movement by detailed comparisons of the results against reference solutions obtained using an auxiliary implemented MatLab program. As expected, the REBUS-PC software produces results that are 100% consistent with the stated capabilities and thus the verification exercise is completed. These verification tests should be executed with each re-compilation of the REBUS-PC source and after any source code changes. All output results from any such new work should be rigorously compared against the stored output of the 22 verification tests cited in this report that forms the basis of the verification process.

97 MATHEMATICS AND COMPUTING↗

Geochemical data package for performance assessment calculations related to the Savannah River Site

The Savannah River Site (SRS) disposes of low-level radioactive waste (LLW) and stabilizes high-level radioactive waste (HLW) tanks in the subsurface environment. Calculations used to establish the radiological limits of these facilities are referred to as Performance Assessments (PAs), Special Analyses (SAs), and Composite Analyses (CAs). The purpose of this document is to revise the existing geochemical data package used for these calculations (Kaplan, 2016). This work builds on earlier compilations of geochemical data, referred to a geochemical data packages (Kaplan, 2007; Kaplan, 2010; Kaplan, 2016; McDowell-Boyer et al., 2000). This work is being conducted as part of the on-going maintenance program of the SRS PA programs that periodically updates calculations and data packages when new information becomes available.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Improving High-Performance Sparse Libraries Using Compiler-Assisted Specialization: A PETSc Case Study

Computers with hardware accelerators, also referred to as hybrid-core systems, speedup applications by offloading certain compute operations that can run faster on accelerators. Thus, it is not surprising that many of top500 supercomputers use accelerators. However, in addition to procurement cost, significant programming and porting effort is required to realize the potential benefit of such accelerators. Hence, before building such a system it is prudent to answer the question 'what is the projected performance benefit from accelerators for the workloads of interest?'. We address this question by way of a performance-modeling framework that predicts realizable application performance on accelerators rapidly and accurately without going to the considerable effort of porting and tuning. The modeling framework first automatically identifies commonly found compute patterns in scientific applications which we term idioms, which may benefit by accelerator technology. Next the framework models the predicted speedup of those idioms if they were to be ported to and run on hardware accelerators. As a proof of concept we characterize two kinds of accelerators 1) the FPGA accelerators on a Convey HC-1 system and 2) an NVIDIA FERMI GPU accelerator. We model performance of the idioms gather/scatter and stream and our predictions show that where these occur in two full-scale HPC applications, Milc and HYCOM, gather/scatter speeds up by as much as 15X, and stream by as much as 14X, whereas the overall compute time of Milc improves by 3.4% and HYCOM by 20%.

Computer Science↗

Implementing Molecular Dynamics for Hybrid High Performance Computers - 1. Short Range Forces

The use of accelerators such as general-purpose graphics processing units (GPGPUs) have become popular in scientific computing applications due to their low cost, impressive floating-point capabilities, high memory bandwidth, and low electrical power requirements. Hybrid high performance computers, machines with more than one type of floating-point processor, are now becoming more prevalent due to these advantages. In this work, we discuss several important issues in porting a large molecular dynamics code for use on parallel hybrid machines - 1) choosing a hybrid parallel decomposition that works on central processing units (CPUs) with distributed memory and accelerator cores with shared memory, 2) minimizing the amount of code that must be ported for efficient acceleration, 3) utilizing the available processing power from both many-core CPUs and accelerators, and 4) choosing a programming model for acceleration. We present our solution to each of these issues for short-range force calculation in the molecular dynamics package LAMMPS. We describe algorithms for efficient short range force calculation on hybrid high performance machines. We describe a new approach for dynamic load balancing of work between CPU and accelerator cores. We describe the Geryon library that allows a single code to compile with both CUDA and OpenCL for use on a variety of accelerators. Finally, we present results on a parallel test cluster containing 32 Fermi GPGPUs and 180 CPU cores.

43 PARTICLE ACCELERATORS↗

Performance of an Astrophysical Radiation Hydrodynamics Code under Scalable Vector Extension Optimization

We present results of a performance study of an astrophysical radiation hydrodynamics code, V2D, on the Arm-based A64FX processor developed by Fujitsu. The code solves sparse linear systems, a task for which the A64FX architecture should be well suited. Here, we performed the performance analysis study on Ookami, an Apollo 80 platform utilizing the A64FX processor. We explored several compilers and performance anal-ysis packages and found the code did not perform as expected under scalable vector extension optimization, suggesting that a “deeper dive” into analyzing the code is worthwhile. However, a simple driver program that exercised basic sparse linear algebra routines used by V2D did show significant speedup with the use of the scalable vector extension optimization. We present the initial results from the study which used V2D on a relatively simple test problem that emphasized the repeated solution of sparse linear systems.

79 ASTRONOMY AND ASTROPHYSICS↗

LLVM Infrastructure and Tools Project Summary

This project works with the open source LLVM Compiler Infrastructure (http://llvm.org) to provide tools and capabilities that address needs and challenges faced by ECP community (applications, libraries, and other components of the software stack). Our focus is on providing a more productive development environment that enables (i) improved compilation times and code generation for parallelism, (ii) additional features/capabilities within the design and implementations of LLVM components for improved platform/performance portability and (iii) improved aspects related to composition of the underlying implementation details of the programming environment, capturing resource utilization, overheads, etc. -- including runtime systems that are often not easily addressed by application and library developers.

97 MATHEMATICS AND COMPUTING↗