Search NASA⌕ Search

SEARCH · Search NASA

Results for “Computer applications”

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,801 records · Page 100

A gridless Euler/Navier-Stokes solution algorithm for complex two-dimensional applications

The development of a gridless computational fluid dynamics (CFD) method for the solution of the two-dimensional Euler and Navier-Stokes equations is described. The method uses only clouds of points and does not require that the points be connected to form a grid as is necessary in conventional CFD algorithms. The gridless CFD approach appears to resolve the problems and inefficiencies encountered with structured or unstructured grid methods. As a result, the method offers the greatest potential for accurately and efficiently solving viscous flows about complex aircraft configurations. The method is described in detail, and calculations are presented for standard Euler and Navier-Stokes cases to assess the accuracy and efficiency of the capability.

Batina, John T.↗

A gridless Euler/Navier-Stokes solution algorithm for complex-aircraft applications

The development of a gridless computational fluid dynamics (CFD) method for the solution of the two- and three-dimensional Euler and Navier-Stokes equations is described. The method uses only clouds of points and does not require that the points be connected to form a grid as is necessary in conventional CFD algorithms. The gridless CFD approach appears to resolve the inefficiencies encountered with structured or unstructured grid methods, and consequently offers great potential for accurately and efficiently solving viscous flows about complex aircraft configurations. The method is described in detail and calculations are presented for standard Euler and Navier-Stokes cases to assess the accuracy and efficiency of the capability.

Batina, John T.↗

Aerodynamic design of turbomachinery blading in three-dimensional flow - An application to radial inflow turbines

A computational method, based on a theory for turbomachinery blading design in three-dimensional inviscid flow, is applied to a parametric design study of a radial inflow turbine wheel. As the method requires the specification of swirl distribution, a technique for its smooth generation within the blade region is proposed. Excellent agreements have been obtained between the computed results from this design method and those from direct Euler computations, demonstrating the correspondence and consistency between the two. The computed results indicate the sensitivity of the pressure distribution to a lean in the stacking axis and a minor alteration in the hub/shroud profiles. Analysis based on Navier-Stokes solver shows no breakdown of flow within the designed blade passage and agreement with that from design calculation; thus the flow in the designed turbine rotor closely approximates that of an inviscid one. These calculations illustrate the use of a design method coupled to an analysis tool for establishing guidelines and criteria for designing turbomachinery blading.

Yang, Y. L.↗

A gridless Euler/Navier-Stokes solution algorithm for complex-aircraft applications

The development of a gridless computational fluid dynamics (CFD) method for the solution of the two- and three-dimensional Euler and Navier-Stokes equations is described. The method uses only clouds of points and does not require that the points be connected to form a grid as a necessary in conventional CFD algorithms. The gridless CFD approach appears to resolve the inefficiencies encountered with structured or unstructured grid methods, and consequently offers great potential for accurately and efficiently solving viscous flows about complex aircraft configurations. The method is described in detail and calculations are presented for standard Euler and Navier-Stokes cases to assess the accuracy and efficiency of the capability.

Batina, John T.↗

An object-oriented approach for parallel self adaptive mesh refinement on block structured grids

Self-adaptive mesh refinement dynamically matches the computational demands of a solver for partial differential equations to the activity in the application's domain. In this paper we present two C++ class libraries, P++ and AMR++, which significantly simplify the development of sophisticated adaptive mesh refinement codes on (massively) parallel distributed memory architectures. The development is based on our previous research in this area. The C++ class libraries provide abstractions to separate the issues of developing parallel adaptive mesh refinement applications into those of parallelism, abstracted by P++, and adaptive mesh refinement, abstracted by AMR++. P++ is a parallel array class library to permit efficient development of architecture independent codes for structured grid applications, and AMR++ provides support for self-adaptive mesh refinement on block-structured grids of rectangular non-overlapping blocks. Using these libraries, the application programmers' work is greatly simplified to primarily specifying the serial single grid application and obtaining the parallel and self-adaptive mesh refinement code with minimal effort. Initial results for simple singular perturbation problems solved by self-adaptive multilevel techniques (FAC, AFAC), being implemented on the basis of prototypes of the P++/AMR++ environment, are presented. Singular perturbation problems frequently arise in large applications, e.g. in the area of computational fluid dynamics. They usually have solutions with layers which require adaptive mesh refinement and fast basic solvers in order to be resolved efficiently.

