Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel programming”

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 307 records · Page 17

Three-dimensional boundary layer analysis program Blay and its application

The boundary layer calculation program (BLAY) is a program code which accurately analyzes the three-dimensional boundary layer of a wing with an undefined plane. In comparison with other preexisting programs, the BLAY is characterized by the following: (1) the time required for computation is shorter than any other; (2) the program is adaptable to a parallel processing computer; and (3) the program is associated with a secondary accuracy in the z-direction. As a boundary layer modification to transonic nonviscous flow analysis programs, it is used to adjust viscous and nonviscous interference problems repeatedly. Its efficiency is an important factor in cost reduction in aircraft designing.

Matsuno, K. I.↗

Scheduling message processing for reducing rollback propagation

Traditional checkpointing and rollback recovery techniques for parallel systems have typically assumed the communication pattern is specified by program behavior. In this paper we exploit the property that the communication pattern can often be changed at run-time without affecting program correctness. A scheduling algorithm for message processing and its implementation for reducing rollback propagation are described. The algorithm incorporates a user-transparent prioritized scheme based upon the run-time communication and checkpointing history. Communication trace-driven simulation for several parallel programs written in the Chare Kernel language demonstrates that the probability of rollback propagation can be reduced at the cost of slight additional performance degradation.

Wang, Yi-Min↗

Eigensolver for a Sparse, Large Hermitian Matrix

A parallel-processing computer program finds a few eigenvalues in a sparse Hermitian matrix that contains as many as 100 million diagonal elements. This program finds the eigenvalues faster, using less memory, than do other, comparable eigensolver programs. This program implements a Lanczos algorithm in the American National Standards Institute/ International Organization for Standardization (ANSI/ISO) C computing language, using the Message Passing Interface (MPI) standard to complement an eigensolver in PARPACK. [PARPACK (Parallel Arnoldi Package) is an extension, to parallel-processing computer architectures, of ARPACK (Arnoldi Package), which is a collection of Fortran 77 subroutines that solve large-scale eigenvalue problems.] The eigensolver runs on Beowulf clusters of computers at the Jet Propulsion Laboratory (JPL).

Tisdale, E. Robert↗

BUCLAP2: A computer program for instability analysis of laminated long plates subjected to combined inplane loads

This program description document describes the program structure and the design details of a CDC 6600 FORTRAN 4 digital computer program, BUCLAP2, which uses minimum energy principles to do an elastic stability analysis of curved and flat laminated rectangular long plates subjected to combined inplane normal and shear loads. Given the geometry, the material properties, and slected boundary conditions for the plate element, the program calculates the minimum buckling load for various wave lengths. The two parallel ends of the program calculates the minimum buckling load for various wave lengths. The two parallel ends of the long plate must be simply supported and arbitrary elastic boundary conditions may be imposed along either one or both external longitudinal sides. For guide to program use, see

Halstead, D. W.↗

Computer program for the load and trajectory analysis of two DOF bodies connected by an elastic tether: Users manual

The derivation of the differential equations of motion of a 3 Degrees of Freedom body joined to a 3 Degrees of Freedom body by an elastic tether. The tether is represented by a spring and dashpot in parallel. A computer program which integrates the equations of motion is also described. Although the derivation of the equations of motions are for a general system, the computer program is written for defining loads in large boosters recovered by parachutes.

Doyle, G. R., Jr.↗

Software simulator for multiple computer simulation system

A description is given of the structure and use of a computer program that simulates the operation of a parallel processor simulation system. The program is part of an investigation to determine algorithms that are suitable for simulating continous systems on a parallel processor configuration. The simulator is designed to accurately simulate the problem-solving phase of a simulation study. Care has been taken to ensure the integrity and correctness of data exchanges and to correctly sequence periods of computation and periods of data exchange. It is pointed out that the functions performed during a problem-setup phase or a reset phase are not simulated. In particular, there is no attempt to simulate the downloading process that loads object code into the local, transfer, and mapping memories of processing elements or the memories of the run control processor and the system control processor. The main program of the simulator carries out some problem-setup functions of the system control processor in that it requests the user to enter values for simulation system parameters and problem parameters. The method by which these values are transferred to the other processors, however, is not simulated.

