loading...
Precise Tiling for Uniform Loop Nests
Strasbourg, France July 24-July 26
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASAP.1995.5229371995 IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Pierre-Yves Calland, Ecole Nationale Superieure de Lyon
Tanguy Risset, IRISA, Campus de Beaulieu
The subject of this article is a hyperplane partitioning problem applied to perfect loop nests. This work is aimed at increasing the compu- tation granularity to reduce the overhead due to communication time. This study is different from previous works as it takes redundant communications into account. We propose an algorithm giving the optimal solution and var- ious examples to show the soundness of this report.
Index Terms:
loop nest, uniform dependence algorithm, partitionning, tiling, convex cone
Citation:
Pierre-Yves Calland, Tanguy Risset, "Precise Tiling for Uniform Loop Nests," asap, pp.330, 1995 IEEE International Conference on Application-Specific Array Processors (ASAP'95), 1995
Usage of this product signifies your acceptance of the Terms of Use.