Lemke, Max↗

Microphysical Timescales in Clouds and their Application in Cloud-Resolving Modeling

Computational phenomena (i.e., spurious supersaturation and negative mixing ratio of cloud water) usually exist in cloud-resolving models when the time step for explicit integration is larger than a microphysical timescale in clouds. In this paper, the microphysical timescales in clouds are studied, showing that the timescale of water vapor condensation (or cloud water evaporation) is smaller than 10 s - the order of a typical time step for cloud-resolving models. To avoid spurious computational phenomena in cloud-resolving modeling, it is suggested that moist entropy be used as a prognostic thermodynamic variable, and temperature be diagnosed from that and other prognostic variables. A simple numerical model with moist entropy as a prognostic variable, for example, is presented to show that spurious computational phenomena are removed when moist entropy is used as a prognostic variable.

Zeng, Xi-Ping↗

Symbol Tables and Branch Tables: Linking Applications Together

This document explores the computer techniques used to execute software whose parts are compiled and linked separately. The computer techniques include using a branch table or indirect address table to connect the parts. Methods of storing the information in data structures are discussed as well as differences between C and C++.

Handler, Louis M.↗

Fault-Tolerant, Radiation-Hard DSP

Commercial digital signal processors (DSPs) for use in high-speed satellite computers are challenged by the damaging effects of space radiation, mainly single event upsets (SEUs) and single event functional interrupts (SEFIs). Innovations have been developed for mitigating the effects of SEUs and SEFIs, enabling the use of very-highspeed commercial DSPs with improved SEU tolerances. Time-triple modular redundancy (TTMR) is a method of applying traditional triple modular redundancy on a single processor, exploiting the VLIW (very long instruction word) class of parallel processors. TTMR improves SEU rates substantially. SEFIs are solved by a SEFI-hardened core circuit, external to the microprocessor. It monitors the health of the processor, and if a SEFI occurs, forces the processor to return to performance through a series of escalating events. TTMR and hardened-core solutions were developed for both DSPs and reconfigurable field-programmable gate arrays (FPGAs). This includes advancement of TTMR algorithms for DSPs and reconfigurable FPGAs, plus a rad-hard, hardened-core integrated circuit that services both the DSP and FPGA. Additionally, a combined DSP and FPGA board architecture was fully developed into a rad-hard engineering product. This technology enables use of commercial off-the-shelf (COTS) DSPs in computers for satellite and other space applications, allowing rapid deployment at a much lower cost. Traditional rad-hard space computers are very expensive and typically have long lead times. These computers are either based on traditional rad-hard processors, which have extremely low computational performance, or triple modular redundant (TMR) FPGA arrays, which suffer from power and complexity issues. Even more frustrating is that the TMR arrays of FPGAs require a fixed, external rad-hard voting element, thereby causing them to lose much of their reconfiguration capability and in some cases significant speed reduction. The benefits of COTS high-performance signal processing include significant increase in onboard science data processing, enabling orders of magnitude reduction in required communication bandwidth for science data return, orders of magnitude improvement in onboard mission planning and critical decision making, and the ability to rapidly respond to changing mission environments, thus enabling opportunistic science and orders of magnitude reduction in the cost of mission operations through reduction of required staff. Additional benefits of COTS-based, high-performance signal processing include the ability to leverage considerable commercial and academic investments in advanced computing tools, techniques, and infra structure, and the familiarity of the science and IT community with these computing environments.

Czajkowski, David↗

Compute as Fast as the Engineers Can Think! ULTRAFAST COMPUTING TEAM FINAL REPORT

