Search NASA⌕ Search

SEARCH · Search NASA

Results for “Compiler techniques”

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 397 records · Page 22

DOS Batch Files As Control Programs

Computer-programming technique circumvents maximum of 640K imposed on random-access memory (RAM) by DOS (Disk Operating System) software. Involves breaking application program into smaller programs. Each resulting subprogram, when compiled and linked, must be small enough to fit within 640K of RAM. Retrieved from storage on disk as needed. In terms of DOS software, each subprogram ".EXE" file executed in "stand-alone" manner.

Van Dyk, David A.↗

Computational control of flexible aerospace systems

The main objective of this project is to establish a distributed parameter modeling technique for structural analysis, parameter estimation, vibration suppression and control synthesis of large flexible aerospace structures. This report concentrates on the research outputs produced in the last two years. The main accomplishments can be summarized as follows. A new version of the PDEMOD Code had been completed based on several incomplete versions. The verification of the code had been conducted by comparing the results with those examples for which the exact theoretical solutions can be obtained. The theoretical background of the package and the verification examples has been reported in a technical paper submitted to the Joint Applied Mechanics & Material Conference, ASME. A brief USER'S MANUAL had been compiled, which includes three parts: (1) Input data preparation; (2) Explanation of the Subroutines; and (3) Specification of control variables. Meanwhile, a theoretical investigation of the NASA MSFC two-dimensional ground-based manipulator facility by using distributed parameter modeling technique has been conducted. A new mathematical treatment for dynamic analysis and control of large flexible manipulator systems has been conceived, which may provide an embryonic form of a more sophisticated mathematical model for future modified versions of the PDEMOD Codes.

Sharpe, Lonnie, Jr.↗

Evaluation of nonmetallic thermal protection materials for the manned space shuttle. Volume 1, task 1: Assessment of technical risks associated with utilization of nonmetallic thermal protection system

Technical problems of design and flight qualification of the proposed classes of surface insulation materials and leading edge materials were reviewed. A screening test plan, a preliminary design data test plan and a design data test plan were outlined. This program defined the apparent critical differences between the surface insulators and the leading edge materials, structuring specialized screening test plans for each of these two classes of materials. Unique testing techniques were shown to be important in evaluating the structural interaction aspects of the surface insulators and a separate task was defined to validate the test plan. In addition, a compilation was made of available information on proposed material (including metallic TPS), previous shuttle programs, pertinent test procedures, and other national programs of merit. This material was collected and summarized in an informally structured workbook.

Wilkinson, W. H.↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗

A critical compilation of experimental data on spectral lines and energy levels of hydrogen, deuterium, and tritium

For more than 50 years, Charlotte Moore's compilation of atomic energy levels and its subsequent revisions have been the standard source of reference data for the spectra of hydrogen and its isotopes. In those publications, theoretical data based on quantum-electrodynamic calculations have been given. This reflects the fact that the theory of the hydrogen spectrum has been perfected to an extent far exceeding the capabilities of the best measurements. However, rapid advances in the techniques of laser spectroscopy and optical frequency metrology have recently put experiments on a par with theory in terms of precision. This calls for construction of new comprehensive data sets for H, D, and T that summarize the latest experimental work and can be directly compared with the modern theoretical reference data. The present work compiles several tens of recent measurements of the hydrogen, deuterium, and tritium fine and hyperfine structure intervals and presents sets of energy levels and Ritz wavelengths derived from those measurements. Data exist for the fine structure of energy levels of hydrogen and deuterium up to principal quantum number n = 12. For higher lying levels, there are many observed lines with unresolved fine structure. From those observations, level centers (centers of the fine structure) are derived by a least-squares optimization, and Ritz wavelengths of series with upper levels up to n = 40 are obtained. For tritium, the n = 2 and 3 energy level intervals are derived from experimental observations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Ensemble methods for quantification of potassium oxide in ChemCam Mars and laboratory spectra

