Name
Abstract | ||
|---|---|---|
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. |
Year | Venue | DocType |
|---|---|---|
1999 | J. Parallel Distrib. Comput. | Journal |
Volume | Issue | Citations |
57 | 2 | 11 |
PageRank | References | Authors |
0.66 | 12 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Theodore Andronikos | 1 | 105 | 15.07 |
| N. Koziris | 2 | 1015 | 107.53 |
| George K. Papakonstantinou | 3 | 159 | 61.88 |
| Panayotis Tsanakas | 4 | 125 | 19.81 |