Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel implementation”

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 1,189 records · Page 66

Knowledge-based processing for aircraft flight control

This Contractor Report documents research in Intelligent Control using knowledge-based processing in a manner dual to methods found in the classic stochastic decision, estimation, and control discipline. Such knowledge-based control has also been called Declarative, and Hybid. Software architectures were sought, employing the parallelism inherent in modern object-oriented modeling and programming. The viewpoint adopted was that Intelligent Control employs a class of domain-specific software architectures having features common over a broad variety of implementations, such as management of aircraft flight, power distribution, etc. As much attention was paid to software engineering issues as to artificial intelligence and control issues. This research considered that particular processing methods from the stochastic and knowledge-based worlds are duals, that is, similar in a broad context. They provide architectural design concepts which serve as bridges between the disparate disciplines of decision, estimation, control, and artificial intelligence. This research was applied to the control of a subsonic transport aircraft in the airport terminal area.

Painter, John H.↗

Trace-Driven Debugging of Message Passing Programs

In this paper we report on features added to a parallel debugger to simplify the debugging of parallel message passing programs. These features include replay, setting consistent breakpoints based on interprocess event causality, a parallel undo operation, and communication supervision. These features all use trace information collected during the execution of the program being debugged. We used a number of different instrumentation techniques to collect traces. We also implemented trace displays using two different trace visualization systems. The implementation was tested on an SGI Power Challenge cluster and a network of SGI workstations.

Frumkin, Michael↗

Message Passing and Shared Address Space Parallelism on an SMP Cluster

Currently, message passing (MP) and shared address space (SAS) are the two leading parallel programming paradigms. MP has been standardized with MPI, and is the more common and mature approach; however, code development can be extremely difficult, especially for irregularly structured computations. SAS offers substantial ease of programming, but may suffer from performance limitations due to poor spatial locality and high protocol overhead. In this paper, we compare the performance of and the programming effort required for six applications under both programming models on a 32-processor PC-SMP cluster, a platform that is becoming increasingly attractive for high-end scientific computing. Our application suite consists of codes that typically do not exhibit scalable performance under shared-memory programming due to their high communication-to-computation ratios and/or complex communication patterns. Results indicate that SAS can achieve about half the parallel efficiency of MPI for most of our applications, while being competitive for the others. A hybrid MPI+SAS strategy shows only a small performance advantage over pure MPI in some cases. Finally, improved implementations of two MPI collective operations on PC-SMP clusters are presented.

Shan, Hongzhang↗

Climatespark: an In-Memory Distributed Computing Framework for Big Climate Data Analytics

The unprecedented growth of climate data creates new opportunities for climate studies, and yet big climate data pose a grand challenge to climatologists to efficiently manage and analyze big data. The complexity of climate data content and analytical algorithms increases the difficulty of implementing algorithms on high performance computing systems. This paper proposes an in-memory, distributed computing framework, ClimateSpark, to facilitate complex big data analytics and time-consuming computational tasks. Chunking data structure improves parallel I/O efficiency, while a spatiotemporal index is built for the chunks to avoid unnecessary data reading and preprocessing. An integrated, multi-dimensional, array-based data model (ClimateRDD) and ETL operations are developed to address big climate data variety by integrating the processing components of the climate data lifecycle. ClimateSpark utilizes Spark SQL and Apache Zeppelin to develop a web portal to facilitate the interaction among climatologists, climate data, analytic operations and computing resources (e.g., using SQL query and Scala/Python notebook). Experimental results show that ClimateSpark conducts different spatiotemporal data queries/analytics with high efficiency and data locality. ClimateSpark is easily adaptable to other big multiple- dimensional, array-based datasets in various geoscience domains.

Hu, Fei↗

NICS (NASA Instrument Capabilities Study) Instrument Schedule and Cost Study