In this paper we test new approaches for predicting the amount of element oxides in rock samples from the ChemCam instrument suite onboard the NASA Curiosity rover by focusing on K 2 O. Using the expanded dataset compiled by Gasda et al. (2021) with and without the Earth to Mars (E2M and NoE2M) transformation discussed in Clegg et al. (2017) we trained blended submodels using the “double blending” technique and compared these to ensemble methods (Random Forest, ExtraTrees, and Gradient Boosting Regression). We found that ensemble methods performed similar to blended submodels when looking at RMSE-P on the laboratory spectra and provided significant advantages when looking at spectra coming from Mars. For the full model, blended submodels achieved an RMSE-P of 0.62 and 0.60 (E2M and NoE2M respectively) while Gradient Boosting Regression resulted in a slightly improved RMSE-P of 0.59 and 0.60. More importantly, by employing a local RMSE-P estimation technique where model performance is evaluated based on nearby test samples we found that using ensemble methods can lower the quantification limit for K 2 O from the current value of ≈0.6 wt% to ≈0.08 wt% using Extra Trees and Random Forest. This would allow for a much larger range of K 2 O values to be quantified on Mars with greater certainty given that most targets seen on Mars tend to have <1 wt% K2O. Finally, we used both Mean Decrease in Impurity (MDI) and permutation importance techniques to investigate the wavelengths used by the ensemble methods and found that they correspond to known potassium emission lines. This suggests that ensemble methods can provide an easier to train and improved alternative to blended submodels for predicting potassium compositions from Laser Induced Breakdown Spectroscopy (LIBS) data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

MeshAndCollect: an automated multi-crystal data-collection workflow for synchrotron macromolecular crystallography beamlines

The fully automated collection and merging of partial data sets from a series of cryocooled crystals of biological macromolecules contained on the same support is presented, as are the results of test experiments carried out on various systems. Here, an automated procedure is described to identify the positions of many cryocooled crystals mounted on the same sample holder, to rapidly predict and rank their relative diffraction strengths and to collect partial X-ray diffraction data sets from as many of the crystals as desired. Subsequent hierarchical cluster analysis then allows the best combination of partial data sets, optimizing the quality of the final data set obtained. The results of applying the method developed to various systems and scenarios including the compilation of a complete data set from tiny crystals of the membrane protein bacteriorhodopsin and the collection of data sets for successful structure determination using the single-wavelength anomalous dispersion technique are also presented.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Research into language concepts for the mission control center

A final report is given on research into language concepts for the Mission Control Center (MCC). The Specification Driven Language research is described. The state of the image processing field and how image processing techniques could be applied toward automating the generation of the language known as COmputation Development Environment (CODE or Comp Builder) are discussed. Also described is the development of a flight certified compiler for Comps.

Dellenback, Steven W.↗

Parallel computation in a three-dimensional elastic-plastic finite-element analysis

A CRAY parallel processing technique called autotasking was implemented in a three-dimensional elasto-plastic finite-element code. The technique was evaluated on two CRAY supercomputers, a CRAY 2 and a CRAY Y-MP. Autotasking was implemented in all major portions of the code, except the matrix equations solver. Compiler directives alone were not able to properly multitask the code; user-inserted directives were required to achieve better performance. It was noted that the connect time, rather than wall-clock time, was more appropriate to determine speedup in multiuser environments. For a typical example problem, a speedup of 2.1 (1.8 when the solution time was included) was achieved in a dedicated environment and 1.7 (1.6 with solution time) in a multiuser environment on a four-processor CRAY 2 supercomputer. The speedup on a three-processor CRAY Y-MP was about 2.4 (2.0 with solution time) in a multiuser environment.

Shivakumar, K. N.↗

The variable Herbig Ae Star HR 5999. X - Its photometric 'pulse-shaped' variability

