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 20 of 29 for “"Polyhedral Model"”.

  1. Some advances in the polyhedral model

    The polyhedral model is a mathematical formalism and a framework for the analysis and transformation of regular computations. It provides a unified approach to the optimization of computations from different application domains. It is now gaining wide use in optimizing compilers and automatic …

    colostate Repository record for Some advances in the polyhedral model (opens in a new tab)

  2. Beyond shared memory loop parallelism in the polyhedral model

    … builds on important contributions to the polyhedral model, a mathematical framework for reasoning about program transformations. We show that many affine control programs can be uniformized only with simple techniques. Being able to assume uniform dependences significantly simplifies …

    colostate Repository record for Beyond shared memory loop parallelism in the polyhedral model (opens in a new tab)

  3. Using Decision Tree Voting to Select a Polyhedral Model Loop Transformation

    … execution would, therefore, be desirable. The Polyhedral Model allows the generation of alternative transformations for a loop nest that are semantically equivalent to the original. The transformations vary the degree of loop tiling, loop fusion, loop unrolling, parallelism, and vectorization. …

    waterloo Repository record for Using Decision Tree Voting to Select a Polyhedral Model Loop Transformation (opens in a new tab)

  4. 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)

  5. Discrete Element Modeling of the Shape- and History-Dependent Behavior of Granular Materials

    … Among various numerical methods developed for modeling granular materials, the particle-based discrete element method (DEM) is particularly suited and effective in modeling the mechanical, flow, and failure behavior of granular materials. Focusing on one specific type of granular material …

    clemson Repository record for Discrete Element Modeling of the Shape- and History-Dependent Behavior of Granular Materials (opens in a new tab)

  6. Automatic Parallelization of Tiled Stencil Loop Nests on GPUs

    … and implement a compiler framework based on the polyhedral model. The compiler automatically parallelizes loop nests; especially stencil kernels, into efficient GPU code by loop tiling transformations which the polyhedral model describes. To enhance parallel performance, we introduce three …

    unsw Repository record for Automatic Parallelization of Tiled Stencil Loop Nests on GPUs (opens in a new tab)

  7. Simplifying dependent reductions using duality

    … simplifying dependent reductions in the polyhedral model. To simplify dependent reductions, we will use the mathematical concept of duality which allows us to view this problem through the lens of program dependences. Duality greatly simplifies our approach in comparison with prior work, …

    colostate Repository record for Simplifying dependent reductions using duality (opens in a new tab)

  8. Extending the Polyhedral Compilation Model for Debugging and Optimization of SPMD-style Explicitly-Parallel Programs

    … to be one of the most popular parallel execution models in use today, as exemplified by OpenMP for multi-core systems, CUDA and OpenCL for accelerator systems, and MPI for distributed-memory systems. The basic idea behind the SPMD model, which differentiates it from task-parallel models, is that …

    rice Repository record for Extending the Polyhedral Compilation Model for Debugging and Optimization of SPMD-style Explicitly-Parallel Programs (opens in a new tab)

  9. Portable Sparse Polyhedral Framework Code Generation Using Multi Level Intermediate Representation

    The Sparse Polyhedral Framework (SPF) provides vital support to scientific applications, but is limited in portability. SPF extends the Polyhedral Model to non-affine codes. Scientific applications need the optimizations SPF enables, but current SPF tools don't support GPUs or other heterogeneous …

    boise Repository record for Portable Sparse Polyhedral Framework Code Generation Using Multi Level Intermediate Representation (opens in a new tab)

  10. Automatic parallelization of "inherently" sequential nested loop programs

    … is based on exact dependence analysis in the polyhedral model, and we formulate the problem as a detection that the loop body performs a computation that is equivalent to a matrix multiplication over a semiring. It handles both a single loop as well as arbitrarily nested loops. We also deal …

    colostate Repository record for Automatic parallelization of "inherently" sequential nested loop programs (opens in a new tab)

  11. Application-Specific Memory Subsystem Benchmarking

    … tasks. The build system accommodates the polyhedral model, making the framework provides a convenient testbed for potential code optimizations. AdaptMemBench supports reproducibility in experimental results and facilitates sharing results. Given that small changes in benchmarks have a …

    boise Repository record for Application-Specific Memory Subsystem Benchmarking (opens in a new tab)

  12. 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)

  13. Polyhedral optimizations of RNA-RNA interaction computations

    … kernel perfectly fits the constraints of the polyhedral model, a well-developed technology for optimizing codes that belong to many specialized domains. However, the current state-of-the-art automatic polyhedral tools do not significantly improve the performance of the baseline implementation …

    colostate Repository record for Polyhedral optimizations of RNA-RNA interaction computations (opens in a new tab)

  14. 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)

  15. Fast computation of minimum distance among convex 3D objects

    … to robot components that typically have a simple polyhedral representation, ellipsoid representations of objects are also of interest, partly because of their simplicity. Three different methods of handling the ellipsoid distance are presented: a simple point to ellipsoid iteration, the use of …

    uvic Repository record for Fast computation of minimum distance among convex 3D objects (opens in a new tab)

  16. 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)

  17. Establishing the Connection Between a Triply Periodic Polyhedron and its Hyperbolic Covering Tessellation

    … helps users to view the three dimensional model of the hyperbolic tessellation that is generated. The application developed as part of this thesis provides visualization in two sub-screens. The first one contains a hyperbolic tessellation with a selected motif on it, and the second screen …

    umn Repository record for Establishing the Connection Between a Triply Periodic Polyhedron and its Hyperbolic Covering Tessellation (opens in a new tab)

  18. Domain-specific languages for massively parallel processors

    … and program synthesis techniques using the polyhedral model, interacts productively with our embedded extensions.</p> <p>To further simplify development, we provide a series of customisable heuristics for defining GPU parameters such as the block size (number of threads), grid size and …

    oxford Repository record for Domain-specific languages for massively parallel processors (opens in a new tab)

  19. Automatic Loop Nest Parallelization for the Predictable Execution Model

    … work has introduced a PRedictable Execution Model (PREM) for embedded Multi-Processor Systems-on-a-Chip (MPSoCs). Under PREM, each thread is divided into memory phases, where the code and data required by the thread are moved from main memory to a local memory (cache or scratchpad) or vice …

    waterloo Repository record for Automatic Loop Nest Parallelization for the Predictable Execution Model (opens in a new tab)

  20. Automating the derivation of memory allocations for acceleration of polyhedral programs

    As processors compute power keeps increasing, so do their demands in memory accesses: some computations will require a higher bandwidth and exhibit regular memory access patterns, others will require a lower access latency and exhibit random access patterns. To cope with all demands, memory …

    colostate Repository record for Automating the derivation of memory allocations for acceleration of polyhedral programs (opens in a new tab)

Page 1 of 2