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 1152 for “"parallelization"”.

  1. Automatic and interactive parallelization

    The goal of this dissertation is to give programmers the ability to achieve high performance by focusing on developing parallel algorithms, rather than on architecture-specific details. The advantages of this approach also include program portability and legibility. To achieve high performance, we …

    rice Repository record for Automatic and interactive parallelization (opens in a new tab)

  2. Parallelization of ordered irregular algorithms

    Parallel computing hardware is ubiquitous, ranging from cell-phones with multiple cores to super-computers with hundreds of thousands of cores. Applications need to take advantage of this parallelism to reduce the time required for their execution as well as to scale to larger input sizes. This has …

    texas Repository record for Parallelization of ordered irregular algorithms (opens in a new tab)

  3. Parallelization of scientific legacy code

    … that in spite of the elevated cost implied, parallelization for particular EOS applications might be worthwhile. For this, a previous analysis four years ago of tae serial M0D15A1 code was completed showing that the time may be reduced significantly. For that reason, some changes were made to …

    ttu Repository record for Parallelization of scientific legacy code (opens in a new tab)

  4. Parallelization of the kzg10 scheme /

    In this thesis, our focus is on exploring the parallelization of the KZG10 polynomial commit- ment scheme. Our goal is to parallelize a specific part of the EIP-4844 proposal, as implemented by c-kzg-4844, and compare the results with go-kzg-4844, which already incorporates parallelism. The …

    vilnius Repository record for Parallelization of the kzg10 scheme / (opens in a new tab)

  5. Automatic Program Parallelization Using Traces

    We present a novel automatic parallelization approach that uses traces. Our approach uses a binary representation of a program, allowing for the parallelization of programs even if their full source code is not available. Furthermore, traces can represent both iteration and recursion. We use …

    toronto-retro Repository record for Automatic Program Parallelization Using Traces (opens in a new tab)

  6. Using problem topology in parallelization

    Problem topology is the key to efficient parallelization support for partially regular applications. Specifically, problem topology provides the information necessary for automatic data distribution and regular application optimization of partially regular applications. Problem topology is the …

    rice Repository record for Using problem topology in parallelization (opens in a new tab)

  7. Machine Descriptors of Retargetable Parallelization

    … description framework for retargeting compiler parallelization is demonstrated.

    uiuc Repository record for Machine Descriptors of Retargetable Parallelization (opens in a new tab)

  8. Parallelization of SIFT on Rigel

    With the trend towards parallel processing in computing, interest is developing in enabling workloads to be done at faster speeds to enable new usage models. SIFT is an algorithm for image detection and can be used for a variety of purposes. It collects key-point features that are invariant to …

    uiuc Repository record for Parallelization of SIFT on Rigel (opens in a new tab)

  9. Automatic parallelization of Prolog programs

    Prolog has a number of advantages for use in rapid prototyping. The explotation of parallelism holds the promise of making these prototypes directly executable. This dissertation addresses the parallel execution of Prolog programs without restricting the language to a pure subset or requiring user …

    uiuc Repository record for Automatic parallelization of Prolog programs (opens in a new tab)

  10. The parallelization of vectorizable programs

    Thesis (M.S.)--Michigan State University. Department of Computer Science, 1992

    msu Repository record for The parallelization of vectorizable programs (opens in a new tab)

  11. Multi-GPU Parallelization of Irregular Algorithms

    All programs possess a certain degree of irregularity in their control flow and memory ac-cess patterns. The more irregular a program is, the harder it tends to be to parallelize and port to accelerators such as Graphics Processing Units (GPUs). Additionally, efficient ac-celerator-based computing …

    texas-state Repository record for Multi-GPU Parallelization of Irregular Algorithms (opens in a new tab)

  12. Parallelization of multi-objective optimization methods /

    The purpose of this research is to create a novel parallel optimization algorithm while focusing mainly on efficient Pareto ranking strategy. A theoretical background of multi-objective optimization and parallel computing is provided at the first part of the report. Two different Pareto ranking …

    vilnius Repository record for Parallelization of multi-objective optimization methods / (opens in a new tab)

  13. Parallelization of formal concept analysis algorithms

    … and Colfax Clusters. The thesis presents the key parallelization strategies used and presents experimental results of the parallelization.

    sheffield-hallam Repository record for Parallelization of formal concept analysis algorithms (opens in a new tab) Download PDF for Parallelization of formal concept analysis algorithms (opens in a new tab)

  14. Interactive parallelization of numerical scientific programs

    Parallel computers can provide impressive speedups, but unfortunately such speedups are difficult to realize in actual practice unless the program is written in a way that effectively exploits the parallel hardware. This may require a considerable intellectual effort on the part of the programmer, …

    rice Repository record for Interactive parallelization of numerical scientific programs (opens in a new tab)

  15. Parallelization of Non-Rigid Image Registration

    Non-rigid image registration finds use in a wide range of medical applications ranging from diagnostics to minimally invasive image-guided interventions. Automatic non-rigid image registration algorithms are computationally intensive in that they can take hours to register two images. Although …

    maryland Repository record for Parallelization of Non-Rigid Image Registration (opens in a new tab)

  16. Speculative parallelization of partially parallel loops

    … a generalization of the speculative doall parallelization tech- nique, called the Recursive LRPD test, that can extract and exploit the maximum available parallelism of any loop and that limits potential slowdowns to the over- head of the run-time dependence test itself. In this thesis, we …

    tamu Repository record for Speculative parallelization of partially parallel loops (opens in a new tab)

Page 1 of 58