Scheduling nested loops with the least number of processors

Andronikos, T; Kalathas, M; Ciorba, PM; Theodoropoulos, P; Papakonstantinou, G; Tsanakas, P

dc.contributor.author	Andronikos, T	en
dc.contributor.author	Kalathas, M	en
dc.contributor.author	Ciorba, PM	en
dc.contributor.author	Theodoropoulos, P	en
dc.contributor.author	Papakonstantinou, G	en
dc.contributor.author	Tsanakas, P	en
dc.date.accessioned	2014-03-01T02:42:20Z
dc.date.available	2014-03-01T02:42:20Z
dc.date.issued	2003	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30952
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-1442277777&partnerID=40&md5=e633e0417e35a22a6f19dff4a8dce182	en
dc.relation.uri	http://www.informatik.uni-trier.de/~ley/db/conf/appinf/appinf2003.html#AndronikosKCTPT03	en
dc.subject	Lower bound	en
dc.subject	Optimal execution time	en
dc.subject	Scheduling	en
dc.subject	UET model	en
dc.subject	Upper bound	en
dc.subject.other	Algorithms	en
dc.subject.other	Computational complexity	en
dc.subject.other	Graph theory	en
dc.subject.other	Scheduling	en
dc.subject.other	Lower bound	en
dc.subject.other	Optimal execution time	en
dc.subject.other	UET model	en
dc.subject.other	Upper bound	en
dc.subject.other	Multiprocessing systems	en
dc.title	Scheduling nested loops with the least number of processors	en
heal.type	conferenceItem	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 the nested loops in order to reduce the overall computation time. A special category of FOR(DO) nested loops are the uniform dependence loops, which yield efficient parallelization techniques and are the focus of this paper. The primary goals in this area of research are: (1) achieving the optimal parallel time and (2) minimizing the number of processing elements required for the execution of the parallel program. In this paper we present a new dynamic lower bound on the number of processors needed for scheduling and vie use a decision algorithm to verify that all uniform dependence loops can achieve this bound.	en
heal.journalName	IASTED International Multi-Conference on Applied Informatics	en
dc.identifier.volume	21	en
dc.identifier.spage	713	en
dc.identifier.epage	718	en