Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “multilevel”

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

Bounds on Block Error Probability for Multilevel Concatenated Codes

Maximum likelihood decoding of long block codes is not feasable due to large complexity. Some classes of codes are shown to be decomposable into multilevel concatenated codes (MLCC). For these codes, multistage decoding provides good trade-off between performance and complexity. In this paper, we derive an upper bound on the probability of block error for MLCC. We use this bound to evaluate difference in performance for different decompositions of some codes. Examples given show that a significant reduction in complexity can be achieved when increasing number of stages of decoding. Resulting performance degradation varies for different decompositions. A guideline is given for finding good m-level decompositions.

Lin, Shu↗
NASA NTRS1996

Implementation of Hybrid V-Cycle Multilevel Methods for Mixed Finite Element Systems with Penalty

The goal of this paper is the implementation of hybrid V-cycle hierarchical multilevel methods for the indefinite discrete systems which arise when a mixed finite element approximation is used to solve elliptic boundary value problems. By introducing a penalty parameter, the perturbed indefinite system can be reduced to a symmetric positive definite system containing the small penalty parameter for the velocity unknown alone. We stabilize the hierarchical spatial decomposition approach proposed by Cai, Goldstein, and Pasciak for the reduced system. We demonstrate that the relative condition number of the preconditioner is bounded uniformly with respect to the penalty parameter, the number of levels and possible jumps of the coefficients as long as they occur only across the edges of the coarsest elements.

Lai, Chen-Yao G.↗
NASA NTRS1996

The incremental unknowns-a multilevel scheme for the simulation of turbulent channel flows

In numerical simulation of complex flows, it is important to identify different length scales of the flow and treat them differently. In this report, we introduce a new multilevel scheme for simulating turbulent channel flows. Two different versions of the scheme, namely the spectral and finite difference versions, are presented. The spectral version of the scheme is based on a spectral-Galerkin formulation which provides a natural decomposition of the flow into small and large wavelength parts, and which leads to linear systems that can be solved with quasi-optimal computational complexity. In the finite difference version, the Incremental Unknown (IU) is used to separate the length scales. Preliminary numerical results indicate that the scheme is well suited for turbulence computations and provides results which are comparable to that by Direct Numerical Simulation (DNS) but with significantly less CPU time.

Chen, M.↗
NASA NTRS1993

Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems

If problems involving unstructured meshes are to be solved efficiently on distributed-memory parallel computers, the meshes must be partitioned and distributed across processors in a way that balances tile computational load and minimizes communication. The recursive spectral bisection method (RSB) has been shown to be very effective for such partitioning problems compared to alternative methods, but RSB in its simplest form is expensive. Here a multilevel version of RSB is introduced that attains about an order-of-magnitude improvement in run time on typical examples.

Barnard, Stephen T.↗
NASA NTRS1997

On the Multilevel Solution Algorithm for Markov Chains

We discuss the recently introduced multilevel algorithm for the steady-state solution of Markov chains. The method is based on an aggregation principle which is well established in the literature and features a multiplicative coarse-level correction. Recursive application of the aggregation principle, which uses an operator-dependent coarsening, yields a multi-level method which has been shown experimentally to give results significantly faster than the typical methods currently in use. When cast as a multigrid-like method, the algorithm is seen to be a Galerkin-Full Approximation Scheme with a solution-dependent prolongation operator. Special properties of this prolongation lead to the cancellation of the computationally intensive terms of the coarse-level equations.

Horton, Graham↗
NASA NTRS1997

Multidimensional Trellis Coded Phase Modulation Using a Multilevel Concatenation Approach: Code Design - Part 1

The first part of this paper presents a simple and systematic technique for constructing multidimensional M-ary phase shift keying (MMK) trellis coded modulation (TCM) codes. The construction is based on a multilevel concatenation approach in which binary convolutional codes with good free branch distances are used as the outer codes and block MPSK modulation codes are used as the inner codes (or the signal spaces). Conditions on phase invariance of these codes are derived and a multistage decoding scheme for these codes is proposed. The proposed technique can be used to construct good codes for both the additive white Gaussian noise (AWGN) and fading channels as is shown in the second part of this paper.

Rajpal, Sandeep↗
NASA NTRS2002

Automatic Multilevel Parallelization Using OpenMP

In this paper we describe the extension of the CAPO (CAPtools (Computer Aided Parallelization Toolkit) OpenMP) parallelization support tool to support multilevel parallelism based on OpenMP directives. CAPO generates OpenMP directives with extensions supported by the NanosCompiler to allow for directive nesting and definition of thread groups. We report some results for several benchmark codes and one full application that have been parallelized using our system.

