Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “parallel systems”

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 469 records · Page 26
All sourcesNASA NTRSDOE OSTI
NASA NTRS1996

An MPA-IO interface to HPSS

This paper describes an implementation of the proposed MPI-IO (Message Passing Interface - Input/Output) standard for parallel I/O. Our system uses third-party transfer to move data over an external network between the processors where it is used and the I/O devices where it resides. Data travels directly from source to destination, without the need for shuffling it among processors or funneling it through a central node. Our distributed server model lets multiple compute nodes share the burden of coordinating data transfers. The system is built on the High Performance Storage System (HPSS), and a prototype version runs on a Meiko CS-2 parallel computer.

Jones, Terry↗
NASA NTRS1996

An MPI-IO Interface to HPSS

This paper describes an implementation of the proposed MPI-IO standard for parallel I/O. Our system uses third-party transfer to move data over an external network between the processors where it is used and the I/O devices where it resides. Data travels directly from source to destination, without the need for shuffling it among processors or funneling it through a central node. Our distributed server model lets multiple compute nodes share the burden of coordinating data transfers. The system is built on the High Performance Storage System (HPSS), and a prototype version runs on a Meiko CS-2 parallel computer.

Parallel Processing↗
NASA NTRSDate not supplied

NASA Aeronautics Sustainable Aviation Overview

We live in challenging but exciting times for aviation as the sector continues to emerge from the unprecedented impact of a global pandemic while addressing its contribution to global warming. This perfect storm provides opportunity and the drivers that can lead to the most substantial changes the aviation sector has seen since the convergence of jet engines and swept wings over 60 years ago. The reality is we are entering the dawn of a new era of sustainable aviation full of opportunities and challenges that must economically address the health and transportation needs of society with unprecedentedly low impact on local, regional, and global environments. Today, commercial aviation physically connects countries across the globe and is an integral, critical part of today’s expanding global economy. Commercial aviation relies almost entirely on subsonic transport aircraft to constantly move people and goods from one place to another across the globe. While an effective means of transportation providing an unmatched combination of payload, speed, and range, future subsonic aircraft must continue to improve to meet efficiency, environmental, and economic goals established around the world to sustain the substantial growth projected in this well-established market. Commercial supersonic transports have come and gone in the global market, but they are on the verge of reemerging. Vertical lift vehicles leveraging breakthroughs in autonomous systems and electrified propulsion are positioned for massive growth in local and regional markets leading to daily flights within metropolitan areas that may exceed that across countries. To succeed, these new aircraft must be sustainable from day 1. NASA Aeronautics has a long history of contributions to aviation, and today it continues to address the challenge of sustainable growth of the traditional air transportation system through the research and development of systems and technologies for future aircraft and airspace operations. Research programs over the last decade have set the stage to demonstrate key technologies offering step-change performance and environmental impact. Through a Sustainable Flight National Partnership, NASA will partner with industry, academia, and other government agencies to demonstrate the most promising technologies during the 2020s to enable revolutionary systems in the early 2030s. In parallel, NASA will explore systems and technologies for further benefits approaching zero environmental impact beyond the 2030s. Similarly, NASA programs are addressing the challenges of emerging markets enabled by vertical take-off/landing and low-boom supersonic cruise. This oral-only presentation will focus on opportunities and challenges in the traditional subsonic transport while touching on emerging vertical lift and supersonic commercial aviation markets. NASA’s recent contributions, ongoing research, and plans for sustainable aviation will be discussed, including airframe, propulsion, and integrated vehicle systems and technologies.

James A. Kenyon↗
NASA NTRS2024

High Reliability at Minimum Cost

This paper investigates the minimum cost of improving the reliability of complex technical systems. The two major methods to improve reliability are redesigning the system for higher reliability or providing redundant components to replace failed elements. The costs of redesign for reliability or adding redundancy are estimated. The most cost-effective combination for high reliability can be identified. The cost of increasing the intrinsic reliability of a system can be modeled as cost proportional to 1/(system failure rate) a , where the exponent “a” measures the difficulty of increasing reliability. The “a” exponent can vary from 0.25 to about 2.5. Operational reliability can also be increased by using redundant systems. The failure rate for N parallel redundant units is (system failure rate) N . The cost of redundancy is N times the system cost. The total redundant system cost is proportional to N/(system failure rate) a . The cost of redundancy increases as N gets larger, but larger N allows a higher system failure rate, which reduces the system design cost. There is a certain N, a certain level of redundancy, that has the minimum cost to achieve the required overall redundant system failure rate. The minimum cost for the redundant system is achieved at the optimum level of redundancy. The N for minimum cost is equal to -a ln (redundant system failure rate). The minimum cost of the N redundant systems is proportional to N * (original system failure rate) a . The optimum redesigned individual system failure rate is proportional to exp (-1/a), so the greater the difficulty, the higher the optimum individual system failure rate. Increasing the intrinsic reliability of a system encounters diminishing returns and at some point it becomes more cost-effective to add redundancy. The difficulty of increasing intrinsic system reliability determines the optimum design for high reliability at minimum cost.

