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 631 records · Page 35

Conference on Fire Resistant Materials (FIREMEN): A compilation of presentations and papers

The proceedings of the NASA Fire Resistant Materials Engineering (FIREMEN) Program held at Ames Research Center on April, 13, 14, 1978 are reported. The purpose of the conference was to discuss the results of NASA in the field of aircraft fire safety and fire resistant materials. The program components include the following: (1) large-scale testing; (2) fire toxicology; (3) polymeric materials; and (4) bibliography related and/or generated from the program.

Kourtides, D. A.↗

Conference on Fire Resistant Materials: A compilation of presentations and papers

The proceedings of the NASA IRE Resistant Materials Engineering (FIREMEN) Program held at Boeing Commercial Airplane Company, Seattle, Washington, on March 1-2, 1979 are reported. The conference was to discuss the results of research by the National Aeronautics and Space Administration in the field of aircraft fire safety and fire-resistant materials. The program topics include the following: (1) large-scale testing; (2) fire toxicology; (3) polymeric materials; and (4) fire modeling.

Kourtides, D. A.↗

Domain Specific Language Support for Exascale

A multi-institutional project known as D-TEC (short for “Domain- specific Technology for Exascale Computing”) set out to explore technologies to support the construction of Domain Specific Languages (DSLs) to map application programs to exascale architectures. DSLs employ automated code transformation to shift the burden of delivering portable performance from application programmers to compilers. Two chief properties contribute: DSLs permit expression at a high level of abstraction so that a programmer’s intent is clear to a compiler and DSL implementations encapsulate human domain-specific optimization knowledge so that a compiler can be smart enough to achieve good results on specific hardware. Domain specificity is what makes these properties possible in a programming language. If leveraging domain specificity is the key to keep exascale software tractable, a corollary is that many different DSLs will be needed to encompass the full range of exascale computing applications; moreover, a single application may well need to use several different DSLs in conjunction. As a result, developing a general toolkit for building domain-specific languages was a key goal for the D-TEC project. Different aspects of the D-TEC research portfolio were the focus of work at each of the partner institutions in the multi-institutional project. D-TEC research and development work at Rice University focused on on three principal topics: understanding how to automate the tuning of code for complex architectures, research and development of the Rosebud DSL engine, and compiler technology to support complex execution platforms. This report provides a summary of the research and development work on the D-TEC project at Rice University.

97 MATHEMATICS AND COMPUTING↗

Compendium of meteorological space programs, satellites, and experiments

This compendium includes plans and events known to the authors through January 1987. Compilation of the information began in 1967. This document is intended: (1) as a historical record of all satellites and instrumentation that has been useful for meteorological research or operational uses; and (2) as a working document to be used to assist meteorologists in identifying meteorological satellites, locating data from these satellites, and understanding experiment operation which is related to satellite data that may be of interest to them. A summary of all known launched satellites for all countries and their experiments, which were concerned with meteorological operations or research, are included. Programs covered include AEM, Apollo, ATS, Bhaskara, Cosmos, Discoverer, DMSP, DOD, DODGE, EOLE, ERBE, ESSA, Explorer, Gemini, GMS, GOES/SMS, INSAT, IRS, LANDSAT, Mercury, Meteor 1 and 2, Meteosat, Molniya, MOS, Nimbus, NOAA (1-5)/ITOS, NOAA (6,7,D)/TIROS-N, NOAA (8-10, H-J)/ATN, Salyut, Seasat, Shuttle 1, Shuttle 2: Spacelab, Skylab, Soyuz, TIROS, TOPEX, Vanguard, Voskhod, Vostok, and Zond.

Dubach, Leland L.↗

International contributions to IAEA-NEA heat transfer databases for supercritical fluids

An IAEA Coordinated Research Project on 'Heat Transfer Behaviour and Thermohydraulics Code Testing for SCWRs' is being conducted to facilitate collaboration and interaction among participants from 15 organizations. While the project covers several key technology areas relevant to the development of SCWR concepts, it focuses mainly on the heat transfer aspect, which has been identified as the most challenging. Through the collaborating effort, large heat-transfer databases have been compiled for supercritical water and surrogate fluids in tubes, annuli, and bundle subassemblies of various orientations over a wide range of flow conditions. Assessments of several supercritical heat-transfer correlations were performed using the complied databases. The assessment results are presented. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