This report documents findings and recommendations by the Ultrafast Computing Team (UCT). In the period 10-12/98, UCT reviewed design case scenarios for a supersonic transport and a reusable launch vehicle to derive computing requirements necessary for support of a design process with efficiency so radically improved that human thought rather than the computer paces the process. Assessment of the present computing capability against the above requirements indicated a need for further improvement in computing speed by several orders of magnitude to reduce time to solution from tens of hours to seconds in major applications. Evaluation of the trends in computer technology revealed a potential to attain the postulated improvement by further increases of single processor performance combined with massively parallel processing in a heterogeneous environment. However, utilization of massively parallel processing to its full capability will require redevelopment of the engineering analysis and optimization methods, including invention of new paradigms. To that end UCT recommends initiation of a new activity at LaRC called Computational Engineering for development of new methods and tools geared to the new computer architectures in disciplines, their coordination, and validation and benefit demonstration through applications.

Biedron, R. T.↗

Implementing Multidisciplinary and Multi-Zonal Applications Using MPI

Multidisciplinary and multi-zonal applications are an important class of applications in the area of Computational Aerosciences. In these codes, two or more distinct parallel programs or copies of a single program are utilized to model a single problem. To support such applications, it is common to use a programming model where a program is divided into several single program multiple data stream (SPMD) applications, each of which solves the equations for a single physical discipline or grid zone. These SPMD applications are then bound together to form a single multidisciplinary or multi-zonal program in which the constituent parts communicate via point-to-point message passing routines. Unfortunately, simple message passing models, like Intel's NX library, only allow point-to-point and global communication within a single system-defined partition. This makes implementation of these applications quite difficult, if not impossible. In this report it is shown that the new Message Passing Interface (MPI) standard is a viable portable library for implementing the message passing portion of multidisciplinary applications. Further, with the extension of a portable loader, fully portable multidisciplinary application programs can be developed. Finally, the performance of MPI is compared to that of some native message passing libraries. This comparison shows that MPI can be implemented to deliver performance commensurate with native message libraries.

Fineberg, Samuel A.↗

MPIRUN: A Portable Loader for Multidisciplinary and Multi-Zonal Applications

Multidisciplinary and multi-zonal applications are an important class of applications in the area of Computational Aerosciences. In these codes, two or more distinct parallel programs or copies of a single program are utilized to model a single problem. To support such applications, it is common to use a programming model where a program is divided into several single program multiple data stream (SPMD) applications, each of which solves the equations for a single physical discipline or grid zone. These SPMD applications are then bound together to form a single multidisciplinary or multi-zonal program in which the constituent parts communicate via point-to-point message passing routines. One method for implementing the message passing portion of these codes is with the new Message Passing Interface (MPI) standard. Unfortunately, this standard only specifies the message passing portion of an application, but does not specify any portable mechanisms for loading an application. MPIRUN was developed to provide a portable means for loading MPI programs, and was specifically targeted at multidisciplinary and multi-zonal applications. Programs using MPIRUN for loading and MPI for message passing are then portable between all machines supported by MPIRUN. MPIRUN is currently implemented for the Intel iPSC/860, TMC CM5, IBM SP-1 and SP-2, Intel Paragon, and workstation clusters. Further, MPIRUN is designed to be simple enough to port easily to any system supporting MPI.

Fineberg, Samuel A.↗

Disruptive Technologies and Their Putative Impacts Upon Society and Aerospace- Entering The Virtual Age