This paper summarizes work performed on the Flight Projects Directorate Planetary Science Projects Division (PSPD, Code 430) NICS (NASA Instrument Capabilities study) instrument schedule and cost study. Included are a short summary of the original NICS (NASA, 2008), and the design and approach, data collection, analysis, preliminary findings and recommendations from select areas of the current study. The NICS (2008) was chartered by then NASA Chief Engineer Michael Ryschkewitsch and chaired by Goddard Space Flight Center (GSFC) engineer, John Leon. The focus was to identify problem areas in instrument development and, if possible, to offer solutions. In the area of instrument developments, the NICS (2008) identified a lack of resources and authority to successfully manage to instrument cost and schedule requirements; and a lack of critical skills, expertise, and leadership to successfully implement unique (one-of-a-kind) high technology developments (NASA, 2008, pp. 51, 52). Additionally, the NICS (2008) found problems in requirements formulation, reviews and management; unrealistic caps and overly optimistic estimates; and externally directed changes which increased the likelihood of overrunning cost and schedule (NASA, 2008, pp.53, 54). It is noteworthy that NICS findings are consistent with previous studies at the mission level (Robbins, Schmidt & White, 2020). Five years later in 2013, the Instrument Projects Division (IPD) was established to implement and manage instrument projects greater than $20M. The IPD was known as Code 490. Its structure incorporated several of the NICS (2008) recommendations. To see if these incorporated recommendations made a difference, and to identify other potential challenges in instrument developments, two parallel studies were initiated. Originally led by the IPD, now led by the PSPD, and the Instrument and Payload Systems Engineering Branch (IPSE, Code 592), respectively, the instrument schedule and cost study and the instrument technical complexity study began in 2017. Data collection was initiated in 2020 and is on-going. This paper is limited to the IPD/PSPD study. Among other findings, preliminary data indicate IPD/PSPD project management support positively influenced instrument development as related to providing a dedicated level of support staff, including a deputy Instrument Project Manager (dIPM), reducing IPM leadership changes, and providing other project support. Next steps include continued data collection and analysis, and mapping to technical complexity data.

NICS implementation↗

Particle Interaction Physics Model Formulation for Plume-Surface Interaction Erosion and Cratering

The Predictive Simulation Capability development team of the STMD Game Changing Development sponsored PSI project is implementing computational simulation capability for the efficient and accurate prediction of Plume-Surface Interaction induced surface erosion and cratering in Martian and Lunar environments. The status of the Focus Area 3 of the PSI project in the generation and efficient application of accurate soil particle composition modeling in the Gas-Granular Flow Solver (GGFS) computational framework is presented. The process of constitutive closure model database generation using DEM particle interaction modeling for capturing the effects of irregular particle shape and poly-disperse mixture distribution effects is outlined. This capability has now been ported to NASA supercomputer assets and NASA engineers successfully demonstrated technology and skillset transfer in model generation for spherical and irregularly shaped, mono-disperse and bi-disperse mixture compositions. Assessment of the computational efficiency and practicality of the academic serially executed DEM tools on NASA supercomputers identified the need to migrate to a DEM framework capable of performing parallel simulations in a simultaneous process orchestrated in an automated setup, execution, database extraction, and dataset delivery ready for application simulations. The LIGGGHTS DEM toolset has been selected as the most suitable tool to migrate the DEM simulations. Once the soil model generation process is implemented, models capturing the shape and poly-dispersity effects will be generated to perform much refined validation simulations against the experiments performed under the PSI project. The application readiness of the soil models currently operational in GGFS was presented for the example of a full scale, 3-D simulation of the plume induced erosion and crater formation of the Apollo LM at an elevation of 5m above ground in a low pressure, near vacuum background.

Peter A Liever↗

Particle Interaction Physics Model Formulation for Plume-Surface Interaction Erosion and Cratering