A Testbed of Parallel Kernels for Computer Science Research

For several decades, computer scientists have sought guidance on how to evolve architectures, languages, and programming models for optimal performance, efficiency, and productivity. Unfortunately, this guidance is most often taken from the existing software/hardware ecosystem. Architects attempt to provide micro-architectural solutions to improve performance on fixed binaries. Researchers tweak compilers to improve code generation for existing architectures and implementations, and they may invent new programming models for fixed processor and memory architectures and computational algorithms. In today's rapidly evolving world of on-chip parallelism, these isolated and iterative improvements to performance may miss superior solutions in the same way gradient descent optimization techniques may get stuck in local minima. In an initial study, we have developed an alternate approach that, rather than starting with an existing hardware/software solution laced with hidden assumptions, defines the computational problems of interest and invites architects, researchers and programmers to implement novel hardware/ software co-designed solutions. Our work builds on the previous ideas of computational dwarfs, motifs, and parallel patterns by selecting a representative set of essential problems for which we provide: An algorithmic description; scalable problem definition; illustrative reference implementations; verification schemes. For simplicity, we focus initially on the computational problems of interest to the scientific computing community but proclaim the methodology (and perhaps a subset of the problems) as applicable to other communities. We intend to broaden the coverage of this problem space through stronger community involvement. Previous work has established a broad categorization of numerical methods of interest to the scientific computing, in the spirit of the NAS Benchmarks, which pioneered the basic idea of a 'pencil and paper benchmark' in the 1990s. The initial result of the more modern study was the seven dwarfs, which was subsequently extended to 13 motifs. These motifs have already been useful in defining classes of applications for architecture-software studies. However, these broad-brush problem statements often miss the nuance seen in individual kernels. For example, the computational requirements of particle methods vary greatly between the naive (but more accurate) direct calculations and the particle-mesh and particle-tree codes. Thus we commenced our study with an enumeration of problems, but then proceeded by providing not only reference implementations for each problem, but more importantly a mathematical definition that allows one to escape iterative approaches to software/hardware optimization. To ensure long term value, we have augmented each of our reference implementations with both a scalable problem generator and a verification scheme. In a paper we have prepared that documents our efforts, we describe in detail this process of problem definition, scalable input creation, verification, and implementation of reference codes for the scientific computing domain. Table 1 enumerates and describes the level of support we've developed for each kernel. We group these important kernels using the Berkeley dwarfs/motifs taxonomy using a red box in the appropriate column. As kernels become progressively complex, they build upon other, simpler computational methods. We note this dependency via orange boxes. After enumeration of the important numerical problems, we created a domain-appropriate high-level definition of each problem. To ensure future endeavors are not tainted by existing implementations, we specified the problem definition to be independent of both computer architecture and existing programming languages, models, and data types. Then, to provide context as to how such kernels productively map to existing architectures, languages and programming models, we produced reference implementations for most of the kernel (see table). These sample codes should be viewed as 'hints,' designed to show how other designers have mapped a problem's operands and operators to existing hardware and software. Since we wanted such implementations to be illustrative, we tried to ensure they were the most straightforward implementation in the easiest to understand languages using familiar architectures. To that end, most of the linear algebra-oriented computations are written in MATLAB using array indexing to process matrices, rather than one-line library calls to compute the same kernel. This ensures that the kernel's computation is explicit and readable in the implementation and not hidden behind a library. For other problems, such as the Barnes-Hut n-Body solver, the implementations were written in pure C, without any supporting library computations. Along this line, we have also created a scalable problem generator to accompany each computation.

97 MATHEMATICS AND COMPUTING↗

Evolvix BEST Names for semantic reproducibility across code2brain interfaces