Developments in technology over the recent decades have been extraordinary. They include the IT, bio, nano, and now quantum and energetics technology arenas and their many combinatorial interactions and impacts. In the main, these are at the frontiers of the small and in a combinational, synergistic feeding frenzy with each other. They fall under the broad category of Disruptive Technologies and have greatly altered society. The outlook for the runout of these and other technology developments augers mid-term to later alterations in components of the human existence theorem, including the requirement to work for our living and our physiological makeup and longevity (Ref 1). The IT revolution began in the 1950s with the development of solid-state electronics. The biologics revolution began later in the 1960s and 1970s with DNA and genomics, and the nano revolution in the 1990s with self-forming nano systems and carbon nanotubes. Quantum technology is now developing rapidly, aided by enabling nano systems, and the energetics revolution is providing ever more efficient and less expensive renewable energy sources. The IT revolution has produced improvements of an astounding eleven orders of magnitude in computing speed since the late 1950s. As we shift from silicon to biological, optical, nano, molecular, and atomic computing, improvements of some 4 orders of magnitude are evidently possible from either optical or DNA computing [Refs 2and 3], then there are combinatorials. Then there is quantum computing, under development worldwide for an increasing number of applications and proffering phenomenal capabilities. The current fastest computers are considerably beyond human brain speed. Machine intelligence is developing well after decades of inadequate machine capability, now no longer the case, and a detour into expert systems. Researchers in machine intelligence are now pursuing deep learning approaches using neural nets, which are proving to be extremely useful. Some believe the frontier of potential human-level machine intelligence may be found in biomimetics and brain-emulation approaches. There is even a possibility of “emergence”—i.e., when the machine intelligence is complex enough that it “wakes up,” as when human intelligence emerged via evolution during the million-plus years of the hunter-gatherer epoch [ Ref 4]. In fact, some posit that human intelligence can be improved upon and is only a cul-de-sac of what is conceivable. The IT revolution has produced massive changes in human society and economics—from the Internet, enabling the rapid expansion of knowledgeability (and even what is knowable), to an increasingly pervasive trend of “tele-everything.” The extraordinary compilation, storage, and availability of truly massive amounts of information could, when combined with AI and under the mantra of “big data,” greatly improve many of our technical and commercial processes and their content including elucidating new heuristic governing laws.

Dennis M. Bushnell↗

Analytical combustion/emissions research related to the NASA High-Speed Research Program

A combustion analysis program aimed at upgrading and applying advanced computer programs for gas turbine applications is discussed. 2D and 3D codes, KIVA-II and LeRC-3D, have been used to provide insight into the combustion process and combustor design. The computations performed through these codes show their capability to produce reasonable results, despite such deficiencies in the current models as accurate chemical kinetics modeling of hydrocarbon combustion and turbulence and turbulence combustion interaction modeling.

Nguyen, H. L.↗

Stochastic Evolutionary Algorithms for Planning Robot Paths

A computer program implements stochastic evolutionary algorithms for planning and optimizing collision-free paths for robots and their jointed limbs. Stochastic evolutionary algorithms can be made to produce acceptably close approximations to exact, optimal solutions for path-planning problems while often demanding much less computation than do exhaustive-search and deterministic inverse-kinematics algorithms that have been used previously for this purpose. Hence, the present software is better suited for application aboard robots having limited computing capabilities (see figure). The stochastic aspect lies in the use of simulated annealing to (1) prevent trapping of an optimization algorithm in local minima of an energy-like error measure by which the fitness of a trial solution is evaluated while (2) ensuring that the entire multidimensional configuration and parameter space of the path-planning problem is sampled efficiently with respect to both robot joint angles and computation time. Simulated annealing is an established technique for avoiding local minima in multidimensional optimization problems, but has not, until now, been applied to planning collision-free robot paths by use of low-power computers.

Fink, Wolfgang↗

Evaluation of Cache-based Superscalar and Cacheless Vector Architectures for Scientific Computations

The growing gap between sustained and peak performance for scientific applications has become a well-known problem in high performance computing. The recent development of parallel vector systems offers the potential to bridge this gap for a significant number of computational science codes and deliver a substantial increase in computing capabilities. This paper examines the intranode performance of the NEC SX6 vector processor and the cache-based IBM Power3/4 superscalar architectures across a number of key scientific computing areas. First, we present the performance of a microbenchmark suite that examines a full spectrum of low-level machine characteristics. Next, we study the behavior of the NAS Parallel Benchmarks using some simple optimizations. Finally, we evaluate the perfor- mance of several numerical codes from key scientific computing domains. Overall results demonstrate that the SX6 achieves high performance on a large fraction of our application suite and in many cases significantly outperforms the RISC-based architectures. However, certain classes of applications are not easily amenable to vectorization and would likely require extensive reengineering of both algorithm and implementation to utilize the SX6 effectively.