Ogrady, E. P.↗

Parallel processing for scientific computations

The main contribution of the effort in the last two years is the introduction of the MOPPS system. After doing extensive literature search, we introduced the system which is described next. MOPPS employs a new solution to the problem of managing programs which solve scientific and engineering applications on a distributed processing environment. Autonomous computers cooperate efficiently in solving large scientific problems with this solution. MOPPS has the advantage of not assuming the presence of any particular network topology or configuration, computer architecture, or operating system. It imposes little overhead on network and processor resources while efficiently managing programs concurrently. The core of MOPPS is an intelligent program manager that builds a knowledge base of the execution performance of the parallel programs it is managing under various conditions. The manager applies this knowledge to improve the performance of future runs. The program manager learns from experience.

Alkhatib, Hasan S.↗

Investigation of air transportation technology at Princeton University, 1988-1989

The Air Transportation Technology Program at Princeton University, a program emphasizing graduate and undergraduate student research, proceeded along several avenues during the past year. A study of optimal trajectories for penetration of microbursts when encounter is unavoidable was conducted. The emphasis of current wind shear research is on developing an expert system for wind shear avoidance. A knowledge-based reconfigurable flight control system that is implemented with the Pascal programming language using parallel microprocessors was developed. This expert system could be considered a prototype for a failure-tolerant control system that can be constructed using existing hardware. Development of a real-time cockpit simulator continued during the year. The simulator provides a single-person crew station with both conventional and advanced control devices; it currently is programmed to simulate the Navion single-engine general aviation airplane. Alternatives for the air traffic control system giving particular attention to the institutional structure of the FAA are analyzed. A simple numerical procedure for estimating the stochastic robustness of control systems is being investigated. The revitalization of the general aviation industry is also discussed.

Stengel, Robert F.↗

The Design and Evaluation of "CAPTools"--A Computer Aided Parallelization Toolkit

Writing applications for high performance computers is a challenging task. Although writing code by hand still offers the best performance, it is extremely costly and often not very portable. The Computer Aided Parallelization Tools (CAPTools) are a toolkit designed to help automate the mapping of sequential FORTRAN scientific applications onto multiprocessors. CAPTools consists of the following major components: an inter-procedural dependence analysis module that incorporates user knowledge; a 'self-propagating' data partitioning module driven via user guidance; an execution control mask generation and optimization module for the user to fine tune parallel processing of individual partitions; a program transformation/restructuring facility for source code clean up and optimization; a set of browsers through which the user interacts with CAPTools at each stage of the parallelization process; and a code generator supporting multiple programming paradigms on various multiprocessors. Besides describing the rationale behind the architecture of CAPTools, the parallelization process is illustrated via case studies involving structured and unstructured meshes. The programming process and the performance of the generated parallel programs are compared against other programming alternatives based on the NAS Parallel Benchmarks, ARC3D and other scientific applications. Based on these results, a discussion on the feasibility of constructing architectural independent parallel applications is presented.

Yan, Jerry↗

Parallel and Distributed Computational Fluid Dynamics: Experimental Results and Challenges

This paper describes several results of parallel and distributed computing using a large scale production flow solver program. A coarse grained parallelization based on clustering of discretization grids combined with partitioning of large grids for load balancing is presented. An assessment is given of its performance on distributed and distributed-shared memory platforms using large scale scientific problems. An experiment with this solver, adapted to a Wide Area Network execution environment is presented. We also give a comparative performance assessment of computation and communication times on both the tightly and loosely-coupled machines.

Djomehri, Mohammad Jahed↗

NASA’s Human Landing System: Enabling the Next Generation of Lunar Science

