The EDGE language: Extended general einsums for graph algorithms
In this work, we propose a unified abstraction for graph algorithms: the Extended General
Einsums language, or EDGE. The EDGE language expresses graph algorithms in the …
Einsums language, or EDGE. The EDGE language expresses graph algorithms in the …
Polyhedral bubble insertion: A method to improve nested loop pipelining for high-level synthesis
High-level synthesis (HLS) allows hardware to be directly produced from behavioral
description in C/C++, thus accelerating the design process. Loop pipelining is a key …
description in C/C++, thus accelerating the design process. Loop pipelining is a key …
Optimizing remote accesses for offloaded kernels: Application to high-level synthesis for FPGA
In the context of the high-level synthesis (HLS) of regular kernels offloaded to FPGA and
communicating with an external DDR memory, we show how to automatically generate …
communicating with an external DDR memory, we show how to automatically generate …
Coarse-grained loop parallelization: Iteration space slicing vs affine transformations
A Beletska, W Bielecki, A Cohen, M Palkowski… - Parallel Computing, 2011 - Elsevier
Automatic coarse-grained parallelization of program loops is of great importance for parallel
computing systems. This paper presents the theory of Iteration Space Slicing aimed at …
computing systems. This paper presents the theory of Iteration Space Slicing aimed at …
Scalable and structured scheduling
P Feautrier - International Journal of Parallel Programming, 2006 - Springer
Scheduling a program (ie constructing a timetable for the execution of its operations) is one
of the most powerful methods for automatic parallelization. A schedule gives a blueprint for …
of the most powerful methods for automatic parallelization. A schedule gives a blueprint for …
Verified code generation for the polyhedral model
N Courant, X Leroy - Proceedings of the ACM on Programming …, 2021 - dl.acm.org
The polyhedral model is a high-level intermediate representation for loop nests that supports
elegantly a great many loop optimizations. In a compiler, after polyhedral loop optimizations …
elegantly a great many loop optimizations. In a compiler, after polyhedral loop optimizations …
Refactoring GrPPI: generic refactoring for generic parallelism in C++
Abstract The Generic Reusable Parallel Pattern Interface (GrPPI) is a very useful abstraction
over different parallel pattern libraries, allowing the programmer to write generic patterned …
over different parallel pattern libraries, allowing the programmer to write generic patterned …
Efficient nested loop pipelining in high level synthesis using polyhedral bubble insertion
Loop pipelining is a key transformation in high-level synthesis tools as it helps maximizing
both computational throughput and hardware utilization. Nevertheless, it somewhat looses …
both computational throughput and hardware utilization. Nevertheless, it somewhat looses …
Hardware synthesis for multi-dimensional time
We introduce some basic principles for extending the classical systolic synthesis
methodology to multidimensional time. Multidimensional scheduling enables complex …
methodology to multidimensional time. Multidimensional scheduling enables complex …
FPGA-specific synthesis of loop-nests with pipelined computational cores
The increased capacity and enhanced features of modern FPGAs opens new opportunities
for their use as application accelerators. However, for FPGAs to be accepted as mainstream …
for their use as application accelerators. However, for FPGAs to be accepted as mainstream …