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 “"Irregular Computation"”.

  1. Runtime support for irregular computation in MPI-based applications

    … number of applications that have been using irregular computation models in various domains, such as computational chemistry, bioinformatics, nuclear reactor simulation and social network analysis. Due to the irregular and data-dependent communication patterns and sparse data structures …

    uiuc Repository record for Runtime support for irregular computation in MPI-based applications (opens in a new tab)

  2. Perspectives Beyond Regular Computation

    … of deep learning systems rely on highly regular computational patterns optimized for dense generalized matrix multiplications. While this paradigm enables excellent hardware acceleration, it faces significant challenges when addressing the irregular structures encountered in real-world …

    qucosa-diss

  3. IEGen: semi-automatic generation of inspectors and executors

    … and molecular interaction is often based on irregular computational kernels. Indirect array accesses such as A[B[i]] that are found in irregular computations often exhibit a memory access pattern that does not make efficient use of the memory hierarchy, reducing performance. Additionally, …

    colostate Repository record for IEGen: semi-automatic generation of inspectors and executors (opens in a new tab)

  4. Exploring Multi-Level Parallelism For Graph-Based Applications Via Algorithm And System Co-Design

    … CPU architectures are able to provide massive computational power by using sophisticated memory hierarchy and multi-level parallelism, including thread-level parallelism, data-level parallelism, etc. On the other hand, graph processing workloads are notoriously challenging for achieving high …

    wm-mary Repository record for Exploring Multi-Level Parallelism For Graph-Based Applications Via Algorithm And System Co-Design (opens in a new tab)

  5. Techniques for enabling GPU code generation of low-level optimizations and dynamic parallelism from high-level abstractions

    … there are multiple ways to target GPUs for computations. From low-level C style syntax that provides for full control and most performance at the cost of slow code-development times to High-level DSLs that can abstracts the complexities of GPU programming, speeding up code-development at the …

    uiuc Repository record for Techniques for enabling GPU code generation of low-level optimizations and dynamic parallelism from high-level abstractions (opens in a new tab)

  6. On the Efficient Mapping and Optimization of Irregular Workloads for Graphics Processing Units

    Irregular workloads, characterized by input-dependent memory accesses, control flow, and work distribution, are difficult to map efficiently to GPUs, as they exhibit poor data locality and workload imbalance. Some irregular workloads are limited by long, input-dependent chains of data dependencies …

    vt Repository record for On the Efficient Mapping and Optimization of Irregular Workloads for Graphics Processing Units (opens in a new tab)