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 “"Loop scheduling"”.

  1. Loop Scheduling for Multithreaded Processors

    … highly optimized superblock-based schedules on loops with unpredictable branches. We also obtained a speedup of up to 15% on perl, a highly sequential SPEC95 benchmark, utilizing task-level speculation in an attempt to increase the available instruction-level parallelism.

    uiuc Repository record for Loop Scheduling for Multithreaded Processors (opens in a new tab)

  2. Performance and Memory Space Optimizations for Embedded Systems

    … for embedded systems. We use code restructuring, loop scheduling, data transformation, code and data placement, and scratch-pad memory (SPM) management as our tools in different embedded system scenarios. The majority of our work is focused on loop scheduling. Main contributions of our work …

    syracuse-diss Repository record for Performance and Memory Space Optimizations for Embedded Systems (opens in a new tab)

  3. Enabling the “Easy Button” for Broad, Parallel Optimization of Functions Evaluated by Simulation

    … parallel function evaluation, on demand. Dynamic loop scheduling methods are evaluated in the serverless environment with the opportunity for significant resource contention for master node computing power and network bandwidth. </p> <p>JOBS implements several population-based and single-solution …

    arkansas Repository record for Enabling the “Easy Button” for Broad, Parallel Optimization of Functions Evaluated by Simulation (opens in a new tab)

  4. How should compilers represent fork-join parallelism?

    … optimizations for serial code -- including loop-invariant-code motion, commonsubexpression elimination, and tail-recursion elimination -- to work with parallel control constructs such as spawning and parallel loops. Tapir also supports parallel optimizations such as loop scheduling. This …

    mit Repository record for How should compilers represent fork-join parallelism? (opens in a new tab)

  5. Improving the Performance of Parallel Loops in OpenCilk

    For good performance, parallel loop scheduling must achieve low scheduling overheads and multidimensional locality in nested loops. This thesis explores both challenges and contributes an extension to randomized work-stealing for first-class loop support that reduces scheduling overheads. …

    mit Repository record for Improving the Performance of Parallel Loops in OpenCilk (opens in a new tab)