Optimal scheduling for UET-UCT generalized n-dimensional grid task graphs

Andronikos, Theodore; Koziris, Nectarios; Papakonstantinou, George; Tsanakas, Panayiotis

dc.contributor.author	Andronikos, Theodore	en
dc.contributor.author	Koziris, Nectarios	en
dc.contributor.author	Papakonstantinou, George	en
dc.contributor.author	Tsanakas, Panayiotis	en
dc.date.accessioned	2014-03-01T02:41:29Z
dc.date.available	2014-03-01T02:41:29Z
dc.date.issued	1997	en
dc.identifier.issn	10637133	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/30486
dc.subject	Data Flow	en
dc.subject	Low Complexity	en
dc.subject	Optimal Scheduling	en
dc.subject	Parallel Computer	en
dc.subject	Scheduling Problem	en
dc.subject	Task Graphs	en
dc.subject.other	Computational complexity	en
dc.subject.other	Computational methods	en
dc.subject.other	Computer simulation	en
dc.subject.other	Graph theory	en
dc.subject.other	Optimization	en
dc.subject.other	Problem solving	en
dc.subject.other	Resource allocation	en
dc.subject.other	Space scheduling strategy	en
dc.subject.other	Time scheduling strategy	en
dc.subject.other	Unit execution/unit communication time (UET UCT)	en
dc.subject.other	Parallel processing systems	en
dc.title	Optimal scheduling for UET-UCT generalized n-dimensional grid task graphs	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/IPPS.1997.580872	en
heal.identifier.secondary	http://dx.doi.org/10.1109/IPPS.1997.580872	en
heal.publicationDate	1997	en
heal.abstract	The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution - unit communication time (UET-UCT). In this paper we enhance the model of n-dimensional grid by adding extra diagonal edges. First, we calculate the optimal makespan for the generalized UET-UCT grid topology and, then, we establish the minimum number of processors required, to achieve the optimal makespan. Furthermore, we solve the scheduling problem for generalized n-dimensional grids by proposing an optimal time and space scheduling strategy. We thus prove that UET-UCT scheduling of generalized n-dimensional grids is low complexity tractable.	en
heal.publisher	IEEE, Los Alamitos, CA, United States	en
heal.journalName	Proceedings of the International Parallel Processing Symposium, IPPS	en
dc.identifier.doi	10.1109/IPPS.1997.580872	en
dc.identifier.spage	146	en
dc.identifier.epage	151	en