The Human Landing System (HLS) is the mode of transportation that will take astronauts to the lunar surface as part of NASA's Artemis exploration program. HLS also serves as a research platform both on the surface and in lunar orbit, enabling critical scientific investigations on and of the Moon. With support at NASA centers around the country, the HLS program, based at Marshall Space Flight Center in Huntsville, Alabama, is working closely with its commercial partners throughout the development process to design and build innovative and technically advanced lunar landers – new vehicles designed for the modern era of space travel – leveraging decades of human spaceflight experience and the speed of the commercial sector. In 2019, NASA asked U.S. industry for proposals to design and develop a human lander for the first human mission to the lunar surface under Artemis. Initial contracts were awarded to Blue Origin Federation, Dynetics, and SpaceX to advance their designs. Following the execution of the ten-month Base Period, NASA announced in April 2021 that the agency selected SpaceX to move forward with its human landing system [1] and land the first two astronauts on the lunar surface during the Artemis III mission. Following two protest periods, NASA awarded the contract, known as Option A, to SpaceX in July 2021 and resumed work in November 2021 (Fig. 1). In parallel, the HLS program has been preparing for the acquisition that will procure regular crewed transportation to the lunar surface following Artemis III. NASA released a request for information (RFI) in July 2021 asking U.S. industry for feedback to help inform the future solicitation, known as Lunar Exploration Transportation Services (LETS) [2]. Also in July 2021, NASA released the NextSTEP-2 Appendix N broad agency announcement soliciting new work from U.S. industry to mature their HLS designs and perform risk reduction activities in advance of the LETS procurement [3]. NASA selected Blue Origin Federation, Dynetics, Lockheed Martin, Northrop Grumman, and SpaceX to participate [4]. This work will also help better inform the LETS procurement and prepare industry to propose. NASA hopes to release a draft request for proposals (RFP) in Spring 2022.

R C Weber↗

An intelligent allocation algorithm for parallel processing

The problem of allocating nodes of a program graph to processors in a parallel processing architecture is considered. The algorithm is based on critical path analysis, some allocation heuristics, and the execution granularity of nodes in a program graph. These factors, and the structure of interprocessor communication network, influence the allocation. To achieve realistic estimations of the executive durations of allocations, the algorithm considers the fact that nodes in a program graph have to communicate through varying numbers of tokens. Coarse and fine granularities have been implemented, with interprocessor token-communication duration, varying from zero up to values comparable to the execution durations of individual nodes. The effect on allocation of communication network structures is demonstrated by performing allocations for crossbar (non-blocking) and star (blocking) networks. The algorithm assumes the availability of as many processors as it needs for the optimal allocation of any program graph. Hence, the focus of allocation has been on varying token-communication durations rather than varying the number of processors. The algorithm always utilizes as many processors as necessary for the optimal allocation of any program graph, depending upon granularity and characteristics of the interprocessor communication network.

Carroll, Chester C.↗

Evaluation of ERTS multispectral signatures in relation to ground control signatures using a nested-sampling approach

The author has identified the following significant results. Ground measured spectral signatures of wavelength bands matching ERTS MSS were collected using a radiometer at several Californian and Nevadan sites, and directly compared with similar data from ERTS CCTs. The comparison was tested at the highest possible spatial resolution for ERTS, using deconvoluted MSS data, and contrasted with that of ground measured spectra, originally from 1 meter squares. In the mobile traverses of the grassland sites, these one meter fields of view were integrated into eighty meter transects along the five km track across four major rock/soil types. Suitable software was developed to read the MSS CCT tapes, to shadeprint individual bands with user-determined greyscale stretching. Four new algorithms for unsupervised and supervised, normalized and unnormalized clustering were developed, into a program termed STANSORT. Parallel software allowed the field data to be calibrated, and by using concurrently continuously collected, upward- and downward-viewing, 4 band radiometers, bidirectional reflectances could be calculated.

Lyon, R. J. P.↗

Rebirth of remote sensing: Do we know enough for our own good?

Obstacles or deficiencies in on-going satellites that impede operational use of data are described. Because spectral and spatial characteristics of LANDSAT D sensors are different from earlier satellites, they deter operational planning and data use, and an operational program operated in parallel with experimental technology development is needed. Particular attention is given to the satellite sensor readout system, its current applications, and needs for the future.

Herbst, R. L.↗

Algorithms and programming tools for image processing on the MPP, introduction

The programming tools and parallel algorithms created for the Massively Parallel Processor (MPP) located at the NASA Goddard Space Center are discussed. A user-friendly environment for high level language parallel algorithm development was developed. The issues involved in implementing certain algorithms on the MPP were researched. The expected results were compared with the actual results.

Source record↗