Message-passing code generation for non-rectangular tiling transformations

Goumas, G; Drosinos, N; Athanasaki, M; Koziris, N

dc.contributor.author	Goumas, G	en
dc.contributor.author	Drosinos, N	en
dc.contributor.author	Athanasaki, M	en
dc.contributor.author	Koziris, N	en
dc.date.accessioned	2014-03-01T01:24:38Z
dc.date.available	2014-03-01T01:24:38Z
dc.date.issued	2006	en
dc.identifier.issn	0167-8191	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/17365
dc.subject	Clusters	en
dc.subject	Code generation	en
dc.subject	Data parallel	en
dc.subject	Loop tiling	en
dc.subject	MPI	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Data storage equipment	en
dc.subject.other	Iterative methods	en
dc.subject.other	Optimization	en
dc.subject.other	Parallel algorithms	en
dc.subject.other	Parallel processing systems	en
dc.subject.other	Code generation	en
dc.subject.other	Communication pattern	en
dc.subject.other	Loop tiling	en
dc.subject.other	Parallel code	en
dc.subject.other	Distributed database systems	en
dc.title	Message-passing code generation for non-rectangular tiling transformations	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.parco.2006.07.003	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.parco.2006.07.003	en
heal.language	English	en
heal.publicationDate	2006	en
heal.abstract	Tiling is a well known loop transformation used to reduce communication overhead in distributed memory machines. Although a lot of theoretical research has been done concerning the selection of proper tile shapes that reduce processor idle times, there is no complete approach to automatically parallelize non-rectangularly tiled iteration spaces and consequently there are no actual experimental results to verify previous theoretical work on the effect of the tile shape on the overall completion time of a tiled algorithm. This paper presents a complete end-to-end framework to generate automatic message-passing code for tiled iteration spaces. It considers general parallelepiped tiling transformations and convex iteration spaces. We aim to address all problems concerning data parallel code generation efficiently by transforming the initial non-rectangular tile to a rectangular one. In this way, data distribution and the respective communication pattern become simple and straightforward. We have implemented our parallelizing techniques in a tool which automatically generates MPI code and run several benchmarks on a cluster of PCs. Our experimental results show the merit of general parallelepiped tiling transformations, and verify previous theoretical work on scheduling-optimal, non-rectangular tile shapes. (c) 2006 Elsevier B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Parallel Computing	en
dc.identifier.doi	10.1016/j.parco.2006.07.003	en
dc.identifier.isi	ISI:000242499800001	en
dc.identifier.volume	32	en
dc.identifier.issue	10	en
dc.identifier.spage	711	en
dc.identifier.epage	732	en