We present additional photometric observations (Stromgren y filter) of the Herbig Ae Star HR 5999. This new set of data, composed of 282 data points covering April 1983 to August 1989, was used in conjunction with the 362 data points compiled by Baade and Stahl (1989). Our aim was to detect single or multiple periods in the integrated set of data spanning nearly 20 yr. Through the use of series analysis techniques, and by removing any linear component present in the raw data, we were able to detect weak peaks in the power spectra (in the order of intensity the strongest peaks are at 301 and 113 d) which were not self-evident in the phase diagrams. The overall picture of the data shows a small linear component, which is more noticeable in the new set of data, indicating that the recent maxima appear brighter. By a detailed analysis of the full light curve we were able to detect the presence of well-defined 'pulses' or bursts. Further Gaussian fits of these bursts indicated that the pulses are relatively rapid, of the order of 10 d, with some of them being closely spaced. No periodicity was found for the pulses. A possible explanation of these aperiodic outbursts is that they detect a flow of matter accompanied by magnetic field disturbances originated from the interior of the star, unlike those originating externally such as binary perturbations, which tend to be periodic.

Perez, M. R.↗

A Comparison of Techniques for Detecting Abnormal Change in Blogs

Distributed collections are made of metadata entries that contain references to artifacts not controlled by the collection curators. These collections often have limited forms of change; for digital distributed collections, primarily creation and deletion of additional resources. However, there exists a class of digital collection that undergoes additional kinds of change. These collections consist of resources that are distributed across the Internet and brought together via hyperlinking. Resources in these collections can be expected to change as time goes on. Part of the difficulty in maintaining these collections is determining if a changed page is still a valid member of the collection. Others have tried to address this by defining a maximum allowed threshold of change, however, these methods treat change as a potential problem and treat web content as static despite its intrinsic dynamicism. Instead we acknowledge change on the web as a normal part of a web document and determine the difference between what a maintainer expects a page to do and what it actually does. In this work we evaluate options for extractors and analyzers from a suite of techniques against a human-generated ground-truth set of blog changes. The results of this work show a statistically significant improvement over traditional threshold techniques for our collection.

99 GENERAL AND MISCELLANEOUS↗

Automatic inspection of program state in an uncooperative environment

Abstract The program state is formed by the values that the program manipulates. These values are stored in the stack, in the heap, or in static memory. The ability to inspect the program state is useful as a debugging or as a verification aid. Yet, there exists no general technique to insert inspection points in type‐unsafe languages such as C or C++. The difficulty comes from the need to traverse the memory graph in a so‐called uncooperative environment. In this article, we propose an automatic technique to deal with this problem. We introduce a static code transformation approach that inserts in a program the instrumentation necessary to report its internal state. Our technique has been implemented in LLVM. It is possible to adjust the granularity of inspection points trading precision for performance. In this article, we demonstrate how to use inspection points to debug compiler optimizations; to augment benchmarks with verification code; and to visualize data structures.

Magalhães, José Wesley de Souza↗

Developing Ultrahigh-Resolution E3SM Land Model for GPU Systems

Designing and refactoring complex scientific code, such as the E3SM land model (ELM), for new computing architectures is challenging. This paper presents design strategies and technical approaches to develop a data-oriented, GPU-ready ELM model using compiler directives (OpenACC/OpenMP). We first analyze the datatypes and processes in the original ELM code. Then we present design considerations for ultrahigh-resolution ELM (uELM) development for massive GPU systems. These techniques include the global data-oriented simulation workflow, domain partition, code porting and data copy, memory reduction, parallel loop restructure and flattening, and race condition detection. We implemented the first version of uELM using OpenACC targeting the NVidia GPUs in the Summit supercomputer at Oak Ridge National Laboratory. During the implementation, we developed a software tool (named SPEL) to facilitate code generation, verification, and performance tuning using these techniques. The first uELM implementation for Nvidia GPUs on Summit delivered promising results: 1) over 98% of the ELM code was automatically generated and tuned by scripts. Most ELM modules had better computational performances than the original ELM code for CPUs. The GPU-ready uELM is more scalable than the CPU code on fully-loaded Summit nodes. Example profiling results from several modules are also presented to illustrate the performance improvements and race condition detection. The lessons learned and toolkit developed in the study are also suitable for further uELM deployment using OpenMP on the first US exascale computer, Frontier, equipped with AMD CPUs and GPUs.