The Predictive Simulation Capability development team of the STMD Game Changing Development sponsored PSI project is implementing computational simulation capability for the efficient and accurate prediction of Plume-Surface Interaction induced surface erosion and cratering in Martian and Lunar environments. The status of the Focus Area 3 of the PSI project in the generation and efficient application of accurate soil particle composition modeling in the Gas-Granular Flow Solver (GGFS) computational framework is presented. The process of constitutive closure model database generation using DEM particle interaction modeling for capturing the effects of irregular particle shape and poly-disperse mixture distribution effects is outlined. This capability has now been ported to NASA supercomputer assets and NASA engineers successfully demonstrated technology and skillset transfer in model generation for spherical and irregularly shaped, mono-disperse and bi-disperse mixture compositions. Assessment of the computational efficiency and practicality of the academic serially executed DEM tools on NASA supercomputers identified the need to migrate to a DEM framework capable of performing parallel simulations in a simultaneous process orchestrated in an automated setup, execution, database extraction, and dataset delivery ready for application simulations. The LIGGGHTS DEM toolset has been selected as the most suitable tool to migrate the DEM simulations. Once the soil model generation process is implemented, models capturing the shape and poly-dispersity effects will be generated to perform much refined validation simulations against the experiments performed under the PSI project. The application readiness of the soil models currently operational in GGFS was presented for the example of a full scale, 3-D simulation of the plume induced erosion and crater formation of the Apollo LM at an elevation of 5m above ground in a low pressure, near vacuum background.

Peter A Liever↗

PISCES 2 users manual

PISCES 2 is a programming environment and set of extensions to Fortran 77 for parallel programming. It is intended to provide a basis for writing programs for scientific and engineering applications on parallel computers in a way that is relatively independent of the particular details of the underlying computer architecture. This user's manual provides a complete description of the PISCES 2 system as it is currently implemented on the 20 processor Flexible FLEX/32 at NASA Langley Research Center.

Pratt, Terrence W.↗

Two complimentary methods for aligning linear arrays

Two approaches are presented for implementing a simple method for aligning the object and image planes of linear arrays of elemental detectors. Both variants begin by firing a laser beam into cubic beamsplitters which change the direction of the resulting parallel beams to one perpendicular to the array. A neutral density filter is located along the beam path and an optical microscope is located beyond the exit plane of the beamsplitters. In the first variant, the beam is tuned to the spectral sensitivity of the elements. In the second version, a lens and a microscope are situated outside the exit plane of the beamsplitters, and spectral tuning is unnecessary. Subsequent rotations of the array are shown to reveal the coincidence or lack of coincidence of the image plane and the linear array.

Finkel, Mitchell W.↗

Analysis of damage in MMC components using an internal state variable model

A metal-matrix composite (MMC) model was developed which includes the concept of damage evolution. The evolution of damage is assumed to be governed by a Kachanov-type equation. This viscoplastic damage model was implemented in the finite element code, MARC. Both uniaxial (creep) and multiaxial (an internally pressurized thick-walled cylinder) problems were analyzed using this implementation. Some preliminary results are presented which consider monotonic (constant) loadings. The creep curves including damage for four fiber orientations are presented. As expected, the minimum creep occurs when load is applied in a direction parallel to the fibers. The tangential strains at the inner radius of a thick-walled MMC-cylinder for four fiber orientations are shown with damage included. The cylinder exhibits the maximum creep resistance when the fibers are oriented in the circumferential direction, perpendicular to the axis of the cylinder. Time-to-failure for the thick-walled cylinder for the same fiber orientation angles is also shown. As expected, the life of the cylinder can be increased by orientating the fibers in the circumferential direction, perpendicular to the axis of the cylinder. The results, although qualitative, indicate that significant benefits in creep-resistance and service life can be achieved by using MMC materials as structural materials for high-temperature design.

Arya, V. K.↗

Digital tracking loops for a programmable digital modem

