Search NASA⌕ Search

SEARCH · Search NASA

Results for “computer Codes Computer Programs”

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 451 records · Page 25

ChatPORT: Fine-Tuned LLM for Easy Code {PORT}ing

Fine-tuning existing LLMs for specialized tasks has become a very attractive alternative due to its low cost and quick development cycle. With many pre-trained LLMs available, it is an increasingly complex task to choose the correct model as the starting point or base model. In this work we discuss ChatPORT - a specialized fine-tuned LLM geared towards providing correctly translated codes from one programming model to another. We evaluate a number of base models and compare and contrast their features and characteristics that make them a viable starting point. In this paper, we focus on the OpenMP offload porting capabilities of ChatPORT. We build our training data using kernels from the Heterogeneous Computing Benchmarks (HeCBench) [12] and the OpenMP Validation and Verification suite [5] to fine-tune the base models. We then test the model using unseen kernels extracted from the HeCBench benchmark suite. Our results show that: (1) not all open LLMs geared towards HPC are aware of programming models like OpenMP, (2) although all base models benefit from fine-tuning they learn differently and produce different correctness rates, (3) depending on the memory size and compute resource available, different base models can be used for fine-tuning without significantly affecting the quality of transpiled code they generate, (4) fine-tuning improved the correctness rate of the LLM by an average of 43.2%, and (5) feedback-based training data further increased the correctness rate by an average of 6% over the LLMs tested.

Pophale, Swaroop [ORNL] (ORCID:0000000185446367)↗

High-Performance Design Patterns for Modern Fortran

This paper presents ideas for using coordinate-free numerics in modern Fortran to achieve code flexibility in the partial differential equation (PDE) domain. We also show how Fortran, over the last few decades, has changed to become a language well-suited for state-of-the-art software development. Fortran’s new coarray distributed data structure, the language’s class mechanism, and its side-effect-free, pure procedure capability provide the scaffolding on which we implement HPC software. These features empower compilers to organize parallel computations with efficient communication. We present some programming patterns that support asynchronous evaluation of expressions comprised of parallel operations on distributed data. We implemented these patterns using coarrays and the message passing interface (MPI). We compared the codes’ complexity and performance. The MPI code is much more complex and depends on external libraries. The MPI code on Cray hardware using the Cray compiler is 1.5–2 times faster than the coarray code on the same hardware. The Intel compiler implements coarrays atop Intel’s MPI library with the result apparently being 2–2.5 times slower than manually coded MPI despite exhibiting nearly linear scaling efficiency. As compilers mature and further improvements to coarrays comes in Fortran 2015, we expect this performance gap to narrow.

Haveraaen, Magne↗

Development of a statistical sampling method for uncertainty analysis with SCALE

A new statistical sampling sequence called Sampler has been developed for the SCALE code system. Random values for the input multigroup cross sections are determined by using the XSUSA program to sample uncertainty data provided in the SCALE covariance library. Using these samples, Sampler computes perturbed self-shielded cross sections and propagates the perturbed nuclear data through any specified SCALE analysis sequence, including those for criticality safety, lattice physics with depletion, and shielding calculations. Statistical analysis of the output distributions provides uncertainties and correlations in the desired responses. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

SIPMaP: A Tool for Modeling Irregular Parallel Computations in the Super Instruction Architecture

Performance modeling is becoming an increasingly important part of the parallel application development process, particularly for expensive computations that will be run on very high-end systems where resources are scarce. We describe a performance modeling tool SIPMaP (Super Instruction Processor Modeling and Prediction) developed for the Super-Instruction Architecture (SIA). The SIA is designed for applications where the dominant data structures are large multi-dimensional arrays and it comprises a DSL, the Super-Instruction Assembly Language (SIAL) that supports expressing algorithms in terms of blocks (tiles), and its runtime system Super Instruction Processor (SIP) that manages distribution and disk storage of the arrays. SIPMaP generates performance models from the SIAL source code. In comparison with many applications where useful performance models have been developed and reported, these programs are irregular and have other difficult to model characteristics such as extensive overlapping of communication and computation.