Schwartz, Peter↗

YOUNG STELLAR OBJECTS IN THE GOULD BELT

We present the full catalog of Young Stellar Objects (YSOs) identified in the 18 molecular clouds surveyed by the Spitzer Space Telescope “cores to disks” (c2d) and “Gould Belt” (GB) Legacy surveys. Using standard techniques developed by the c2d project, we identify 3239 candidate YSOs in the 18 clouds, 2966 of which survive visual inspection and form our final catalog of YSOs in the GB. We compile extinction corrected spectral energy distributions for all 2966 YSOs and calculate and tabulate the infrared spectral index, bolometric luminosity, and bolometric temperature for each object. We find that 326 (11%), 210 (7%), 1248 (42%), and 1182 (40%) are classified as Class 0 + I, Flat-spectrum, Class II, and Class III, respectively, and show that the Class III sample suffers from an overall contamination rate by background Asymptotic Giant Branch stars between 25% and 90%. Adopting standard assumptions, we derive durations of 0.40–0.78 Myr for Class 0 + I YSOs and 0.26–0.50 Myr for Flat-spectrum YSOs, where the ranges encompass uncertainties in the adopted assumptions. Including information from (sub)millimeter wavelengths, one-third of the Class 0 + I sample is classified as Class 0, leading to durations of 0.13–0.26 Myr (Class 0) and 0.27–0.52 Myr (Class I). We revisit infrared color–color diagrams used in the literature to classify YSOs and propose minor revisions to classification boundaries in these diagrams. Finally, we show that the bolometric temperature is a poor discriminator between Class II and Class III YSOs.

79 ASTRONOMY AND ASTROPHYSICS↗

Sample-efficient verification of continuously-parameterized quantum gates for small quantum processors

Most near-term quantum information processing devices will not be capable of implementing quantum error correction and the associated logical quantum gate set. Instead, quantum circuits will be implemented directly using the physical native gate set of the device. These native gates often have a parameterization (e.g., rotation angles) which provide the ability to perform a continuous range of operations. Verification of the correct operation of these gates across the allowable range of parameters is important for gaining confidence in the reliability of these devices. In this work, we demonstrate a procedure for sample-efficient verification of continuously-parameterized quantum gates for small quantum processors of up to approximately 10 qubits. This procedure involves generating random sequences of randomly-parameterized layers of gates chosen from the native gate set of the device, and then stochastically compiling an approximate inverse to this sequence such that executing the full sequence on the device should leave the system near its initial state. We show that fidelity estimates made via this technique have a lower variance than fidelity estimates made via cross-entropy benchmarking. This provides an experimentally-relevant advantage in sample efficiency when estimating the fidelity loss to some desired precision. We describe the experimental realization of this technique using continuously-parameterized quantum gate sets on a trapped-ion quantum processor from Sandia QSCOUT and a superconducting quantum processor from IBM Q, and we demonstrate the sample efficiency advantage of this technique both numerically and experimentally.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Space shuttle flying qualities criteria assessment, phase 3

The crucial flight data measurement and reduction techniques required for the experimental approach are explored. An overview of available flight data is presented, identification of the effective augmented vehicle and pilot models determined, a summary of flight data problems compiled, and further recommendations for the Orbiter Flying Qualities (OFQ) experiment provided.

Myers, T. T.↗

Nineteenth International Cosmic Ray Conference. HE Sessions, Volume 8

Papers submitted for presentation at the 19th International Cosmic Ray Conference are compiled. The present volume contains papers addressing high energy interactions and related phenomena. Specific topic areas include muons, neutrinos, magnetic monopoles, nucleon decay, searches for new particles, and acoustic and thermoluminescence detection techniques.

Jones, F. C.↗