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 12 of 12 for “"Polyhedral model"”.

  1. Simplifying multiple-statement reductions with the polyhedral model

    … vision, and financial analytics. Contemporary polyhedral-based techniques make it possible to optimize reductions, such as prefix sum, in which each component of reduction's output potentially shares computation with another component in the reduction. Therefore an optimizing compiler can …

    mit Repository record for Simplifying multiple-statement reductions with the polyhedral model (opens in a new tab)

  2. Domain-Specific Code Transformations for Computational Science based on the Polyhedral Model

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2024-03-01 without embargo terms

    uiuc Repository record for Domain-Specific Code Transformations for Computational Science based on the Polyhedral Model (opens in a new tab)

  3. Polyhedral Code Transformation for Julia

    … as considering striding of array accesses. The polyhedral model of computation describes a series of operations and abstractions for manipulating code without violating dependencies or correctness, but is more aggressive than typical compiler optimizations. This paper describes the process of …

    mit Repository record for Polyhedral Code Transformation for Julia (opens in a new tab)

  4. Fourier-Motzkin with non-linear symbolic constant coefficients

    The polyhedral framework is an elegant and useful system for reasoning about loop nests in programs, and is commonly used to perform complex loop transformations such as tiling and parallelization. However, several critical transformations introduce non-linear inequalities during code generation, …

    mit Repository record for Fourier-Motzkin with non-linear symbolic constant coefficients (opens in a new tab)

  5. Automated communication and floorplan-aware hardware/software co-design for SoC

    … consists of the following main components: (1) polyhedral-model-based hardware accelerator design space exploration, (2) modeling of various communication types and integration into LLVM-based integer linear programming for HW/SW task partitioning, (3) fast and efficient search algorithm to …

    uiuc Repository record for Automated communication and floorplan-aware hardware/software co-design for SoC (opens in a new tab)

  6. A polyhedral-based systemc modeling and generation framework for effective low-power design space exploration

    … into a full SystemC de- scription through polyhedral model-based techniques while performing powerful data locality and parallelism transformations. We then leverage key properties of affine computations to design a fast and accurate latency and power characterization flow. Using this flow, …

    uiuc Repository record for A polyhedral-based systemc modeling and generation framework for effective low-power design space exploration (opens in a new tab)

  7. Parallelization of dynamic programming recurrences in computational biology

    … abstraction to represent dynamic programming and polyhedral analysis to exploit parallelism. We suggest a novel technique within the polyhedral model to optimize for throughput by pipelining independent computations on an array. This design technique improves on the state of the art, which builds …

    wustl Repository record for Parallelization of dynamic programming recurrences in computational biology (opens in a new tab)

  8. Novel Approaches to Automatic Hardware Acceleration of High-Level Software

    … technique, the major focus of this thesis, is polyhedralassisted accelerator generation for loop kernels. Nested loop kernels consisting of numeric operations is a primary, but non-trivial, target for FPGA acceleration. High-level application synthesis addresses the design challenge by …

    auckland-ms Repository record for Novel Approaches to Automatic Hardware Acceleration of High-Level Software (opens in a new tab)

  9. Characterizing the Effectiveness of Compilers in Vectorizing Polyhedrally Transformed Code

    Many of the compute intensive applications spend most of their time inside nested loops. Hence optimization of these nested loops can provide significant improvements in the speed of the program. A number of optimizations can be performed to a program in order to speed it up on a particular …

    ohiolink Repository record for Characterizing the Effectiveness of Compilers in Vectorizing Polyhedrally Transformed Code (opens in a new tab)

  10. Code Generation for Extreme Scale Parallel Systems

    … compiler technology and expressive programming model constructs can help applications more effectively exploit both forms of parallelism. Compilers play an important role in harnessing short vector parallelism supported by cores in modern processors. Over last ten years, vector widths have …

    rice Repository record for Code Generation for Extreme Scale Parallel Systems (opens in a new tab)

  11. Program transformation and code generation for developing, modeling, and optimizing GPU programs

    … constructing customizable, black-box performance models for GPUs; and (3) a visual user interface for program optimization and analysis. We demonstrate how our human-accessible dependency and loop-nest semantics enable reasoning about program correctness in a transformation and optimization …

    uiuc Repository record for Program transformation and code generation for developing, modeling, and optimizing GPU programs (opens in a new tab)