Computer Science↗

JMOCUP Physics Depletion Calculations for the As-Run AGR-5/6/7 TRISO Particle Experiment in ATR Northeast Flux Trap

This ECAR documents the as-run Jim Sterbentz’s MCNP ORIGEN Coupled Utility Program (JMOCUP) physics depletion calculation and the calculated results for the AGR-5/6/7 irradiation experiment in the Advanced Test Reactor (ATR). AGR 5/6/7 was irradiated for nine power cycles in the northeast flux trap. The depletion calculations were performed to provide input data for a variety of other engineering analyses supporting the AGR-5/6/7 experiment along with post-irradiation characterization of the tri-structural isotropic (TRISO) particle fuel compacts. Detailed full-core MCNP models and Oak Ridge Isotope Generation (ORIGEN2) radionuclide generation models were specifically developed as part of the JMOCUP Monte Carlo depletion calculations. The MCNP ORIGEN2 computer codes were coupled using the well-established JMOCUP utility modules to couple the two codes and run the depletion calculations. The physics calculations were performed in support of the Advanced Gas Reactor (AGR) program.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Coupling of CTF and RELAP5-3D Within an Enhanced Fidelity Nuclear Power Plant Simulator

A robust and accurate multiphysics engineering simulator is being developed to model the core behavior and system response of pressurized water reactors. This simulator relies on the NESTLE and CTF computer codes to model the neutronics and thermal hydraulics (TH), respectively, inside the core on a nodal scale and on the Reactor Excursion and Leak Analysis Program—Three Dimensional (RELAP5-3D) to model the entire nuclear steam supply system. The RELAP5-3D model includes highly detailed nodalization and multidimensional flow modeling throughout the vessel. Previously, pin-resolved data generated via the Virtual Environment for Reactor Analysis core simulator were used to improve the accuracy of the NESTLE core predictions. The engineering simulator being developed as part of this work uses the 3KEYMASTER platform to couple the enhanced NESTLE model to a nodal-fidelity CTF model to balance run time with accuracy; NESTLE provides node-dependent powers to CTF, and CTF provides node-dependent coolant densities and fuel temperatures to NESTLE.An overlapping domain approach is used for the core TH in which RELAP5-3D provides core boundary conditions based on the system response and CTF provides a node-dependent coolant heating rate to the RELAP5-3D core solution. In the preliminary TH demonstration discussed in this paper, CTF and RELAP5-3D provided similar steady-state core predictions, indicating the hydraulic compatibility between the codes, as well as reasonable and expected behavior under hypothetical transient conditions. This provides an initial step in ongoing efforts toward a robust, multiscale TH/neutronics engineering simulator capability.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

qSIEVE: Efficient qLDPC Memory via Systolic Movement in Atom Arrays

As quantum machines have scaled up in their number of qubits, significant research has turned towards increasing their fidelity with quantum error correction codes. Although promising results have been shown with the surface code, which only requires near-neighbor connections between qubits, the high qubit overhead of such local codes promises to be problematic. Consequently, recent work has explored non-local quantum LDPC (qLDPC) codes, which have good asymptotic encoding rates. Despite theoretical progress, hardware implementations of these codes have been a longstanding challenge. At the experimental level, demonstrations of movement based communication on atom arrays suggest this is a powerful new primitive to achieve non-local connectivity. Leveraging this, we present a protocol for implementing non-local qLDPC codes in hardware. Our protocol, qSIEVE, is a co-design of such codes with movement in atom arrays. qSIEVE defines a restricted family of qLDPC codes that can be implemented efficiently with systolic movement. We then quantify the utility of qSIEVE in the context of a complete fault tolerant architecture. We compare the cost of implementing benchmark programs in a standard, surface code only architecture and a mixed architecture where data is stored in qLDPC memory with qSIEVE and loaded to surface codes for computation.

Quantum error correction↗

CDAC Student Report: Summary of LLNL Internship