Oliker, Leonid↗

NOR Flash Memory Scrubbing Application for Boot File Preservation of NASA’s Descent and Landing Computer (DLC)

Progress on NASA’s Safe and Precise Landing Integrated Capabilities Evolution (SPLICE)project continues, specifically with this development of the Descent and Landing Computer(DLC). One of the DLC’s primary contributions as a SPLICE technology is its implementationof algorithms and operation of sensors to autonomously guide a spacecraft in performing moreprecise and safer landings on celestial bodies such as the Moon and Mars. The second iterationof the DLC is known as the Engineering Test Unit (ETU) and one of its desired functionalitiesis the ability to preserve the fidelity of the system’s boot file through the use of memoryscrubbing. The ETU has two primary boards, one for housing a Multi-Processor System ona Chip (MPSoC) and the other for housing a Xilinx Kintex Ultrascale FPGA3. To emulate amemory scrubbing function implemented on the ETU’s FPGA board, the design and testingof a software application was performed on a Xilinx KCU105 FPGA evaluation board. Thememory scrubbing application had to meet certain key criteria such as (1) properly utilize withthe flash memory’s Serial Peripheral Interface (SPI) to read, write, and erase flash memoryproperly, (2) be able to detect arbitrarily large or small amounts of bit-errors, (3) be able tocorrect all detected errors, and (4) perform memory scrubbing indefinitely and autonomously.A prototype implementation was constructed and tested, demonstrating successful detectionand correction of bit errors in multiple configurations. In the form of burst errors or singularbit flips, and in amounts of errors ranging from one to fifteen (per 256 Bytes), the applicationwas successful in preserving memory fidelity.

Radiation tolerant↗

Automatic information extraction for land use and agricultural applications

Description of some current work in interpretation technique development for automatic computer-aided image information extraction related to various application areas, including land use mapping and agricultural survey and monitoring. In particular, the application of a fast template matching algorithm, employing the sequential similarity detection principle, to image registration, linear feature detection, and the extraction and enumeration of scene objects is discussed and illustrated.

Bond, A. D.↗

NOR Flash Memory Scrubbing Application for Boot File Preservation of NASA’s Descent and Landing Computer (DLC)

Progress on NASA’s Safe and Precise Landing Integrated Capabilities Evolution (SPLICE) project continues, specifically with this development of the Descent and Landing Computer (DLC). One of the DLC’s primary contributions as a SPLICE technology is its implementation of algorithms and operation of sensors to autonomously guide a spacecraft in performing more precise and safer landings on celestial bodies such as the Moon and Mars [1]. The second iteration of the DLC is known as the Engineering Test Unit (ETU) and one of its desired functionalities is the ability to preserve the fidelity of the system’s boot file through the use of memory scrubbing [2]. The ETU has two primary boards, one for housing a Multi-Processor System on a Chip (MPSoC) and the other for housing a Xilinx Kintex Ultrascale FPGA*. To emulate a memory scrubbing function implemented on the ETU’s FPGA board, the design and testing of a software application was performed on a Xilinx KCU105 FPGA evaluation board. The memory scrubbing application had to meet certain key criteria such as (1) properly utilize with the flash memory’s Serial Peripheral Interface (SPI) to read, write, and erase flash memory properly, (2) be able to detect arbitrarily large or small amounts of bit-errors, (3) be able to correct all detected errors, and (4) perform memory scrubbing indefinitely and autonomously. A prototype implementation was constructed and tested, demonstrating successful detection and correction of bit errors in multiple configurations. In the form of burst errors or singular bit flips, and in amounts of errors ranging from one to fifteen (per 256 Bytes), the application was successful in preserving memory fidelity.

Flash memory↗

Refine your search to explore more results.