Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel algorithms”

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,081 records · Page 60
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Approximate algorithms for partitioning and assignment problems

The problem of optimally assigning the modules of a parallel/pipelined program over the processors of a multiple computer system under certain restrictions on the interconnection structure of the program as well as the multiple computer system was considered. For a variety of such programs it is possible to find linear time if a partition of the program exists in which the load on any processor is within a certain bound. This method, when combined with a binary search over a finite range, provides an approximate solution to the partitioning problem. The specific problems considered were: a chain structured parallel program over a chain-like computer system, multiple chain-like programs over a host-satellite system, and a tree structured parallel program over a host-satellite system. For a problem with m modules and n processors, the complexity of the algorithm is no worse than O(mnlog(W sub T/epsilon)), where W sub T is the cost of assigning all modules to one processor and epsilon the desired accuracy.

Iqbal, M. A.↗
NASA NTRS1988

Spectral element methods: Algorithms and architectures

Spectral element methods are high-order weighted residual techniques for partial differential equations that combine the geometric flexibility of finite element methods with the rapid convergence of spectral techniques. Spectral element methods are described for the simulation of incompressible fluid flows, with special emphasis on implementation of spectral element techniques on medium-grained parallel processors. Two parallel architectures are considered: the first, a commercially available message-passing hypercube system; the second, a developmental reconfigurable architecture based on Geometry-Defining Processors. High parallel efficiency is obtained in hypercube spectral element computations, indicating that load balancing and communication issues can be successfully addressed by a high-order technique/medium-grained processor algorithm-architecture coupling.

Fischer, Paul↗
NASA NTRS1988

Spectral element methods - Algorithms and architectures

Spectral element methods are high-order weighted residual techniques for partial differential equations that combine the geometric flexibility of finite element methods with the rapid convergence of spectral techniques. Spectral element methods are described for the simulation of incompressible fluid flows, with special emphasis on implementation of spectral element techniques on medium-grained parallel processors. Two parallel architectures are considered; the first, a commercially available message-passing hypercube system; the second, a developmental reconfigurable architecture based on Geometry-Defining Processors. High parallel efficiency is obtained in hypercube spectral element computations, indicating that load balancing and communication issues can be successfully addressed by a high-order technique/medium-grained processor algorithm-architecture coupling.

Fischer, Paul↗
NASA NTRS1995

Slices: A Scalable Partitioner for Finite Element Meshes

A parallel partitioner for partitioning unstructured finite element meshes on distributed memory architectures is developed. The element based partitioner can handle mixtures of different element types. All algorithms adopted in the partitioner are scalable, including a communication template for unpredictable incoming messages, as shown in actual timing measurements.

partitioner finite element meshes parallel computi↗
DOE OSTI2025

Individual and Simultaneous Imaging of ⁹⁹mTc and ¹⁷⁷Lu With a Preclinical Broad Energy-Spectrum CZT-Based SPECT

Radiopharmaceutical therapy has demonstrated a high efficacy in the treatment of various tumor types. One of the radionuclides already used in the clinic is 177Lu, a beta emitter that also emits several photons imageable with SPECT. Quantitative imaging of 177Lu is critical for developing new radiopharmaceuticals. Energy resolution is an important factor when imaging multiple photon emissions. Solid-state detectors offer a superior performance over scintillators, that are commonly used in commercially-available preclinical SPECT scanners. This study demonstrates the feasibility of 99m Tc and 177Lu quantitative imaging in mouse phantoms, individually and simultaneously, with a SPECT prototype built with four CdZnTe (CZT) detector heads and a custom-designed and energy-optimized parallel-hole tungsten collimator. With a custom implementation of the one-step late (OSL) image reconstruction algorithm, the system is capable of imaging energies from ~70 keV to 250 keV. Above 250 keV, images were significantly affected by septal penetration, consistent with the collimator design. A recovery coefficient within 25% was obtained for activities as low as 2 kBq/mL for 99m Tc and 45% for 177Lu. Compared to a commercial NaI-based preclinical SPECT (VECTor4/CT), our prototype showed a superior energy resolution (< 5% at 140 keV), a similar uniformity with a high-compact design.

Encarnação, Pedro M C C↗
NASA NTRS1982