reliability↗
NASA NTRSDate not supplied

High Reliability at Minimum Cost

This paper investigates the minimum cost of improving the reliability of complex technical systems. The two major methods to improve reliability are redesigning the system for higher reliability or providing redundant components to replace failed elements. The costs of redesign for reliability or adding redundancy are estimated. The most cost-effective combination for high reliability can be identified. The cost of increasing the intrinsic reliability of a system can be modeled as cost proportional to 1/(system failure rate) a , where the exponent “a” measures the difficulty of increasing reliability. The “a” exponent can vary from 0.25 to about 2.5. Operational reliability can also be increased by using redundant systems. The failure rate for N parallel redundant units is (system failure rate) N . The cost of redundancy is N times the system cost. The total redundant system cost is proportional to N/(system failure rate) a . The cost of redundancy increases as N gets larger, but larger N allows a higher system failure rate, which reduces the system design cost. There is a certain N, a certain level of redundancy, that has the minimum cost to achieve the required overall redundant system failure rate. The minimum cost for the redundant system is achieved at the optimum level of redundancy. The N for minimum cost is equal to -a ln (redundant system failure rate). The minimum cost of the N redundant systems is proportional to N * (original system failure rate) a . The optimum redesigned individual system failure rate is proportional to exp (-1/a), so the greater the difficulty, the higher the optimum individual system failure rate. Increasing the intrinsic reliability of a system encounters diminishing returns and at some point it becomes more cost-effective to add redundancy. The difficulty of increasing intrinsic system reliability determines the optimum design for high reliability at minimum cost.

reliability↗
NASA NTRS1990

Learning control system design based on 2-D theory - An application to parallel link manipulator

An approach to iterative learning control system design based on two-dimensional system theory is presented. A two-dimensional model for the iterative learning control system which reveals the connections between learning control systems and two-dimensional system theory is established. A learning control algorithm is proposed, and the convergence of learning using this algorithm is guaranteed by two-dimensional stability. The learning algorithm is applied successfully to the trajectory tracking control problem for a parallel link robot manipulator. The excellent performance of this learning algorithm is demonstrated by the computer simulation results.

Geng, Z.↗
NASA NTRS1993

Parallel methods for dynamic simulation of multiple manipulator systems

In this paper, efficient dynamic simulation algorithms for a system of m manipulators, cooperating to manipulate a large load, are developed; their performance, using two possible forms of parallelism on a general-purpose parallel computer, is investigated. One form, temporal parallelism, is obtained with the use of parallel numerical integration methods. A speedup of 3.78 on four processors of CRAY Y-MP8 was achieved with a parallel four-point block predictor-corrector method for the simulation of a four manipulator system. These multi-point methods suffer from reduced accuracy, and when comparing these runs with a serial integration method, the speedup can be as low as 1.83 for simulations with the same accuracy. To regain the performance lost due to accuracy problems, a second form of parallelism is employed. Spatial parallelism allows most of the dynamics of each manipulator chain to be computed simultaneously. Used exclusively in the four processor case, this form of parallelism in conjunction with a serial integration method results in a speedup of 3.1 on four processors over the best serial method. In cases where there are either more processors available or fewer chains in the system, the multi-point parallel integration methods are still advantageous despite the reduced accuracy because both forms of parallelism can then combine to generate more parallel tasks and achieve greater effective speedups. This paper also includes results for these cases.

Mcmillan, Scott↗
NASA NTRS1975

Remote sensing applications for urban planning - The LUMIS project

The Santa Monica mountains of Los Angeles consist primarily of complexly folded sedimentary marine strata with igneous and metamorphic rocks at the eastern end of the mountains. With the increased development of the Santa Monicas, a study was conducted to determine the critical land use data items in the mountains. Two information systems developed in parallel are described. One capitalizes on the City's present computer line printer system, and the second utilizes map overlay techniques on an interactive computer terminal. Results concerning population, housing, and land improvement illustrate the successful linking of ordinal and nominal data files in the interactive system.-

Paul, C. K.↗
NASA NTRS2005

Serial Back-Plane Technologies in Advanced Avionics Architectures

