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 6 of 6 for “"Optimal parallel algorithm"”.

  1. PROBABILISTIC ANALYSIS AND PARALLELIZATION OF BIN-PACKING ALGORITHMS

    … emphasis is placed on the study of heuristic algorithms. To compare the performance of heuristic algorithms, their average-case performance is an appropriate measure when the input of these algorithms are drawn from some known distributions. In this thesis, we propose a heuristic algorithm, …

    nus Repository record for PROBABILISTIC ANALYSIS AND PARALLELIZATION OF BIN-PACKING ALGORITHMS (opens in a new tab) Download file for PROBABILISTIC ANALYSIS AND PARALLELIZATION OF BIN-PACKING ALGORITHMS (opens in a new tab)

  2. A Framework for Grid Solvers

    … data structure. Such an approach leads to an optimal parallel algorithm for matrix reordering by cartesian nested dissection. It also facilitates the efficient computation of the elimination tree and factorization of the sparse system by the multi-frontal method in a high-performance computing …

    uiuc Repository record for A Framework for Grid Solvers (opens in a new tab)

  3. Lygiagretūs algoritmai difuzijos lygtims spręsti /

    … to speed up the computation of the model using parallel algorithms. Parallel algorithms were written using the MPI implementation: mpi4py in the Python programming language. The main goal of the work is to find an optimal parallel algorithm to model the oxygen concentration generated by …

    vilnius Repository record for Lygiagretūs algoritmai difuzijos lygtims spręsti / (opens in a new tab)

  4. Parallel techniques for construction of trees and related problems

    … notions in computer science. Sequential algorithms for trees are generally well studied. Unfortunately many of these sequential algorithms use methods which seem to be inherently sequential. One of the contributions of this thesis is the introduction of several parallel techniques for the …

    ubc Repository record for Parallel techniques for construction of trees and related problems (opens in a new tab) Download PDF for Parallel techniques for construction of trees and related problems (opens in a new tab)

  5. Parallel and scalable combinatorial string algorithms on distributed memory systems

    … are built upon combinatorial graph and string algorithms. The advent of high-throughput DNA sequencing is enabling the generation of billions of reads per experiment. Classical and sequential algorithms can no longer deal with these growing data sizes - which for the last 10 years have greatly …

    gatech Repository record for Parallel and scalable combinatorial string algorithms on distributed memory systems (opens in a new tab)