Precise Tiling for Uniform Loop Nests

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Pierre-Yves Calland Articles by Tanguy Risset

1995 IEEE International Conference on Application-Specific Array Processors (ASAP'95)

Strasbourg, France

July 24-July 26

ISBN: 0-8186-7109-2

	ASCII Text	x
	Pierre-Yves Calland, Tanguy Risset, "Precise Tiling for Uniform Loop Nests," Application-Specific Systems, Architectures and Processors, IEEE International Conference on, pp. 330, 1995 IEEE International Conference on Application-Specific Array Processors (ASAP'95), 1995.

	BibTex	x
	@article{ 10.1109/ASAP.1995.522937, author = {Pierre-Yves Calland and Tanguy Risset}, title = {Precise Tiling for Uniform Loop Nests}, journal ={Application-Specific Systems, Architectures and Processors, IEEE International Conference on}, volume = {0}, year = {1995}, issn = {1063-6862}, pages = {330}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASAP.1995.522937}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Application-Specific Systems, Architectures and Processors, IEEE International Conference on TI - Precise Tiling for Uniform Loop Nests SN - 1063-6862 SP EP A1 - Pierre-Yves Calland, A1 - Tanguy Risset, PY - 1995 KW - loop nest KW - uniform dependence algorithm KW - partitionning KW - tiling KW - convex cone VL - 0 JA - Application-Specific Systems, Architectures and Processors, IEEE International Conference on ER -

Pierre-Yves Calland, Ecole Nationale Superieure de Lyon

Tanguy Risset, IRISA, Campus de Beaulieu

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASAP.1995.522937

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.