We propose a new programming control structure called “multifor”, allowing to take advantage of parallelization mod-els 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 off-set –. Execution models like dataflow, stencil computations or MapReduce can be represented onto one referential it-eration domain, while still exhibiting traditional polyhedral code analysis and transformation opportunities. Moreover, this construct provides ways to naturally exploit hybrid par-allelization models, thus significantly improvi...
2013 Spring.Includes bibliographical references.With the introduction of multi-core processors, moti...
On modern architectures, a missed optimization can translate into performance degradations reaching ...
Speculative parallelization is a classic strategy for automatically parallelizing codes that cannot ...
International audienceWe propose a new programming control structure called ''multifor'', allowing t...
The model-based transformation of loop programs is a way of detecting fine-grained parallelism in se...
International audienceThe polyhedral model is a powerful framework for automatic optimization and pa...
We propose a new programming structure named XFOR (Multifor), dedicated to data-reuse aware programm...
Abstract. The polyhedral model is a powerful framework for automatic optimization and parallelizatio...
This thesis proposes new extensions to the code generation phase in polyhedral compilers. The main f...
International audienceState-of-the-art automatic polyhedral parallelizers extract and express parall...
The polytope model is one possible (mathematical) basis for par-allelizing sequential computer progr...
This thesis proposes new extensions to the code generation phase in polyhedral compilers. The main f...
International audienceThis paper presents a new method to parallelize programs, adapted to manycore ...
Loop-nests in most scientific applications perform repetitive operations on array(s) and account for...
Nowadays, parallel computers have become ubiquitous and currentprocessors contain several execution ...
2013 Spring.Includes bibliographical references.With the introduction of multi-core processors, moti...
On modern architectures, a missed optimization can translate into performance degradations reaching ...
Speculative parallelization is a classic strategy for automatically parallelizing codes that cannot ...
International audienceWe propose a new programming control structure called ''multifor'', allowing t...
The model-based transformation of loop programs is a way of detecting fine-grained parallelism in se...
International audienceThe polyhedral model is a powerful framework for automatic optimization and pa...
We propose a new programming structure named XFOR (Multifor), dedicated to data-reuse aware programm...
Abstract. The polyhedral model is a powerful framework for automatic optimization and parallelizatio...
This thesis proposes new extensions to the code generation phase in polyhedral compilers. The main f...
International audienceState-of-the-art automatic polyhedral parallelizers extract and express parall...
The polytope model is one possible (mathematical) basis for par-allelizing sequential computer progr...
This thesis proposes new extensions to the code generation phase in polyhedral compilers. The main f...
International audienceThis paper presents a new method to parallelize programs, adapted to manycore ...
Loop-nests in most scientific applications perform repetitive operations on array(s) and account for...
Nowadays, parallel computers have become ubiquitous and currentprocessors contain several execution ...
2013 Spring.Includes bibliographical references.With the introduction of multi-core processors, moti...
On modern architectures, a missed optimization can translate into performance degradations reaching ...
Speculative parallelization is a classic strategy for automatically parallelizing codes that cannot ...