In this paper, an analysis and hardware emulation of the tracking loops for a very flexible programmable digital modem (PDM) will be presented. The modem is capable of being programmed for 2, 4, 8, 16-PSK, 16-QAM, MSK, and Offset-QPSK modulation schemes over a range of data rates from 2.34 to 300 Mbps with programmable spectral occupancy from 1.2 to 1.8 times the symbol rate; these operational parameters are executable in burst or continuous mode. All of the critical processing in both the modulator and demodulator is done at baseband with very high-speed digital hardware and memory. Quadrature analog front-ends are used for translation between baseband and the IF center frequency. The modulator is based on a table lookup approach, where precomputed samples are stored in memory and clocked out according to the incoming data pattern. The sample values are predistorted to counteract the effects of the other filtering functions in the link as well as any transmission impairments. The demodulator architecture was adapted from a joint estimator-detector (JED) mathematical analysis. Its structure is applicable to most signalling formats that can be represented in a two-dimensional space. The JED realization uses interdependent, mutually aiding tracking loops with post-detection data feedback. To expedite and provide for more reliable synchronization, initial estimates for these loops are computed in a parallel acquisition processor. The cornerstone of the demodulator realization is the pre-averager received data filter which allows operation over a broad range of data rates without any hardware changes and greatly simplifies the implementation complexity. The emulation results confirmed tracking loop operation over the entire range of operational parameters listed above, as well as the capability of achieving and maintaining synchronization at BER's in excess of 10(exp -1). The emulation results also showed very close agreement with the tracking loop analysis, and validated the resolution apportionment of the various hardware elements in the tracking loops.

Poklemba, John J.↗

CLIPS meets the connection machine: Or how to create a parallel production system

Production systems usually present unacceptable run-times when faced with applications requiring tens of thousands to millions of facts. Many efforts have focused on the use of parallelism as a way to increase overall system performance. While these efforts have increased pattern matching and rule evaluation rates, they have only indirectly dealt with the problems faced by fact burdened applications. We have implemented PPS, a version of CLIPS running on the Connection Machine, to directly address the problems faced by these applications. This paper will describe our system, discuss its implementation, and present results.

Geyer, Steve↗

Accelerating Climate Simulations Through Hybrid Computing

Unconventional multi-core processors (e.g., IBM Cell B/E and NYIDIDA GPU) have emerged as accelerators in climate simulation. However, climate models typically run on parallel computers with conventional processors (e.g., Intel and AMD) using MPI. Connecting accelerators to this architecture efficiently and easily becomes a critical issue. When using MPI for connection, we identified two challenges: (1) identical MPI implementation is required in both systems, and; (2) existing MPI code must be modified to accommodate the accelerators. In response, we have extended and deployed IBM Dynamic Application Virtualization (DAV) in a hybrid computing prototype system (one blade with two Intel quad-core processors, two IBM QS22 Cell blades, connected with Infiniband), allowing for seamlessly offloading compute-intensive functions to remote, heterogeneous accelerators in a scalable, load-balanced manner. Currently, a climate solar radiation model running with multiple MPI processes has been offloaded to multiple Cell blades with approx.10% network overhead.

Zhou, Shujia↗

Numerical Experiments in Error Control for Sound Propagation Using a Damping Layer Boundary Treatment

This paper presents results from numerical experiments for controlling the error caused by a damping layer boundary treatment when simulating the propagation of an acoustic signal from a continuous pressure source. The computations are with the 2D Linearized Euler Equations (LEE) for both a uniform mean flow and a steady parallel jet. The numerical experiments are with algorithms that are third, fifth, seventh and ninth order accurate in space and time. The numerical domain is enclosed in a damping layer boundary treatment. The damping is implemented in a time accurate manner, with simple polynomial damping profiles of second, fourth, sixth and eighth power. At the outer boundaries of the damping layer the propagating solution is uniformly set to zero. The complete boundary treatment is remarkably simple and intrinsically independant from the dimension of the spatial domain. The reported results show the relative effect on the error from the boundary treatment by varying the damping layer width, damping profile power, damping amplitude, propagtion time, grid resolution and algorithm order. The issue that is being addressed is not the accuracy of the numerical solution when compared to a mathematical solution, but the effect of the complete boundary treatment on the numerical solution, and to what degree the error in the numerical solution from the complete boundary treatment can be controlled. We report maximum relative absolute errors from just the boundary treatment that range from O[10-2] to O[10-7].

