scholarly journals LooPo-HOC: A Grid Component with Embedded Loop Parallelization

2008 ◽  
pp. 261-273 ◽  
Author(s):  
Johannes Tomasoni ◽  
Jan Dünnweber ◽  
Sergei Gorlatch ◽  
Michael Claßen ◽  
Philipp Claßen ◽  
...  
Keyword(s):  
1988 ◽  
Author(s):  
Doug Baxter ◽  
Joel Salz ◽  
Martin Schultz ◽  
Stan Eisenstat
Keyword(s):  

Author(s):  
Christos Vasiladiotis ◽  
Roberto Castaneda Lozano ◽  
Murray Cole ◽  
Bjorn Franke
Keyword(s):  

1997 ◽  
Vol 07 (04) ◽  
pp. 379-392 ◽  
Author(s):  
Alain Darte ◽  
Georges-André Silber ◽  
Frédéric Vivien

Tiling is a technique used for exploiting medium-grain parallelism in nested loops. It relies on a first step that detects sets of permutable nested loops. All algorithms developed so far consider the statements of the loop body as a single block, in other words, they are not able to take advantage of the structure of dependences between different statements. In this paper, we overcame this limitation by showing how the structure of the reduced dependence graph can be taken into account for detecting more permutable loops. Our method combines graph retiming techniques and graph scheduling techniques. It can be viewed as an extension of Wolf and Lam's algorithm to the case of loops with multiple statements. Loan independent dependences play a particular role in our study, and we show how the way we handle them can be useful for fine-grain loop parallelization as well.


Author(s):  
Yoichi Omori ◽  
Kazuki Joe ◽  
Akira Fukuda

Author(s):  
Jan Dünnweber ◽  
Sergei Gorlatch
Keyword(s):  

2011 ◽  
pp. 1401-1401
Author(s):  
David Wonnacott ◽  
Barbara Chapman ◽  
James LaGrone ◽  
Karl Fürlinger ◽  
Stephen W Poole ◽  
...  
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document