The finite element machine: An experiment in parallel processing

The finite element machine is a prototype computer designed to support parallel solutions to structural analysis problems. The hardware architecture and support software for the machine, initial solution algorithms and test applications, and preliminary results are described.

Storaasli, O. O.↗
NASA NTRS1982

the finite element machine: An experiment in parallel processing

The Finite Element Machine at the NASA Langley Research Center is a prototype computer designed to support parallel solutions to structural analysis problems. The hardware architecture and support software for the machine, initial solution algorithms and test applications, and preliminary results are described. Directions for future work are presented.

Storaasli, O. O.↗
NASA NTRS1984

Aerothermal loads analysis for high speed flow over a quilted surface configuration

Attention is given to hypersonic laminar flow over a quilted surface configuration that simulates an array of Space Shuttle Thermal Protection System panels bowed in a spherical shape as a result of thermal gradient through the panel thickness. Pressure and heating loads to the surface are determined. The flow field over the configuration was mathematically modeled by means of time-dependent, three-dimensional conservation of mass, momentum, and energy equations. A boundary mapping technique was then used to obtain a rectangular, parallel piped computational domain, and an explicit MacCormack (1972) explicit time-split predictor corrector finite difference algorithm was used to obtain steady state solutions. Total integrated heating loads vary linearly with bowed height when this value does not exceed the local boundary layer thickness.

Olsen, G. C.↗
NASA NTRS1987

Numerical simulations of aerodynamic contribution of flows about a space-plane-type configuration

The slightly supersonic viscous flow about the space-plane under development at the National Aerospace Laboratory (NAL) in Japan was simulated numerically using the LU-ADI algorithm. The wind-tunnel testing for the same plane also was conducted with the computations in parallel. The main purpose of the simulation is to capture the phenomena which have a great deal of influence to the aerodynamic force and efficiency but is difficult to capture by experiments. It includes more accurate representation of vortical flows with high angles of attack of an aircraft. The space-plane shape geometry simulated is the simplified model of the real space-plane, which is a combination of a flat and slender body and a double-delta type wing. The comparison between experimental results and numerical ones will be done in the near future. It could be said that numerical results show the qualitatively reliable phenomena.

Matsushima, Kisa↗
NASA NTRS1988

Adaptive independent joint control of manipulators - Theory and experiment

The author presents a simple decentralized adaptive control scheme for multijoint robot manipulators based on the independent joint control concept. The proposed control scheme for each joint consists of a PID (proportional integral and differential) feedback controller and a position-velocity-acceleration feedforward controller, both with adjustable gains. The static and dynamic couplings that exist between the joint motions are compensated by the adaptive independent joint controllers while ensuring trajectory tracking. The proposed scheme is implemented on a MicroVAX II computer for motion control of the first three joints of a PUMA 560 arm. Experimental results are presented to demonstrate that trajectory tracking is achieved despite strongly coupled, highly nonlinear joint dynamics. The results confirm that the proposed decentralized adaptive control of manipulators is feasible, in spite of strong interactions between joint motions. The control scheme presented is computationally very fast and is amenable to parallel processing implementation within a distributed computing architecture, where each joint is controlled independently by a simple algorithm on a dedicated microprocessor.

Seraji, H.↗
NASA NTRS1994

Scheduling with genetic algorithms