Jin, Hao-Qiang↗
NASA NTRS2002

Automatic Multilevel Parallelization Using OpenMP

In this paper we describe the extension of the CAPO parallelization support tool to support multilevel parallelism based on OpenMP directives. CAPO generates OpenMP directives with extensions supported by the NanosCompiler to allow for directive nesting and definition of thread groups. We report first results for several benchmark codes and one full application that have been parallelized using our system.

Jin, Hao-Qiang↗
NASA NTRS2002

Performance Analysis of Multilevel Parallel Applications on Shared Memory Architectures

In this paper we describe how to apply powerful performance analysis techniques to understand the behavior of multilevel parallel applications. We use the Paraver/OMPItrace performance analysis system for our study. This system consists of two major components: The OMPItrace dynamic instrumentation mechanism, which allows the tracing of processes and threads and the Paraver graphical user interface for inspection and analyses of the generated traces. We describe how to use the system to conduct a detailed comparative study of a benchmark code implemented in five different programming paradigms applicable for shared memory

Jost, Gabriele↗
NASA NTRS2003

Performance Analysis of Multilevel Parallel Applications on Shared Memory Architectures

Parallel programming paradigms include process level parallelism, thread level parallelization, and multilevel parallelism. This viewgraph presentation describes a detailed performance analysis of these paradigms for Shared Memory Architecture (SMA). This analysis uses the Paraver Performance Analysis System. The presentation includes diagrams of a flow of useful computations.

Biegel, Bryan A.↗
NASA NTRS2004

What Multilevel Parallel Programs do when you are not Watching: A Performance Analysis Case Study Comparing MPI/OpenMP, MLP, and Nested OpenMP

With the current trend in parallel computer architectures towards clusters of shared memory symmetric multi-processors, parallel programming techniques have evolved that support parallelism beyond a single level. When comparing the performance of applications based on different programming paradigms, it is important to differentiate between the influence of the programming model itself and other factors, such as implementation specific behavior of the operating system (OS) or architectural issues. Rewriting-a large scientific application in order to employ a new programming paradigms is usually a time consuming and error prone task. Before embarking on such an endeavor it is important to determine that there is really a gain that would not be possible with the current implementation. A detailed performance analysis is crucial to clarify these issues. The multilevel programming paradigms considered in this study are hybrid MPI/OpenMP, MLP, and nested OpenMP. The hybrid MPI/OpenMP approach is based on using MPI [7] for the coarse grained parallelization and OpenMP [9] for fine grained loop level parallelism. The MPI programming paradigm assumes a private address space for each process. Data is transferred by explicitly exchanging messages via calls to the MPI library. This model was originally designed for distributed memory architectures but is also suitable for shared memory systems. The second paradigm under consideration is MLP which was developed by Taft. The approach is similar to MPi/OpenMP, using a mix of coarse grain process level parallelization and loop level OpenMP parallelization. As it is the case with MPI, a private address space is assumed for each process. The MLP approach was developed for ccNUMA architectures and explicitly takes advantage of the availability of shared memory. A shared memory arena which is accessible by all processes is required. Communication is done by reading from and writing to the shared memory.

Jost, Gabriele↗
NASA NTRS1996

Displacement Based Multilevel Structural Optimization

In the complex environment of true multidisciplinary design optimization (MDO), efficiency is one of the most desirable attributes of any approach. In the present research, a new and highly efficient methodology for the MDO subset of structural optimization is proposed and detailed, i.e., for the weight minimization of a given structure under size, strength, and displacement constraints. Specifically, finite element based multilevel optimization of structures is performed. In the system level optimization, the design variables are the coefficients of assumed polynomially based global displacement functions, and the load unbalance resulting from the solution of the global stiffness equations is minimized. In the subsystems level optimizations, the weight of each element is minimized under the action of stress constraints, with the cross sectional dimensions as design variables. The approach is expected to prove very efficient since the design task is broken down into a large number of small and efficient subtasks, each with a small number of variables, which are amenable to parallel computing.

Sobieszezanski-Sobieski, J.↗
NASA NTRS2003

An Airline-Based Multilevel Analysis of Airfare Elasticity for Passenger Demand

Price elasticity of passenger demand for a specific airline is estimated. The main drivers affecting passenger demand for air transportation are identified. First, an Ordinary Least Squares regression analysis is performed. Then, a multilevel analysis-based methodology to investigate the pattern of variation of price elasticity of demand among the various routes of the airline under study is proposed. The experienced daily passenger demands on each fare-class are grouped for each considered route. 9 routes were studied for the months of February and May in years from 1999 to 2002, and two fare-classes were defined (business and economy). The analysis has revealed that the airfare elasticity of passenger demand significantly varies among the different routes of the airline.

