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

Authors:
Theodore Andronikos;Nectarios Koziris;George K. Papakonstantinou;Panayotis Tsanakas
Affiliations:
-;-;-;-
Venue:
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Year:
1997

Citing 7
Cited 3

UET scheduling with unit interprocessor communication delays

Discrete Applied Mathematics
Lower bounds and efficient algorithms for multiprocessor scheduling of dags with communication delays

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Towards an architecture-independent analysis of parallel algorithms

SIAM Journal on Computing
On the Granularity and Clustering of Directed Acyclic Task Graphs

IEEE Transactions on Parallel and Distributed Systems
DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors

IEEE Transactions on Parallel and Distributed Systems
Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract)

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
NP-complete scheduling problems

Journal of Computer and System Sciences

Scheduling UET grids with unit communication time delays into unbounded/fixed number of processors

Highly parallel computaions
Optimal scheduling for UET-UCT grids into fixed number of processors

EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
A flexible general-purpose parallelizing architecture for nested loops in reconfigurable platforms

PATMOS'07 Proceedings of the 17th international conference on Integrated Circuit and System Design: power and timing modeling, optimization and simulation

Quantified Score

Hi-index	0.00

Visualization

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.