dc.contributor.author |
Andronikos, T |
en |
dc.contributor.author |
Koziris, N |
en |
dc.contributor.author |
Papakonstantinou, G |
en |
dc.contributor.author |
Tsanakas, P |
en |
dc.date.accessioned |
2014-03-01T01:15:01Z |
|
dc.date.available |
2014-03-01T01:15:01Z |
|
dc.date.issued |
1999 |
en |
dc.identifier.issn |
0743-7315 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/13289 |
|
dc.subject |
Grids |
en |
dc.subject |
Makespan |
en |
dc.subject |
Optimal number of processors |
en |
dc.subject |
UET-UCT scheduling |
en |
dc.subject.classification |
Computer Science, Theory & Methods |
en |
dc.subject.other |
SIZE SYSTOLIC ARRAYS |
en |
dc.subject.other |
COMMUNICATION DELAYS |
en |
dc.subject.other |
ALGORITHMS |
en |
dc.title |
Optimal Scheduling for UET/UET-UCT Generalizedn-Dimensional Grid Task Graphs |
en |
heal.type |
journalArticle |
en |
heal.identifier.primary |
10.1006/jpdc.1999.1530 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1006/jpdc.1999.1530 |
en |
heal.language |
English |
en |
heal.publicationDate |
1999 |
en |
heal.abstract |
The ii-dimensional grid is one of the most representative patterns of data now in parallel computation. Many scientific algorithms, which require nearest neighbor communication in a lattice space, are modeled by a task graph with the properties of a simple or enhanced grid. The two most frequently used scheduling models for grids are the unit execution time-zero communication delay (UET) and the unit execution time-unit communication time (UET-UCT). In this paper we introduce an enhanced model of the ii-dimensional grid by adding extra diagonal edges and allowing unequal boundaries for each dimension. For this generalized grid topology we establish the optimal makespan for both cases of UET/UET-UCT grids. Then we give a closed formula that calculates the minimum number of processors required to achieve the optimal makespan. Finally, we propose a low-complexity optimal time and processor scheduling strategy for both cases. (C) 1999 Academic Press. |
en |
heal.publisher |
ACADEMIC PRESS INC |
en |
heal.journalName |
Journal of Parallel and Distributed Computing |
en |
dc.identifier.doi |
10.1006/jpdc.1999.1530 |
en |
dc.identifier.isi |
ISI:000080180900002 |
en |
dc.identifier.volume |
57 |
en |
dc.identifier.issue |
2 |
en |
dc.identifier.spage |
140 |
en |
dc.identifier.epage |
165 |
en |