Castelli, Lorenzo↗
NASA NTRS1991

Trellis coded multilevel DPSK system with doppler correction for mobile satellite channels

A trellis coded multilevel differential phase shift keyed mobile communication system. The system of the present invention includes a trellis encoder for translating input signals into trellis codes; a differential encoder for differentially encoding the trellis coded signals; a transmitter for transmitting the differentially encoded trellis coded signals; a receiver for receiving the transmitted signals; a differential demodulator for demodulating the received differentially encoded trellis coded signals; and a trellis decoder for decoding the differentially demodulated signals.

Divsalar, Dariush↗
NASA NTRS2000

A Domain-Decomposed Multilevel Method for Adaptively Refined Cartesian Grids with Embedded Boundaries

Preliminary verification and validation of an efficient Euler solver for adaptively refined Cartesian meshes with embedded boundaries is presented. The parallel, multilevel method makes use of a new on-the-fly parallel domain decomposition strategy based upon the use of space-filling curves, and automatically generates a sequence of coarse meshes for processing by the multigrid smoother. The coarse mesh generation algorithm produces grids which completely cover the computational domain at every level in the mesh hierarchy. A series of examples on realistically complex three-dimensional configurations demonstrate that this new coarsening algorithm reliably achieves mesh coarsening ratios in excess of 7 on adaptively refined meshes. Numerical investigations of the scheme's local truncation error demonstrate an achieved order of accuracy between 1.82 and 1.88. Convergence results for the multigrid scheme are presented for both subsonic and transonic test cases and demonstrate W-cycle multigrid convergence rates between 0.84 and 0.94. Preliminary parallel scalability tests on both simple wing and complex complete aircraft geometries shows a computational speedup of 52 on 64 processors using the run-time mesh partitioner.

Aftosmis, M. J.↗
NASA NTRS2018

Integration of Multilevel Superconducting Buried Wiring Layers with Transition-Edge Sensor Detectors for Large Scale Arrays

Lynx, one of the four mission concepts under consideration for the next Astrophysics DecadalReview, will include a microcalorimeter array consisting of more than 100,000 pixels in a compact arrangement with absorber pitch as small as 25 microns. In order to realize the desired array scale, fine-pitch multi-level superconducting wiring with high yield, compatible with rapid expansion of our hydra absorber designs, is essential. We have demonstrated a method of integrating transition edge sensor (TES) microcalorimeters with suitable multilevel buried wiring, fabricated at MIT Lincoln Laboratory using advanced tools dedicated to superconducting circuit fabrication. The TES Mo/Au bilayer is deposited on a high-quality oxide surface created by chemical-mechanical polishing, allowing tight specifications on the TES superconducting transition and link conductivity to be achieved even though the process order has been inverted. The TESs contact the top-level niobium wiring through vias etched through silicon dioxide down to the topmost wiring layer. The article discusses the overall fabrication process, as wellas the behavior of sensors with different via designs, proximity structures, and lateral sizes. An initial iteration of the integrated fabrication process indicates that microcalorimeters fabricated in this way should meet mission specifications using a Mo/Au bilayer with a reasonable critical temperature below 100 mK.

Detector↗
NASA NTRS2018

High-Efficiency Flexible Multilevel Photon Sieves by Single-Step Laser-Based Fabrication and Optical Analysis

Over the past several decades, the need for high-resolution, high-efficiency, lightweight, high contrast focusing optics has continued to increase due to their applications in fields such as astronomy, spectroscopy, free-space optical communications, defense, and remote sensing. In recent years, photon sieve planar diffractive optics have been developed on flexible, lightweight polyimide substrates. However, transmission efficiencies have continuously been very low (~1-4%), thus impeding the widespread use of photon sieves in practical applications. Here, we present a flexible, lightweight, N = 4 level phase photon sieve with over 25% transmission efficiency; nearly triple that of any other photon sieve reported thus far. In this study, the photon sieve was fabricated via a novel pulsed laser ablation method using an ultraviolet source, and the total time to fabricate a ~3 sq cm sample was tens of seconds. Theoretical analysis of the photon sieve was carried out via the FDTD method, and was in very good agreement with experimental results. We also calculated via FDTD modeling the behavior of higher step (N = 8, 16, 32) photon sieves for further enhanced efficiencies, and show a fundamental limit on photon sieve efficiency of 70% in the limit of increasing step number. This multilevel photon sieve represents a new step in high-resolution diffractive optics, moving towards efficiencies suitable for widespread applications.

Julian, Matthew N.↗