Algorithm↗

Numerical Experiments in Error Control for Sound Propagation Using a Damping Layer Boundary Treatment

This paper presents results from numerical experiments for controlling the error caused by a damping layer boundary treatment when simulating the propagation of an acoustic signal from a continuous pressure source. The computations are with the 2D Linearized Euler Equations (LEE) for both a uniform mean flow and a steady parallel jet. The numerical experiments are with algorithms that are third, fifth, seventh and ninth order accurate in space and time. The numerical domain is enclosed in a damping layer boundary treatment. The damping is implemented in a time accurate manner, with simple polynomial damping profiles of second, fourth, sixth and eighth power. At the outer boundaries of the damping layer the propagating solution is uniformly set to zero. The complete boundary treatment is remarkably simple and intrinsically independant from the dimension of the spatial domain. The reported results show the relative effect on the error from the boundary treatment by varying the damping layer width, damping profile power, damping amplitude, propagtion time, grid resolution and algorithm order. The issue that is being addressed is not the accuracy of the numerical solution when compared to a mathematical solution, but the effect of the complete boundary treatment on the numerical solution, and to what degree the error in the numerical solution from the complete boundary treatment can be controlled. We report maximum relative absolute errors from just the boundary treatment that range from O[10-2] to O[10-7].

Computational Aeroacoustics↗

Concurrent processing in nonlinear structural stability

A concurrent processing algorithm is developed for materially nonlinear stability analysis of imperfect columns with biaxial partial rotational end restraints. The algorithm for solving the governing nonlinear ordinary differential equations is implemented on a multiprocessor computer called the 'Finite Element Machine', developed at the NASA Langley Research Center. Numerical results are obtained on up to nine concurrent processors. A substantial computational gain is achieved in using the parallel processing approach.

Darbhamulla, S. P.↗

TRAPEDS: Producing traces for multicomputers via execution-driven simulation

Trace-driven simulation is an important aid in performance analysis of computer systems. Capturing address traces for these simulations is a difficult problem for single processors and particularly for multicomputers. Even when existing trace methods can be used on multicomputers, the amount of collected data typically grows with the number of processors, so I/O and trace storage costs increase. A new technique is presented which modifies the executable code to dynamically collect the address trace from the user code and analyzes this trace during the execution of the program. This method helps resolve the I/O and storage problems and facilitates parallel analysis of the address trace. If a trace stored on disk is desired, the generated trace information can also be written to files during execution, with a resultant drop in program execution speed. An initial implementation on the Intel iPSC/2 hypercube multicomputer is detailed, and sample simulation results are presented. The effect of this trace collection method on execution time is illustrated.

Stunkel, Craig B.↗

TRAPEDS - Producing traces for multicomputers via execution driven simulation

Trace-driven simulation is an important aid in performance analysis of computer systems. Capturing address traces for these simulations is a difficult problem for single processors and particularly for multicomputers. Even when existing trace methods can be used on multicomputers, the amount of collected data typically grows with the number of processors, so I/O and trace storage costs increase. A new technique is presented which modifies the executable code to dynamically collect the address trace from the user code and analyzes this trace during the execution of the program. This method helps resolve the I/O and storage problems and facilitates parallel analysis of the address trace. If a trace stored on disk is desired, the generated trace information can also be written to files during execution, with a resultant drop in program execution speed. An initial implementation on the Intel iPSC/2 hypercube multicomputer is detailed, and sample simulation results are presented. The effect of this trace collection method on execution time is illustrated.

Stunkel, Craig B.↗