Names in programming are vital for understanding the meaning of code and big data. We define code2brain (C2B) interfaces as maps in compilers and brains between meaning and naming syntax, which help to understand executable code. While working toward an Evolvix syntax for general‐purpose programming that makes accurate modeling easy for biologists, we observed how names affect C2B quality. To protect learning and coding investments, C2B interfaces require long‐term backward compatibility and semantic reproducibility (accurate reproduction of computational meaning from coder‐brains to reader‐brains by code alone). Semantic reproducibility is often assumed until confusing synonyms degrade modeling in biology to deciphering exercises. We highlight empirical naming priorities from diverse individuals and roles of names in different modes of computing to show how naming easily becomes impossibly difficult. We present the Evolvix BEST (Brief, Explicit, Summarizing, Technical) Names concept for reducing naming priority conflicts, test it on a real challenge by naming subfolders for the Project Organization Stabilizing Tool system, and provide naming questionnaires designed to facilitate C2B debugging by improving names used as keywords in a stabilizing programming language. Our experiences inspired us to develop Evolvix using a flipped programming language design approach with some unexpected features and BEST Names at its core.

97 MATHEMATICS AND COMPUTING↗

Space Station Technology, 1983

This publication is a compilation of the panel summaries presented in the following areas: systems/operations technology; crew and life support; EVA; crew and life support: ECLSS; attitude, control, and stabilization; human capabilities; auxillary propulsion; fluid management; communications; structures and mechanisms; data management; power; and thermal control. The objective of the workshop was to aid the Space Station Technology Steering Committee in defining and implementing a technology development program to support the establishment of a permanent human presence in space. This compilation will provide the participants and their organizations with the information presented at this workshop in a referenceable format. This information will establish a stepping stone for users of space station technology to develop new technology and plan future tasks.

Wright, R. L.↗

U.S. Spacesuit Knowledge Capture – Chronicling Spacesuit Design for the Future

With less than 4 years until the United States is scheduled to land the first woman and next man on the Moon, NASA is leveraging 60 years of experience to build a spacesuit to assist in the success of this and future human space exploration missions. This experience comes from the achievements of retired and employed spacesuit experts, innovations that were conceived from existing ideas and inventions, and a plethora of archived knowledge. The U.S. Spacesuit Knowledge Capture (SKC) Program’s primary function is to capture, archive, and share current and legacy spacesuit-related knowledge with scientists, engineers, and technicians. To capture valuable spacesuit-related knowledge, the program uses various methods that have included hosting and recording classroom and online courses, workshops, and vignettes, and preserving thousands of legacy spacesuit-related files. In 2019, the SKC Program added to its role when it began coordinating the electronic recording of the new spacesuits’ buildup. This new, next-generation spacesuit is named the Exploration Extravehicular Mobility Unit (xEMU) and is a compilation of many components. As each component is tested and assembled into the suit, the SKC Program is chronicling this buildup using high-speed video production and photography that includes time-lapsed images. To complement the recording of the components, the SKC Program plans to record and photograph the design verification testing. In 2020, the SKC Program was given the initiative to research and identify the custodianship of historical spacesuit equipment that resides within the Crew and Thermal Systems Division. These archives will be added to the SKC Program’s expansive archived collection of spacesuit-related knowledge that represents over 5 decades of spacesuit legacy from the Apollo era to the pursuit of Mars and beyond. This paper describes the electronic documentation of the xEMU’s buildup and identifies the SKC Program’s 2020 accomplishments.

Cinda Chullen↗

U.S. Spacesuit Knowledge Capture – Chronicling Spacesuit Design for the Future

With less than 4 years until the United States is scheduled to land the first woman and next man on the Moon, NASA is leveraging 60 years of experience to build a spacesuit to assist in the success of this and future human space exploration missions. This experience comes from the achievements of retired and employed spacesuit experts, innovations that were conceived from existing ideas and inventions, and a plethora of archived knowledge. The U.S. Spacesuit Knowledge Capture (SKC) Program’s primary function is to capture, archive, and share current and legacy spacesuit-related knowledge with scientists, engineers, and technicians. To capture valuable spacesuit-related knowledge, the program uses various methods that have included hosting and recording classroom and online courses, workshops, and vignettes, and preserving thousands of legacy spacesuit-related files. In 2019, the SKC Program added to its role when it began coordinating the electronic recording of the new spacesuits’ buildup. This new, next-generation spacesuit is named the Exploration Extravehicular Mobility Unit (xEMU) and is a compilation of many components. As each component is tested and assembled into the suit, the SKC Program is chronicling this buildup using high-speed video production and photography that includes time-lapsed images. To complement the recording of the components, the SKC Program plans to record and photograph the design verification testing. In 2020, the SKC Program was given the initiative to research and identify the custodianship of historical spacesuit equipment that resides within the Crew and Thermal Systems Division. These archives will be added to the SKC Program’s expansive archived collection of spacesuit-related knowledge that represents over 5 decades of spacesuit legacy from the Apollo era to the pursuit of Mars and beyond. This paper describes the electronic documentation of the xEMU’s buildup and identifies the SKC Program’s 2020 accomplishments.