Multiple objectives motivated me to apply for an internship at LLNL: I wanted to experience the work environment at a national lab, to learn about research and job opportunities at LLNL in particular, and to gain greater experience with code development, particularly within the realm of high performance computing (HPC). This summer I was selected to participate in LLNL's Computational Chemistry and Material Science Summer Institute (CCMS). CCMS is a 10 week program hosted by the Quantum Simulations group leader, Dr. Eric Schwegler. CCMS connects graduate students to mentors at LLNL involved in similar re- search and provides weekly seminars on a broad array of topics from within chemistry and materials science. Dr. Xavier Andrade and Dr. Erik Draeger served as my co-mentors over the summer, and Dr. Andrade continues to mentor me now that CCMS has concluded. Dr. Andrade is a member of the Quantum Simulations group within the Physical and Life Sciences at LLNL, and Dr. Draeger leads the HPC group within the Center for Applied Scientific Computing (CASC). The two have worked together to develop Qb@ll, an open-source first principles molecular dynamics code that was the platform for my summer research project.

36 MATERIALS SCIENCE↗

A Hartree-Fock Application Using UPC++ and the New DArray Library

The Hartree-Fock (HF) method is the fundamental first step for incorporating quantum mechanics into many-electron simulations of atoms and molecules, and it is an important component of computational chemistry toolkits like NWChem. The GTFock code is an HF implementation that, while it does not have all the features in NWChem, represents crucial algorithmic advances that reduce communication and improve load balance by doing an up-front static partitioning of tasks, followed by work stealing whenever necessary. To enable innovations in algorithms and exploit next generation exascale systems, it is crucial to support quantum chemistry codes using expressive and convenient programming models and runtime systems that are also efficient and scalable. Here, this paper presents an HF implementation similar to GTFock using UPC++, a partitioned global address space model that includes flexible communication, asynchronous remote computation, and a powerful multidimensional array library. UPC++ offers runtime features that are useful for HF such as active messages, a rich calculus for array operations, hardware-supported fetch-and-add, and functions for ensuring asynchronous runtime progress. We present a new distributed array abstraction, DArray, that is convenient for the kinds of random-access array updates and linear algebra operations on block-distributed arrays with irregular data ownership. Finally, we analyze the performance of atomic fetch-and-add operations (relevant for load balancing) and runtime attentiveness, then compare various techniques and optimizations for each. Our optimized implementation of HF using UPC++ and the DArrays library shows up to 20% improvement over GTFock with Global Arrays at scales up to 24,000 cores.

97 MATHEMATICS AND COMPUTING↗

GPU Acceleration of Volume Fraction and Centroid Computation from General Shapes on Unstructured Mesh

One important requirement for coupling multi-physics models is a means to remap fields between meshes in an accurate and conservative manner. Since the remapping algorithm is embarrassingly parallel, this motivates the use of Graphical Processing Units (GPU) for such routine. However, since our remapping code, portage, is fairly complex, we explore the use of GPUs through a simpler problem of generating material’s volume fraction and centroid inside each cell of the mesh. We use the same programming structure that is used in portage, namely, on-node parallelism via NVIDIA’s thrust library. Using a similar programming structure enables us to draw lessons from this study that can be applied to the more complex problem. We have found that while the speed-up is pronounced (10-100 times), significant effort is required to re-factor the code so that thrust can be used with a CUDA backend. Moreover, thrust takes away the fine grain control that vanilla CUDA programming gives us.

97 MATHEMATICS AND COMPUTING↗

SciPy 1.0: fundamental algorithms for scientific computing in Python

SciPy is an open-source scientific computing library for the Python programming language. Since its initial release in 2001, SciPy has become a de facto standard for leveraging scientific algorithms in Python, with over 600 unique code contributors, thousands of dependent packages, over 100,000 dependent repositories and millions of downloads per year. In this work, we provide an overview of the capabilities and development practices of SciPy 1.0 and highlight some recent technical developments.

97 MATHEMATICS AND COMPUTING↗

2014 HPC Annual Report

