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 10 of 10 for “"irregular programs"”.

  1. Designing Benchmark Suites of Irregular Programs

    … large graphs has become crucial. The underlying irregular programs often exhibit input-dependent control flow and memory accesses, posing challenges in implementation, parallelization, and optimization. This dissertation explores the systematic design of benchmark suites for this important …

    texas-state Repository record for Designing Benchmark Suites of Irregular Programs (opens in a new tab)

  2. Efficient execution of irregular programs on heterogeneous systems

    … we address the efficient execution of \emph{irregular} programs on heterogeneous systems. Irregular programs are used extensively in problem domains like graph analytics and finite-element methods, and they are characterized by data-dependent control flow and memory accesses that cannot be …

    texas Repository record for Efficient execution of irregular programs on heterogeneous systems (opens in a new tab)

  3. The Galois System: Optimistic Parallelization of Irregular Programs

    … decades have focused on parallelizing regular programs which operate over arrays and matrices, much less effort has been focused on irregular programs which operate over pointer-based data structures such as trees and graphs. In fact, it is not even clear that a significant amount of …

    cornell Repository record for The Galois System: Optimistic Parallelization of Irregular Programs (opens in a new tab)

  4. OPTIMIZED SCHEDULING AND RESOURCE ALLOCATION FOR THREAD PARALLEL ARCHITECTURES

    Performance characteristics of irregular programs on parallel architectures were studied. Results indicated significant overheads of thread divergence and register utilization on the GPU and sub-optimal thread migrations patterns on the EMU. Compiler and architecture optimizations addressing these …

    gatech Repository record for OPTIMIZED SCHEDULING AND RESOURCE ALLOCATION FOR THREAD PARALLEL ARCHITECTURES (opens in a new tab)

  5. Easy PRAM-based High-performance parallel Programming

    … at a much slower pace except for regular programs. For irregular programs, this advancement is inhibited by high synchronization costs, non-loop parallelism, non-array data structures, recursively expressed parallelism and parallelism that is too fine-grained to be exploitable. This work …

    maryland Repository record for Easy PRAM-based High-performance parallel Programming (opens in a new tab)

  6. Automatically Optimizing Tree Traversal Algorithms

    … to computational astrophysics, focus heavily on irregular applications. In contrast to regular applications, which operate over dense matrices and arrays, irregular programs manipulate and traverse complex data structures like trees and graphs. As irregular applications operate on ever larger …

    purdue-thes Repository record for Automatically Optimizing Tree Traversal Algorithms (opens in a new tab)

  7. Run-time parallelization: A framework for parallel computation

    … to detect and exploit parallelism in sequential programs written in conventional languages. Current parallelizing compilers do a reasonable job of extracting parallelism from programs with regular, statically analyzable access patterns. However, if the memory access pattern of the program is …

    uiuc Repository record for Run-time parallelization: A framework for parallel computation (opens in a new tab)

  8. Compilation techniques for irregular problems on parallel machines

    … of compilers that automatically parallelize programs will greatly increase the use of these machines.;A large class of scientific problems can be categorized as irregular computations. In this class of computation, the data access patterns are known only at runtime, creating significant …

    wm-mary Repository record for Compilation techniques for irregular problems on parallel machines (opens in a new tab)

  9. Parallel programming frameworks for irregular and regular programs

    Developing efficient parallel programs is challenging because it demands a comprehensive understanding spanning from algorithms, such as computation types, dependencies between computations, and memory operation patterns, to architectures, such as memory hierarchy, computing devices, and a hardware …

    texas Repository record for Parallel programming frameworks for irregular and regular programs (opens in a new tab)

  10. Performance-efficient mechanisms for managing irregularity in throughput processors

    … increasingly demand more efficient execution of irregular applications. Current GPUs, however, suffer from reduced thread-level parallelism, underutilization of compute resources, inefficient on-chip caching, and waste in off-chip memory bandwidth utilization for highly irregular programs with …

    texas Repository record for Performance-efficient mechanisms for managing irregularity in throughput processors (opens in a new tab)