Optimal Loop Parallelization in Dimensional Index Spaces

Drositis, I; Andronikos, T; Kalathas, M; Papakonstantinou, G; Koziris, N

dc.contributor.author	Drositis, I	en
dc.contributor.author	Andronikos, T	en
dc.contributor.author	Kalathas, M	en
dc.contributor.author	Papakonstantinou, G	en
dc.contributor.author	Koziris, N	en
dc.date.accessioned	2014-03-01T01:51:42Z
dc.date.available	2014-03-01T01:51:42Z
dc.date.issued	2002	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/26390
dc.subject	Communication Cost	en
dc.subject	Indexation	en
dc.subject	Linear Transformation	en
dc.subject	Loop Scheduling	en
dc.subject	Nested Loops	en
dc.subject	Optimal Scheduling	en
dc.title	Optimal Loop Parallelization in Dimensional Index Spaces	en
heal.type	journalArticle	en
heal.publicationDate	2002	en
heal.abstract	This paper deals with the problem of scheduling uniform nested loops. The majority of the scheduling methods use linear transformations, while they consider no communica- tion cost. The presented method is based on the geomet- ric properties of the index space. It leads to a nearly opti- mal schedule and outperforms the existing scheduling tech- niques. It is the first	en