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 276 for “"Parallel algorithm"”.

  1. 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)

  2. Parallel algorithm for solving integer linear programs

    … ILP. It is the focus of this report to present a parallel algorithm for solving ILPs. We discuss a serial algorithm using a breadth-first branch-and-bound search to check the feasible solution space, and then extend it into a parallel algorithm using a client-server model. In the parallel mode, …

    mtu Repository record for Parallel algorithm for solving integer linear programs (opens in a new tab)

  3. Efficient Parallel Algorithm for Overlaying Surface Meshes

    … within the integrated simulations running on parallel computers. Previously, Jiao and Heath developed an algorithm for constructing a common tessellation by overlaying the surface meshes. The original algorithm is efficient and robust, but unfortunately, it is complex and difficult to …

    gatech Repository record for Efficient Parallel Algorithm for Overlaying Surface Meshes (opens in a new tab)

  4. A parallel algorithm for ASN.1 encoding/decoding

    … implemented in software but now a combined parallel hardware/software approach is taken. Prior to this thesis, VASN.1[3][24][25] was the only parallel hardware/software combination that achieved high throughput in the presentation layer. The parallel algorithm ofVASN.1 limits the scalablity …

    ubc Repository record for A parallel algorithm for ASN.1 encoding/decoding (opens in a new tab) Download PDF for A parallel algorithm for ASN.1 encoding/decoding (opens in a new tab)

  5. 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)

  6. 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)

  7. The modeling and analysis of parallel algorithm design

    Thesis (Ph. D.)--Michigan State University. Department of Computer Science, 1983

    msu Repository record for The modeling and analysis of parallel algorithm design (opens in a new tab)

  8. A parallel algorithm for the non-symmetric eigenvalue problem

    <p>We report on an algorithm for the solution of the non-symmetric eigenvalue problem. The algorithm is based on a divide and conquer procedure that provides initial approximations to the eigenpairs which are then refined using Newton iterations. Since the smaller subproblems can be solved …

    utk-theses Repository record for A parallel algorithm for the non-symmetric eigenvalue problem (opens in a new tab)

  9. New approaches in parallel algorithm portfolios for metaheuristic optimization

    … to an increasing expansion of the available algorithmic artillery. However, both theoretical and experimental evidence suggest that the existence of a universal optimization algorithm capable of tackling all optimization problems equally well is highly improbable. Thus, the ability to …

    greece Repository record for New approaches in parallel algorithm portfolios for metaheuristic optimization (opens in a new tab)

  10. A practical parallel algorithm for the minimization of Krönecker Reed-Muller expansions

    … turn, led naturally to an increased interest in algorithms for the minimization of Exclusive-Or Sum of Products (ESOP) forms. Although this is an active area of research, it is not nearly as developed as the traditional Sum of Products forms. Computer programs to find minimum ESOPs are not …

    portland-state Repository record for A practical parallel algorithm for the minimization of Krönecker Reed-Muller expansions (opens in a new tab)

  11. A Parallel Algorithm and Implementation to Compute Spatial Autocorrelation (Hotspot) Using MATLAB

    … discussed the efficiency and optimization of the algorithm. Commonly, these kinds of analyses would be based upon a huge dataset about space and time, and the conventional algorithm would take too much time to get the results. This paper mainly discusses whether the algorithm can be processed in …

    marquette Repository record for A Parallel Algorithm and Implementation to Compute Spatial Autocorrelation (Hotspot) Using MATLAB (opens in a new tab)

Page 1 of 14