An Efcient Scheduling of Uniform Dependence Loops

Andronikos, T; Kalathas, M; Ciorba, F; Theodoropoulos, P; Papakonstantinou, G

dc.contributor.author	Andronikos, T	en
dc.contributor.author	Kalathas, M	en
dc.contributor.author	Ciorba, F	en
dc.contributor.author	Theodoropoulos, P	en
dc.contributor.author	Papakonstantinou, G	en
dc.date.accessioned	2014-03-01T01:52:28Z
dc.date.available	2014-03-01T01:52:28Z
dc.date.issued	2003	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/26631
dc.relation.uri	http://www.cslab.ece.ntua.gr/~cflorina/papers/2003-hercma-ciorba.pdf	en
dc.subject	Binary Search	en
dc.subject	Indexation	en
dc.subject	Nested Loops	en
dc.subject	Upper Bound	en
dc.subject	Lower Bound	en
dc.subject	Processing Element	en
dc.title	An Efcient Scheduling of Uniform Dependence Loops	en
heal.type	journalArticle	en
heal.publicationDate	2003	en
heal.abstract	Usually the most computationally intensive part of a program is attributed to the nested loops it contains. It is therefore of interest to try to parallelize nested loops in order to reduce the overall computation time. A special category of FOR(DO) nested loops are the uniform dependence loops, which are the focus of this paper. The primary goals in this	en