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 5 of 5 for “"Implicit Parallelism"”.

  1. Identifying, Quantifying, Extracting and Enhancing Implicit Parallelism

    … explicit parallelization for performance. Implicit Parallelization is an alternative that could ease the burden on programmers by parallelizing applications “under the covers” while maintaining sequential semantics externally. This thesis develops a novel approach for thinking about …

    uiuc Repository record for Identifying, Quantifying, Extracting and Enhancing Implicit Parallelism (opens in a new tab)

  2. The effective use of implicit parallelism through the use of an object-oriented programming language

    … if followed, maximise the potential levels of parallelism. Model of Concurrency. The concurrency model is designed to be a straightforward target for mapping sequential programs onto, thus making them parallel. It aids the compilation process by providing a high level of abstraction, including …

    aston Repository record for The effective use of implicit parallelism through the use of an object-oriented programming language (opens in a new tab)

  3. Exploring the Relationship of the Closeness of a Genetic Algorithm's Chromosome Encoding to Its Problem Space

    … matches the problem space. I will show that implicit parallelism does not result in binary encoded chromosomes obtaining higher fitness scores than other encodings. I will also show that Hamming distances should be understood as part of the relationship between the closeness of an encoding to …

    calpoly Repository record for Exploring the Relationship of the Closeness of a Genetic Algorithm's Chromosome Encoding to Its Problem Space (opens in a new tab)

  4. Hierarchically Tiled Arrays as high-level programming abstractions for dataflow runtime systems

    … as tiled array operations which contains implicit parallelism. We propose a design to map an HTA program to a dataflow task dependence graph dynamically, so that the programmer can write conventional HTA programs while enjoying the benefits provided by the underlying dataflow runtime …

    uiuc Repository record for Hierarchically Tiled Arrays as high-level programming abstractions for dataflow runtime systems (opens in a new tab)

  5. Compiler-Hardware Co-Design for Pervasive Parallelization

    … complex programs while retaining the simplicity of sequential code. Our new systems allow real-world programs to use hundreds of cores without burdening programmers with concurrency, deadlock, or data races. This dissertation follows a novel approach that eliminates the burden of …

    mit Repository record for Compiler-Hardware Co-Design for Pervasive Parallelization (opens in a new tab)