Cinda Chullen↗

A computer code to calculate line by line atmospheric transmission spectra on a microcomputer

A computer program is described which calculates line by line atmospheric transmission spectra on a microcomputer. Radiance calculations are not included. The program is written in FORTRAN and could be modified to run on a microcomputer other than the one on which it was implemented, except that the plotting routine would have to be replaced. The program is based on the 1978 Air Force Geophysics Laboratory LASER routine, and uses absorption line data from the 1982 update of the AFGL Atmospheric Absorption Line Parameters Compilation; segments of needed line data are taken from the tape, preprocessed into the form used by the program and stored on floppy disks. The program calculates transmission spectra over a variety of paths and spanning an arbitrarily chosen wavelength or frequency range; the path may be chosen to be horizontal, vertical or slanted at any zenith angle, and may extend between any two altitudes between 0 and 15 km. Aerosol effects are included, presently based on the 1976 Shettle and Fenn models, plus some molecular continuum effects and Rayleigh scattering.

Safren, H. G.↗

Incremental Parallelization of Non-Data-Parallel Programs Using the Charon Message-Passing Library

Message passing is among the most popular techniques for parallelizing scientific programs on distributed-memory architectures. The reasons for its success are wide availability (MPI), efficiency, and full tuning control provided to the programmer. A major drawback, however, is that incremental parallelization, as offered by compiler directives, is not generally possible, because all data structures have to be changed throughout the program simultaneously. Charon remedies this situation through mappings between distributed and non-distributed data. It allows breaking up the parallelization into small steps, guaranteeing correctness at every stage. Several tools are available to help convert legacy codes into high-performance message-passing programs. They usually target data-parallel applications, whose loops carrying most of the work can be distributed among all processors without much dependency analysis. Others do a full dependency analysis and then convert the code virtually automatically. Even more toolkits are available that aid construction from scratch of message passing programs. None, however, allows piecemeal translation of codes with complex data dependencies (i.e. non-data-parallel programs) into message passing codes. The Charon library (available in both C and Fortran) provides incremental parallelization capabilities by linking legacy code arrays with distributed arrays. During the conversion process, non-distributed and distributed arrays exist side by side, and simple mapping functions allow the programmer to switch between the two in any location in the program. Charon also provides wrapper functions that leave the structure of the legacy code intact, but that allow execution on truly distributed data. Finally, the library provides a rich set of communication functions that support virtually all patterns of remote data demands in realistic structured grid scientific programs, including transposition, nearest-neighbor communication, pipelining, gather/scatter, and redistribution. At the end of the conversion process most intermediate Charon function calls will have been removed, the non-distributed arrays will have been deleted, and virtually the only remaining Charon functions calls are the high-level, highly optimized communications. Distribution of the data is under complete control of the programmer, although a wide range of useful distributions is easily available through predefined functions. A crucial aspect of the library is that it does not allocate space for distributed arrays, but accepts programmer-specified memory. This has two major consequences. First, codes parallelized using Charon do not suffer from encapsulation; user data is always directly accessible. This provides high efficiency, and also retains the possibility of using message passing directly for highly irregular communications. Second, non-distributed arrays can be interpreted as (trivial) distributions in the Charon sense, which allows them to be mapped to truly distributed arrays, and vice versa. This is the mechanism that enables incremental parallelization. In this paper we provide a brief introduction of the library and then focus on the actual steps in the parallelization process, using some representative examples from, among others, the NAS Parallel Benchmarks. We show how a complicated two-dimensional pipeline-the prototypical non-data-parallel algorithm- can be constructed with ease. To demonstrate the flexibility of the library, we give examples of the stepwise, efficient parallel implementation of nonlocal boundary conditions common in aircraft simulations, as well as the construction of the sequence of grids required for multigrid.

VanderWijngaart, Rob F.↗

Enhancing Kokkos with OpenACC

