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 14 of 14 for “"Nested parallelism"”.

  1. Nested Parallelism with Algorithmic Skeletons

    … designs. This trend makes support of nested-parallelism an important feature for parallel programming models. It enables implementation of parallel programs that can then be mapped onto the system hierarchy. However, supporting nested-parallelism is not a trivial task due to complexity …

    tamu Repository record for Nested Parallelism with Algorithmic Skeletons (opens in a new tab)

  2. Exploiting Nested Parallelism on Heterogeneous Processors

    … this thesis focuses on the execution model of nested parallel workloads on heterogeneous systems. We have designed a simulation flow which utilizes widely used CPU and GPU simulators to model heterogeneous computing architectures. We then applied this simulator to non-traditional GPU workloads …

    maryland Repository record for Exploiting Nested Parallelism on Heterogeneous Processors (opens in a new tab)

  3. Bounded Asynchrony and Nested Parallelism for Scalable Graph Processing

    … unbounded asynchrony including wasted work. 2. Nested parallelism. Allowing to express graph algorithms in a naturally nested parallel manner enables us to fully exploit all of the available parallelism inherent in graph algorithms.

    tamu Repository record for Bounded Asynchrony and Nested Parallelism for Scalable Graph Processing (opens in a new tab)

  4. Techniques for optimizing dynamic parallelism on graphics processing units

    Dynamic parallelism is a feature of general purpose graphics processing units (GPUs) whereby threads running on a GPU can spawn other threads without CPU intervention. This feature is useful for programming applications with nested parallelism where threads executing in parallel may each identify …

    uiuc Repository record for Techniques for optimizing dynamic parallelism on graphics processing units (opens in a new tab)

  5. STAPL-RTS: A Runtime System for Massive Parallelism

    … C++ programming idioms. Recognizing that nested parallelism is of increasing interest for both expressivity and performance, we present a parallel model that combines asynchronous, one-sided operations with isolated nested parallel sections. Previous approaches to nested parallelism …

    tamu Repository record for STAPL-RTS: A Runtime System for Massive Parallelism (opens in a new tab)

  6. Enhancing Productivity and Performance Portability of General-Purpose Parallel Programming

    … where the programmer explicitly exposes parallelism in the form of short tasks that may outnumber the cores by orders of magnitude. The compiler, the run-time, and the platform (henceforth <italic>the system</italic>) are responsible for harnessing this unpredictable amount of …

    maryland Repository record for Enhancing Productivity and Performance Portability of General-Purpose Parallel Programming (opens in a new tab)

  7. Compiler-assisted workload consolidation to efficiently exploit dynamic parallelism for recursive applications

    … for those application which express a flat data parallelism, a simple data parallelism that is known at compiling time and can be easily distributed to different GPU blocks and threads. However, for those applications that contain nested data parallelism, which is not known a priori and can only …

    missouri Repository record for Compiler-assisted workload consolidation to efficiently exploit dynamic parallelism for recursive applications (opens in a new tab)

  8. Enabling Moldability in OpenMP

    … well by simple work-stealing schedulers is nested parallelism, where each task runs multiple threads in parallel. It isn’t clear how many threads each task should be allocated i.e. the width of the task. If it’s too high there will be over-subscription while if it’s too low there will be …

    chalmers Repository record for Enabling Moldability in OpenMP (opens in a new tab)

  9. ParU: A Task Based Parallel Multifrontal and Unsymmetric Sparse LU Factorization

    … algorithm from scratch that is more amenable to parallelism. The new algorithm is right-looking multifrontal with rectangular fronts and uses the sparsest pivot like UMFPACK; however, its data structures are different, and the factorization is more coarse-grained. One of the most significant …

    tamu Repository record for ParU: A Task Based Parallel Multifrontal and Unsymmetric Sparse LU Factorization (opens in a new tab)

  10. Parallel algorithms for two-stage stochastic optimization

    … Integer Program Solver (PSIPS) that exploits nested parallelism by exploring the branch-and-bound tree vertices in parallel along with scenario parallelization. PSIPS has been shown to have high parallel efficiency of greater than 40% at 120 cores which is significantly greater than the …

    uiuc Repository record for Parallel algorithms for two-stage stochastic optimization (opens in a new tab)

  11. Myrmics: A scalable runtime system for global address spaces

    … enhance an existing task-based model to support nested parallelism and pointer-based, irregular data structures. We then design and implement Myrmics, a runtime system that implements this programming model. Myrmics is specifically designed to run on future, heterogeneous, non-coherent processors …

    greece Repository record for Myrmics: A scalable runtime system for global address spaces (opens in a new tab)

  12. Resilience in high-level parallel programming languages

    … in supercomputers make supporting task parallelism and resilience a necessity in HPC programming models. Given the complexity of managing multi-threaded distributed execution in the presence of failures, there is a critical need for task-parallel abstractions that simplify writing …

    anu Repository record for Resilience in high-level parallel programming languages (opens in a new tab)

  13. High performance computing algorithms for discrete optimization

    … unstructured MIP. We show how the combination of parallelism and simple large neighborhood search schemes can provide a powerful tool for generating high quality solutions for any given problem. Our parallel method is able to produce competitive or better and faster results for more than 90% of …

    gatech Repository record for High performance computing algorithms for discrete optimization (opens in a new tab)

  14. On the design of architecture-aware algorithms for emerging applications

    … on system software and architectural support for nested irregular parallelism, Transactional Memory, and hybrid data transfer mechanisms. We believe that the complexity of parallel programming can be significantly reduced via collaborative efforts among researchers and practitioners from different …

    gatech Repository record for On the design of architecture-aware algorithms for emerging applications (opens in a new tab)