Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 81 for “"parallel algorithm"”.

  1. An efficient parallel algorithm for planarity

    Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1986.

    mit Repository record for An efficient parallel algorithm for planarity (opens in a new tab)

  2. A semantic basis for parallel algorithm design

    … demands increase, emphasis is being placed on parallel architectures- To efficiently use parallel machines, software must be designed to take advantage of these machines. This research concentrates on an abstraction of algorithm design to permit the expression of parallel programs. The …

    must-thes Repository record for A semantic basis for parallel algorithm design (opens in a new tab)

  3. A parallel algorithm for sparse unsymmetric LU factorization

    This thesis presents a parallel algorithm for the direct LU factorization of general unsymmetric sparse matrices. The algorithm, D2, is based on a new nondeterministic parallel pivot search that finds a compatible pivot set S of size m, followed by a parallel rank-m update. These two steps …

    uiuc Repository record for A parallel algorithm for sparse unsymmetric LU factorization (opens in a new tab)

  4. A parallel algorithm for simple roots of polynomials

    … Numerical results are presented which show the algorithm finds simple and (usually) multiple zeros to an accuracy limited by the accuracy of polynomial evaluation. The method is designed for an SIMD parallel computer. The algorithm is compared to two other frequently used polynomial root …

    vt Repository record for A parallel algorithm for simple roots of polynomials (opens in a new tab)

  5. The Communication Complexity of Distributed Computing and a Parallel Algorithm for Polynomial Roots

    In the first part of the thesis, we begin with a discussion of the minimum communication requirements in some distributed networks. The main result is a general technique for determining lower bounds on the communication complexity of problems on various distributed computer networks. This general …

    uiuc Repository record for The Communication Complexity of Distributed Computing and a Parallel Algorithm for Polynomial Roots (opens in a new tab)

  6. Improving the Performance of a Hybrid Classification Method Using a Parallel Algorithm and a Novel Data Reduction Technique

    This thesis presents both a shared memory parallel version of the hybrid classification algorithm IGSCR (iterative guided spectral class rejection) and a novel data reduction technique that can be used in conjuction with pIGSCR (parallel IGSCR). The parallel algorithm is motivated by a demonstrated …

    vt Repository record for Improving the Performance of a Hybrid Classification Method Using a Parallel Algorithm and a Novel Data Reduction Technique (opens in a new tab)

  7. An introduction to the parallel virtual machine

    This study is an introduction of the Parallel Algorithm and the software of the Parallel Virtual Machine. The emphasis is placed on how to use the Parallel Virtual Machine to solve some parallel algorithm problem. Some of the issues to be addressed are: the feature and functionality of the PVM, how …

    concordia Repository record for An introduction to the parallel virtual machine (opens in a new tab)

  8. A Portable and Scalable Multigrid Solver for Nonlinear Structural Mechanics Problems

    … (MPI) is used to implement the proposed parallel multigrid method, which ensures the portability of the code. The object-based programming model adopted for this work is also described. The performance of the parallel algorithm is studied using two sets of benchmark problems: fixed-size …

    uiuc Repository record for A Portable and Scalable Multigrid Solver for Nonlinear Structural Mechanics Problems (opens in a new tab)

  9. Novel Algorithms for Placement and Routing and Their Parallel Implementations

    … the Message Passing Interface (MPI), all of our parallel algorithm were implemented on various multiprocessor systems for a variety of large layout benchmark circuits.

    uiuc Repository record for Novel Algorithms for Placement and Routing and Their Parallel Implementations (opens in a new tab)

  10. Mining Rare Features in Fingerprints using Core points and Triplet-based Features

    A fingerprint matching algorithm with a novel set of matching parameters based on core points and triangular descriptors is proposed to discover rarity in fingerprints. The algorithm uses a mathematical and statistical approach to discover rare features in fingerprints which provides scientific …

    vt Repository record for Mining Rare Features in Fingerprints using Core points and Triplet-based Features (opens in a new tab)

  11. Avalanche : a framework for parallel and distributed computation

    Existing frameworks for parallel and distributed programming either provide poor support for runtime flexibility or are overly restricted in their range of target applications. Here we describe the interface and implementation of the Avalanche framework, which attempts to solve both of these …

    mit Repository record for Avalanche : a framework for parallel and distributed computation (opens in a new tab)

  12. HPC-based Parallel Algorithms for Generating Random Networks and Some Other Network Analysis Problems

    … random networks, and developing network mining algorithms. In the era of big data, speed is not an option anymore for the effective analysis of these massive systems, it is an absolute necessity. This motivates the need for parallel algorithms on modern high-performance computing (HPC) systems …

    vt Repository record for HPC-based Parallel Algorithms for Generating Random Networks and Some Other Network Analysis Problems (opens in a new tab)

  13. The Solution of a Parabolic Partial Differential Equation via Domain Decomposition: The Synthesis of Asymptotic and Numerical Analysis

    A parallel algorithm for the efficient solution of a time dependent reaction convection diffusion equation with small parameter on the diffusion term will be presented. The method is based on a domain decomposition that is dictated by singular perturbation analysis. The analysis is used to …

    uiuc Repository record for The Solution of a Parabolic Partial Differential Equation via Domain Decomposition: The Synthesis of Asymptotic and Numerical Analysis (opens in a new tab)

  14. Numerical simulation of non-Newtonian fluid flow in mixing geometries

    … and non-Newtonian fluids, on both sequential and parallel computer systems. The thesis begins by giving the necessary background to the mixing process and a summary of the fundamental characteristics of parallel architecture machines. This is followed by a literature review which covers …

    southwales Repository record for Numerical simulation of non-Newtonian fluid flow in mixing geometries (opens in a new tab)

  15. Parallel algorithms and architectures for low power video decoding

    Parallelism coupled with voltage scaling is an effective approach to achieve high processing performance with low power consumption. This thesis presents parallel architectures and algorithms designed to deliver the power and performance required for current and next generation video coding. Coding …

    mit Repository record for Parallel algorithms and architectures for low power video decoding (opens in a new tab)

  16. Numerical methods for the solution of large and very large, sparse Lyapunov equations

    … $AX + XA\sp\prime + Q = 0$. We first present a parallel version of the Hammarling algorithm for the solution of Lyapunov equations where the coefficient matrix A is large and dense. We then present a novel parallel algorithm for the solution of Lyapunov equations where A is large and banded. We …

    uiuc Repository record for Numerical methods for the solution of large and very large, sparse Lyapunov equations (opens in a new tab)

  17. The analysis and synthesis of efficient algorithm-based error detection schemes for hypercube multiprocessors

    Numerous algorithms for computationally intensive tasks that are suitable for execution on hypercube multiprocessors have been developed by researchers. In this thesis, we look at parallel algorithm design from a different perspective: the provision of on-line detection of hardware errors using …

    uiuc Repository record for The analysis and synthesis of efficient algorithm-based error detection schemes for hypercube multiprocessors (opens in a new tab)

  18. The Design, Analysis, & Application Of Multi-Modal Real-Time Embedded Systems

    … the schedulability analysis, we develop a parallel algorithm using message passing interface (MPI) to check the invariants of the schedulable real-time MMS. This parallel algorithm significantly improves the execution time for checking the schedulability (e.g., our parallel algorithm

    wayne-thes Repository record for The Design, Analysis, & Application Of Multi-Modal Real-Time Embedded Systems (opens in a new tab)

Page 1 of 5