In many domains, scheduling a sequence of jobs is an important function contributing to the overall efficiency of the operation. At Boeing, we develop schedules for many different domains, including assembly of military and commercial aircraft, weapons systems, and space vehicles. Boeing is under contract to develop scheduling systems for the Space Station Payload Planning System (PPS) and Payload Operations and Integration Center (POIC). These applications require that we respect certain sequencing restrictions among the jobs to be scheduled while at the same time assigning resources to the jobs. We call this general problem scheduling and resource allocation. Genetic algorithms (GA's) offer a search method that uses a population of solutions and benefits from intrinsic parallelism to search the problem space rapidly, producing near-optimal solutions. Good intermediate solutions are probabalistically recombined to produce better offspring (based upon some application specific measure of solution fitness, e.g., minimum flowtime, or schedule completeness). Also, at any point in the search, any intermediate solution can be accepted as a final solution; allowing the search to proceed longer usually produces a better solution while terminating the search at virtually any time may yield an acceptable solution. Many processes are constrained by restrictions of sequence among the individual jobs. For a specific job, other jobs must be completed beforehand. While there are obviously many other constraints on processes, it is these on which we focussed for this research: how to allocate crews to jobs while satisfying job precedence requirements and personnel, and tooling and fixture (or, more generally, resource) requirements.

Fennel, Theron R.↗
NASA NTRS1995

Cascaded VLSI neural network architecture for on-line learning

High-speed, analog, fully-parallel and asynchronous building blocks are cascaded for larger sizes and enhanced resolution. A hardware-compatible algorithm permits hardware-in-the-loop learning despite limited weight resolution. A comparison-intensive feature classification application has been demonstrated with this flexible hardware and new algorithm at high speed. This result indicates that these building block chips can be embedded as application-specific-coprocessors for solving real-world problems at extremely high data rates.

Duong, Tuan A.↗
NASA NTRS1997

Fully Threaded Tree for Adaptive Refinement Fluid Dynamics Simulations

A fully threaded tree (FTT) for adaptive refinement of regular meshes is described. By using a tree threaded at all levels, tree traversals for finding nearest neighbors are avoided. All operations on a tree including tree modifications are O(N), where N is a number of cells, and are performed in parallel. An efficient implementation of the tree is described that requires 2N words of memory. A filtering algorithm for removing high frequency noise during mesh refinement is described. A FTT can be used in various numerical applications. In this paper, it is applied to the integration of the Euler equations of fluid dynamics. An adaptive mesh time stepping algorithm is described in which different time steps are used at different l evels of the tree. Time stepping and mesh refinement are interleaved to avoid extensive buffer layers of fine mesh which were otherwise required ahead of moving shocks. Test examples are presented, and the FTT performance is evaluated. The three dimensional simulation of the interaction of a shock wave and a spherical bubble is carried out that shows the development of azimuthal perturbations on the bubble surface.

FINITE ELEMENT ANALYSIS↗
NASA NTRS2002

An Efficient Scheme for Updating Sparse Cholesky Factors

Raghavan had earlier developed the software package DCSPACK which can be used for solving sparse linear systems where the coefficient matrix is symmetric and positive definite (this project was not funded by NASA but by agencies such as NSF). DSCPACK-S is the serial code and DSCPACK-P is a parallel implementation suitable for multiprocessors or networks-of-workstations with message passing using MCI. The main algorithm used is the Cholesky factorization of a sparse symmetric positive positive definite matrix A = LL(T). The code can also compute the factorization A = LDL(T). The complexity of the software arises from several factors relating to the sparsity of the matrix A. A sparse N x N matrix A has typically less that cN nonzeroes where c is a small constant. If the matrix were dense, it would have O(N2) nonzeroes. The most complicated part of such sparse Cholesky factorization relates to fill-in, i.e., zeroes in the original matrix that become nonzeroes in the factor L. An efficient implementation depends to a large extent on complex data structures and on techniques from graph theory to reduce, identify, and manage fill. DSCPACK is based on an efficient multifrontal implementation with fill-managing algorithms and implementation arising from earlier research by Raghavan and others. Sparse Cholesky factorization is typically a four step process: (1) ordering to compute a fill-reducing numbering, (2) symbolic factorization to determine the nonzero structure of L, (3) numeric factorization to compute L, and, (4) triangular solution to solve L(T)x = y and Ly = b. The first two steps are symbolic and are performed using the graph of the matrix. The numeric factorization step is of dominant cost and there are several schemes for improving performance by exploiting the nested and dense structure of groups of columns in the factor. The latter are aimed at better utilization of the cache-memory hierarchy on modem processors to prevent cache-misses and provide execution rates (operations/second) that are close to the peak rates for dense matrix computations. Currently, EPISCOPACY is being used in an application at NASA directed by J. Newman and M. James. We propose the implementation of efficient schemes for updating the LL(T) or LDL(T) factors computed in DSCPACK-S to meet the computational requirements of their project. A brief description is provided in the next section.

Raghavan, Padma↗
NASA NTRS2003

The Electric Propulsion Interactions Code (EPIC): A Member of the NASA Space Environment and Effects Program (SEE) Toolset

Science Applications International Corporation is currently developing the Electric Propulsion Interactions Code, EPIC, as part of a project sponsored by the Space Environments and Effects Program at NASA Marshall Space Flight Center. Now in its second year of development, EPIC is an interactive computer toolset that allows the construction of a 3-D spacecraft model, and the assessment of a variety of interactions between its subsystems and the plume from an electric thruster. This paper reports on the progress of EPZC including the recently added ability to exchange results the NASA Charging Analyzer Program, Nascap-2k. The capability greatly enhances EPIC's range of applicability. Expansion of the toolset's various physics models proceeds in parallel with the overall development of the software. Also presented are recent upgrades of the elastic scattering algorithm in the electric propulsion Plume Tool. These upgrades are motivated by the need to assess the effects of elastically scattered ions on the SIC for ion beam energies that exceed loo0 eV. Such energy levels are expected in future high-power (>10 kW) ion propulsion systems empowered by nuclear sources.

Mikellides, Ioannis G.↗
DOE OSTI2024

Optimization and Experimental Validation of Annular Finned PCM-HX for a Domestic Hot Water Heater Application

The load profile for domestic water heating is time-dependent and can result in high energy demand during peak operating times. Shifting this peak load can have significant environmental and economic impacts. Phase change material (PCM)-based thermal energy storage (TES) is a potentially useful technology for peak load shifting in domestic hot water (DHW) applications thanks to its high latent heat and energy density. In this study, an annular finned-tube PCM-HX design concept was optimized for a load-shifting TES unit to meet the Department of Energy standard for a medium-usage DHW heater using a resistance-capacitance model (RCM) integrated with a Multi-Objective Genetic Algorithm. The optimized design comprised 70 identical annular finned-tube PCM-HX units connected in parallel and utilizing RT62HC as the PCM. A single PCM-HX unit was prototyped and tested in a vertically oriented setup with upward heat transfer fluid (HTF) flow. The hot water supply time was defined based on a cutoff temperature of 51.7°C. The as-designed mass flow rate (1.5 g/s) was tested to assess the performance of the prototyped PCM-HX unit for RCM validation. For the experimental investigation, RTD sensor bundles measured HTF temperature at the PCM-HX inlet and outlet, and a Coriolis flow meter accurately measured the HTF mass flow rate. The simulated discharging power underpredicted the experimental result by about 12%, and the simulated hot water supply time underpredicted the experimental result by approximately 13% for the as-designed mass flow rate (1.5 g/s). The average deviation of the hot water supply temperature between the experimental and RCM results during the complete PCM solidification process was 1.3 K for the as-designed mass flow rate. The overall good agreement between the experimental and RCM results provides confidence that computationally efficient models such as RCM can be utilized for design optimization of PCM-HXs.

42 ENGINEERING↗
DOE OSTI2025

OpenSn: A massively parallel, open-source simulation environment for discrete ordinates radiation transport

OpenSn is an open-source, massively parallel deterministic radiation transport code for solving the discrete-ordinates ( S N ) form of the Boltzmann transport equation on unstructured, arbitrary polyhedral meshes. It supports high-fidelity simulations involving steady-state, eigenvalue, and adjoint problems for neutral particles (e.g., neutrons, photons, multi-particles), using the multigroup approximation in energy. OpenSn combines angular discretization via discrete ordinates with a discontinuous Galerkin finite element method (DGFEM) in space, enabling accurate resolution of transport physics on arbitrary polyhedral cells, included locally refined spatial grids. It includes multiple angular quadrature types, including locally refined angular quadratures. Written in modern C++ with a Python API, OpenSn runs efficiently on platforms ranging from laptops to supercomputers. The transport sweep algorithm is implemented using a task-based, directed-acyclic-graph (DAG) approach for each angle and supports asynchronous parallelism across thousands of MPI ranks. Group-set aggregation improves compute intensity, and synthetic acceleration techniques (e.g., diffusion synthetic acceleration, second-moment method) enhance solver convergence. OpenSn has been verified on reactor physics problems and demonstrated excellent weak and strong scaling performance on more than 32,768 processes, making it a versatile and robust platform for large-scale transport simulations in complex geometries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