Current back plane technologies such as VME, and current personal computer back planes such as PCI, are shared bus systems that can exhibit nondeterministic latencies. This means a card can take control of the bus and use resources indefinitely affecting the ability of other cards in the back plane to acquire the bus. This provides a real hit on the reliability of the system. Additionally, these parallel busses only have bandwidths in the 100s of megahertz range and EMI and noise effects get worse the higher the bandwidth goes. To provide scalable, fault-tolerant, advanced computing systems, more applicable to today s connected computing environment and to better meet the needs of future requirements for advanced space instruments and vehicles, serial back-plane technologies should be implemented in advanced avionics architectures. Serial backplane technologies eliminate the problem of one card getting the bus and never relinquishing it, or one minor problem on the backplane bringing the whole system down. Being serial instead of parallel improves the reliability by reducing many of the signal integrity issues associated with parallel back planes and thus significantly improves reliability. The increased speeds associated with a serial backplane are an added bonus.

Varnavas, Kosta↗
NASA NTRS1991

Algorithmically Specialized Parallel Architecture For Robotics

Computing system called Robot Mathematics Processor (RMP) contains large number of processor elements (PE's) connected in various parallel and serial combinations reconfigurable via software. Special-purpose architecture designed for solving diverse computational problems in robot control, simulation, trajectory generation, workspace analysis, and like. System an MIMD-SIMD parallel architecture capable of exploiting parallelism in different forms and at several computational levels. Major advantage lies in design of cells, which provides flexibility and reconfigurability superior to previous SIMD processors.

Fijany, Amir↗
NASA NTRS1996

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load imbalance among processors on a parallel machine. This paper describes the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution cost is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35% of the mesh is randomly adapted. For large-scale scientific computations, our load balancing strategy gives almost a sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remapper yields processor assignments that are less than 3% off the optimal solutions but requires only 1% of the computational time.

Biswas, Rupak↗
NASA NTRS1996

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaptation on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load inbalances among processors on a parallel machine. This paper described the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution coast is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35 percent of the mesh is randomly adapted. For large scale scientific computations, our load balancing strategy gives an almost sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remappier yields processor assignments that are less than 3 percent of the optimal solutions, but requires only 1 percent of the computational time.

Biswas, Rupak↗
NASA NTRS1995

Three-dimensional object tracking system and method employing plural sensors and plural processors for performing parallel processing

A multiple sensor/multiple processor 3-D tracking system includes multiple sensor (camera) and DSP combinations and a controller connected so as to create a parallel computer from the multiple DSPs. The camera/DSP combinations and the controller are connected together to form a ring. For 3-D position measurement and tracking applications, each camera/DSP combination is programmed with an identical program to function as a node in a true parallel computer, and the transformation equations are solved in a distributed fashion using the entire parallel machine. The distributed processor processes the camera x and y point measurements in a distributed and parallel fashion to yield a solution to the coordinate transformation equations much more quickly than is possible with multiple camera/DSP combinations and a single processor.

Welch, Sharon S.↗
NASA NTRS1993

New computing systems, future computing environment, and their implications on structural analysis and design

Recent advances in computer technology that are likely to impact structural analysis and design of flight vehicles are reviewed. A brief summary is given of the advances in microelectronics, networking technologies, and in the user-interface hardware and software. The major features of new and projected computing systems, including high performance computers, parallel processing machines, and small systems, are described. Advances in programming environments, numerical algorithms, and computational strategies for new computing systems are reviewed. The impact of the advances in computer technology on structural analysis and the design of flight vehicles is described. A scenario for future computing paradigms is presented, and the near-term needs in the computational structures area are outlined.

Noor, Ahmed K.↗
NASA NTRS1994

Design considerations for parallel graphics libraries

Applications which run on parallel supercomputers are often characterized by massive datasets. Converting these vast collections of numbers to visual form has proven to be a powerful aid to comprehension. For a variety of reasons, it may be desirable to provide this visual feedback at runtime. One way to accomplish this is to exploit the available parallelism to perform graphics operations in place. In order to do this, we need appropriate parallel rendering algorithms and library interfaces. This paper provides a tutorial introduction to some of the issues which arise in designing parallel graphics libraries and their underlying rendering algorithms. The focus is on polygon rendering for distributed memory message-passing systems. We illustrate our discussion with examples from PGL, a parallel graphics library which has been developed on the Intel family of parallel systems.

Crockett, Thomas W.↗
NASA NTRS1990

DSIM: A distributed simulator

Discrete event-driven simulation makes it possible to model a computer system in detail. However, such simulation models can require a significant time to execute. This is especially true when modeling large parallel or distributed systems containing many processors and a complex communication network. One solution is to distribute the simulation over several processors. If enough parallelism is achieved, large simulation models can be efficiently executed. This study proposes a distributed simulator called DSIM which can run on various architectures. A simulated test environment is used to verify and characterize the performance of DSIM. The results of the experiments indicate that speedup is application-dependent and, in DSIM's case, is also dependent on how the simulation model is distributed among the processors. Furthermore, the experiments reveal that the communication overhead of ethernet-based distributed systems makes it difficult to achieve reasonable speedup unless the simulation model is computation bound.

Goswami, Kumar K.↗