Our commitment is to support you through delivery of an IT environment that provides mission value by transforming the way you use, protect, and access information. We approach this through technical innovation, risk management, and relationships with our workforce, Laboratories leadership, and policy makers nationwide. This second edition of our HPC Annual Report continues our commitment to communicate the details and impact of Sandia’s large-scale computing resources that support the programs associated with our diverse mission areas. A key tenet to our approach is to work with our mission partners to understand and anticipate their requirements and formulate an investment strategy that is aligned with those Laboratories priorities. In doing this, our investments include not only expanding the resources available for scientific computing and modeling and simulation, but also acquiring large-scale systems for data analytics, cloud computing, and Emulytics. We are also investigating new computer architectures in our advanced systems test bed to guide future platform designs and prepare for changes in our code development models. Our initial investments in large-scale institutional platforms that are optimized for Informatics and Emulytics work are serving a diverse customer base. We anticipate continued growth and expansion of these resources in the coming years as the use of these analytic techniques expands across our mission space. If your program could benefit from an investment in innovative systems, please work through your Program Management Unit ’s Mission Computing Council representatives to engage our teams.

97 MATHEMATICS AND COMPUTING↗

Sierra Toolkit Manual Version 4.48

This report provides documentation for the SIERRA Toolkit (STK) modules. STK modules are intended to provide infrastructure that assists the development of computational engineering software such as finite-element analysis applications. STK includes modules for unstructured-mesh data structures, reading/writing mesh files, geometric proximity search, and various utilities. This document contains a chapter for each module, and each chapter contains overview descriptions and usage examples. Usage examples are primarily code listings which are generated from working test programs that are included in the STK code-base. A goal of this approach is to ensure that the usage examples will not fall out of date. This page intentionally left blank.

97 MATHEMATICS AND COMPUTING↗

Extracting SIMD Parallelism from Recursive Task-Parallel Programs

The pursuit of computational efficiency has led to the proliferation of throughput-oriented hardware, from GPUs to increasingly wide vector units on commodity processors and accelerators. This hardware is designed to efficiently execute data-parallel computations in a vectorized manner. However, many algorithms are more naturally expressed as divide-and-conquer, recursive, task-parallel computations. In the absence of data parallelism, it seems that such algorithms are not well suited to throughput-oriented architectures. This paper presents a set of novel code transformations that expose the data parallelism latent in recursive, task- parallel programs. These transformations facilitate straightforward vectorization of task-parallel programs on commodity hardware. We also present scheduling policies that maintain high utilization of vector resources while limiting space usage. Across several task-parallel benchmarks, we demonstrate both efficient vector resource utilization and substantial speedup on chips using Intel’s SSE4.2 vector units, as well as accelerators using Intel’s AVX512 units. We then show through rigorous sampling that, in practice, our vectorization techniques are effective for a much larger class of programs.

Recursive Programs, task parallelism, vectorizatio↗

Trinity Supercomputer Now Fully Operational

Now one of the fastest supercomputers in the United States, the Trinity Supercomputer Phase II project was completed during the summer of 2017, and the computer became fully operational during an unclassified “open science” run. The computer has now transitioned to classified mode. The Trinity supercomputer is designed to provide increased computational capability for the NNSA Nuclear Security Enterprise in support of increasing geometric and physics fidelities in nuclear weapons simulation codes, while maintaining expectations for total time to solution. The capabilities of Trinity are required for supporting the NNSA Stockpile Stewardship program’s certification and assessments to ensure that the nation’s nuclear stockpile is safe, secure and effective. With an expected operational lifetime through 2020, Trinity is an approximately 41.5 petaflop (41.5 million billion calculations per second, peak performance) supercomputer based on the Cray XC40 architecture. It consists of 19,420 compute nodes utilizing two processor architectures, Intel Xeon Haswell and Intel Xeon Phi Knights Landing. It is a water-cooled system with a power requirement of about 10 megawatts. The Trinity project is managed and operated by Los Alamos National Laboratory and Sandia National Laboratories under the Alliance for Computing at Extreme Scale (ACES) partnership. The system is located at the Nicholas Metropolis Center for Modeling and Simulation at Los Alamos and covers approximately 5,200 square feet of floor space.

