Compiling Tiled Iteration Spaces for Clusters

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-01T02:49:08Z
dc.date.available	2014-03-01T02:49:08Z
dc.date.issued	2002	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/34337
dc.subject	Automatic Generation	en
dc.subject	Clustered Data	en
dc.subject	Code Generation	en
dc.subject	Data Distribution	en
dc.subject	Data Parallel	en
dc.subject	Generalized Convexity	en
dc.subject	Indexing Terms	en
dc.subject	Loop Tiling	en
dc.subject	Message Passing	en
dc.title	Compiling Tiled Iteration Spaces for Clusters	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/CLUSTR.2002.1137768	en
heal.identifier.secondary	http://dx.doi.org/10.1109/CLUSTR.2002.1137768	en
heal.publicationDate	2002	en
heal.abstract	This paper presents a complete end-to-end framework to generate automatic message-passing code for tiled iteration spaces. It considers general parallelepiped tiling transfor- mations and general convex iteration spaces. We aim to address all problems concerning data parallel code gener- ation efficiently by transforming the initial non-rectangular tile to a rectangular one. In this way, data distribution and communication become simple	en
heal.journalName	Cluster Computing	en
dc.identifier.doi	10.1109/CLUSTR.2002.1137768	en