C++ template metaprogramming has emerged as a prominent approach for achieving performance portability in heterogeneous computing. Kokkos represents a notable paradigm in this domain, offering programmers a suite of high-level abstractions for generic programming while deferring much of the device-specific code generation and optimization to the compiler through template specializations. Kokkos furnishes a range of device-specific code specializations across multiple back ends, including CUDA and HIP. Diverging from conventional back ends, the OpenACC implementation presents a high-level, multicompiler, multidevice, and directive-based programming model. This paper presents recent advancements in the OpenACC back end for Kokkos (i.e., KokkACC) and focuses on its integration into the Kokkos ecosystem, exploration of automatic device selection capabilities to enhance productivity, and performance evaluation on modern hardware such as NVIDIA H100 GPUs. The study includes implementation details and a thorough performance assessment across various computational benchmarks, including minibenchmarks (AXPY and DOT product), miniapps (LULESH, MiniFE, and SNAP-LAMMPS), and a scientific kernel based on the lattice Boltzmann method.

Valero Lara, Pedro↗

OpenACC Unified Programming Environment for Multi-hybrid Acceleration with GPU and FPGA

Accelerated computing in HPC such as with GPU, plays a central role in HPC nowadays. However, in some complicated applications with partially different performance behavior is hard to solve with a single type of accelerator where GPU is not the perfect solution in these cases. We are developing a framework and transpiler allowing the users to program the codes with a single notation of OpenACC to be compiled for multi-hybrid accelerators, named MHOAT (Multi-Hybrid OpenACC Translator) for HPC applications. MHOAT parses the original code with directives to identify the target accelerating devices, currently supporting NVIDIA GPU and Intel FPGA, dispatching these specific partial codes to background compilers such as NVIDIA HPC SDK for GPU and OpenARC research compiler for FPGA, then assembles binaries for the final object with FPGA bitstream file. In this paper, we present the concept, design, implementation, and performance evaluation of a practical astrophysics simulation code where we successfully enhanced the performance up to 10 times faster than the GPU-only solution.

Boku, Taisuke↗

MUPPET: An automated OpenMP mutation testing framework for performance optimization

MUPPET is a tool for OpenMP programs that identifies program modifications, called mutations, aimed at improving program performance. Existing performance optimization techniques, including profiling-based and auto-tuning techniques, fail to indicate program modifications at the source level thus preventing their portability across compilers. MUPPET aims to help HPC developers reason about performance defects and missed opportunities to improve performance at the source code level.

Parasyris, Konstantinos↗

Multilayer Insulation Thermal Protection Systems Technology

A summary is presented of the work performed by Marshall Space Flight Center (MSFC) and industry toward the development of flight-type multilayer insulation(MLI) systems. The MSFC MLI program is divided into three large categories: (1) the generation and compilation of MLI composite test data; (2) the analysis, design, and testing of heat flow through MLI applied to ducting, seams, electrical feedthroughs, structural supports, and the tank sidewall; and (3) the development, modification, and utilization of new testing procedures, tanks, and the test facilities. Numerous data have been generated, analyzed, and documented on different MLI composites.

E H Hyde↗

The Environmental Heat Flux Routine, Version 4 (EHFR-4) and Multiple Reflections Routine (MRR). Volume 2: Programmers reference manual

The EHFR program reference information which is presented consists of the following subprogram detailed data: purpose-description of the routine, a list of the calling programs, an argument list description, nomenclature definition, flow charts, and a compilation listing of each subprogram. Each of the EHFR subprograms were developed specifically for this routine and do not have an applicability of a general nature. Single precision accuracy available on the Univac 1108 is used exclusively in all but two of the 31 EHFR subprograms. The double precision variables required are identified in the nomenclature definition of the two subprograms that require them. A concise definition of the purpose, function, and capabilities is made in the subprogram description. The description references the appropriate Volume 1 sections of the report which contain the applicable detailed definitions, governing equations, and assumptions used. The compilation listing of each subprogram defines the program/data storage requirements, identifies the labeled block common data required, and identifies other subprograms called during execution. For Vol. 1, see N73-31842.

Dietz, J. B.↗

Air-cushion landing systems

Computer program based on heave/pitch analysis simulates dynamic behavior during landing impact and taxi over irregular runway. Program can be adapted to run on any computer with FORTRAN compiler.

Captain, K. M.↗