97 MATHEMATICS AND COMPUTING↗

Detecting Data-Races in High-Performance Computing

High-performance computing is susceptible to data-race bugs. Data races occur when sequences of computed events do not happen in the intended order, a significant barrier to the integrity of parallel programs using shared-memory architectures. Many approaches to data-race detection are based on traditional static-analysis techniques that typically execute on a program’s source code or control-flow graph (the graphical representation of all possible orders of events in the execution of a program). Similar to classical data-flow analyses, such tools can produce false alarms that report spurious race conditions on error free programs. We have developed a software verification technique that requires as input only a program’s source code and can automatically detect a data-race bug which definitely exists, determine that a program is definitely data-race free, or report that it cannot determine either of the two cases.

97 MATHEMATICS AND COMPUTING↗

140,142 Ce Neutron Cross Section Resolved Resonance Region Evaluation

A resolved resonance region evaluation of 140,142 Ce was conducted by Oak Ridge National Laboratory. Requested by the US Nuclear Criticality Safety Program, this evaluation is based on recent high-resolution transmission and capture high-resolution measurements of nat Ce and 142 Ce conducted at JRC-Geel at the Geel Linear Accelerator facility. It is also based on recently measured thermal constants available from the EX FOR database. Starting from the resonance parameters from the ENDF/B-VIII.0 library and following a preliminary R-matrix analysis, an updated set of resonance parameters and corresponding covariance in formation was derived by the fit of these experimental datasets using the Reich–Moore approximation of the R-matrix theory, as implemented in the SAMMY code system. The resolved resonance region upper energy limit for 140 Ce was kept at 200 keV, whereas the 142 Ce resonance region was extended from 13 to 26 keV. This new evaluation was found to be in good agreement not only with several integral quantities of interest to the reactor physics community, but also with the stellar Maxwellian-averaged cross section.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Development and Validation of a Conjugate Heat Transfer Model for the Two-Phase CFD Code NEK-2P

A project is underway to develop, verify and validate an advanced two-phase flow modeling capability for the highly-scalable, high-performance CFD code NEK5000. The goal of the project is to develop a new two-phase version of the NEK5000 code, named NEK-2P, to simulate the two-phase flow and heat transfer phenomena that occur in a Boiling Water Reactor (BWR) fuel bundle under various operating conditions. The NEK-2P two-phase flow models follow the approach used for the Extended Boiling Framework (EBF) [2-3] previously developed at Argonne, but include more fundamental physical models of boiling phenomena and advanced numerical algorithms for improved computational accuracy, robustness, and computational speed. The development of the NEK-2P two-phase solver and the implementation of the Extended Boiling Framework two-phase models were initially supported by Argonne National Laboratory (Argonne) through a Laboratory Directed Research and Development (LDRD) project during FY2014-2016. The development and validation of the two-phase models through analyses of selected two-phase boiling flow experiments was supported by the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program in FY2017-2019. This report focuses on the FY2019 development and validation of the Conjugate Heat Transfer (CHT) model for the NEK-2P Two-Phase, Computational Fluid Dynamics (CFD) code. The NEK-2P CHT model calculates the coupled behavior of the fluid and solid domains. In the fluid domain NEK-2P calculates the vapor and liquid phase temperatures, velocities and mass fractions. In the solid domain only the temperatures are calculated. The fluid and solid domains are coupled with a heat flux boundary condition at the fluid-solid interface. The heat flux and the wall temperatures at the fluid-solid interface are updated using the NEK-2P wall heat-flux partitioning model. A wall heat flux boundary condition is also applied to the exterior surface of the solid domain. The CHT model validation was illustrated through the analysis of three of the Becker Critical Heat Flux (CHF) tests. Reasonably good agreement with measured data was obtained in predicting the CHF location and post CHF wall temperature behavior illustrating the ability of the NEK-2P CHT model to simulate the CHF phenomena for a wide range of thermal-hydraulic conditions. Apart from the CHT model development and validation, initial simulations were performed for the Virginia Tech. (VT) 3x3 bare rod bundle experiments including both cold and boiling flow simulations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