International audienceWe propose a new programming control structure called ''multifor'', allowing to take advantage of parallelization models that were not naturally attainable with the polytope model before. In a multifor-loop, several loops whose bodies are run simultaneously can be defined. Respective iteration domains are mapped onto each other according to a run frequency -- the grain -- and a relative position -- the offset --. Execution models like dataflow, stencil computations or MapReduce can be represented onto one referential iteration domain, while still exhibiting traditional polyhedral code analysis and transformation opportunities. Moreover, this construct provides ways to naturally exploit hybrid parallelization models, th...
International audienceIn this paper, we present a Thread-Level Speculation (TLS) framework whose mai...
Abstract. The polyhedral model is a powerful framework for automatic optimization and parallelizatio...
The polytope model is one possible (mathematical) basis for par-allelizing sequential computer progr...
We propose a new programming control structure called “multifor”, allowing to take advantage of para...
We propose a new programming structure named XFOR (Multifor), dedicated to data-reuse aware programm...
Loop-nests in most scientific applications perform repetitive operations on array(s) and account for...
International audienceState-of-the-art automatic polyhedral parallelizers extract and express parall...
The model-based transformation of loop programs is a way of detecting fine-grained parallelism in se...
International audienceThis paper presents a new method to parallelize programs, adapted to manycore ...
International audienceThe polyhedral model is a powerful framework for automatic optimization and pa...
We propose a new programming structure named "XFOR" or "Multifor", dedicated to data-reuse aware pro...
Abstract. We present MetaFork, a metalanguage for multithreaded algorithms based on the fork-join co...
This thesis proposes new extensions to the code generation phase in polyhedral compilers. The main f...
Uncountable loops (such as while loops in C) and if-conditions are some of the most common construct...
Nowadays, parallel computers have become ubiquitous and currentprocessors contain several execution ...
International audienceIn this paper, we present a Thread-Level Speculation (TLS) framework whose mai...
Abstract. The polyhedral model is a powerful framework for automatic optimization and parallelizatio...
The polytope model is one possible (mathematical) basis for par-allelizing sequential computer progr...
We propose a new programming control structure called “multifor”, allowing to take advantage of para...
We propose a new programming structure named XFOR (Multifor), dedicated to data-reuse aware programm...
Loop-nests in most scientific applications perform repetitive operations on array(s) and account for...
International audienceState-of-the-art automatic polyhedral parallelizers extract and express parall...
The model-based transformation of loop programs is a way of detecting fine-grained parallelism in se...
International audienceThis paper presents a new method to parallelize programs, adapted to manycore ...
International audienceThe polyhedral model is a powerful framework for automatic optimization and pa...
We propose a new programming structure named "XFOR" or "Multifor", dedicated to data-reuse aware pro...
Abstract. We present MetaFork, a metalanguage for multithreaded algorithms based on the fork-join co...
This thesis proposes new extensions to the code generation phase in polyhedral compilers. The main f...
Uncountable loops (such as while loops in C) and if-conditions are some of the most common construct...
Nowadays, parallel computers have become ubiquitous and currentprocessors contain several execution ...
International audienceIn this paper, we present a Thread-Level Speculation (TLS) framework whose mai...
Abstract. The polyhedral model is a powerful framework for automatic optimization and parallelizatio...
The polytope model is one possible (mathematical) basis for par-allelizing sequential computer progr...