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"”.
-
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 …
-
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 …
-
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. …
-
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
-
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 …
-
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 …
-
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, …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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, …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
-
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 …
Page 1 of 2