Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs

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 ndimensional grid by adding extra diagonal edges. First, we calculate the optimal makespan for the generalized UETUCT 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 ndimensional grids is low complexity tractable.

• Type: Conference
• Year: 1997
• Where: IPPS
• Authors: Theodore Andronikos, Nectarios Koziris, George K. Papakonstantinou, Panayotis Tsanakas
• Keywords: Distributed And Parallel Computing, Grids, IPPS 1997, N-dimensional Grids, Ndimensional Grids