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

Authors:
P. Tsanakas;T. Andronikos;N. Koziris;G. Papakonstantinou
Affiliations:
National Technical University of Athens, Department of Electrical and Computer Engineering, Computer Science Division, Zografou Campus, Zografou 15773, Greece;National Technical University of Athens, Department of Electrical and Computer Engineering, Computer Science Division, Zografou Campus, Zografou 15773, Greece;National Technical University of Athens, Department of Electrical and Computer Engineering, Computer Science Division, Zografou Campus, Zografou 15773, Greece;National Technical University of Athens, Department of Electrical and Computer Engineering, Computer Science Division, Zografou Campus, Zografou 15773, Greece
Venue:
Highly parallel computaions
Year:
2001

Citing 10
Cited 0

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
Optimal scheduling for UET/VET-UCT generalized n-dimensional grid task graphs

Journal of Parallel and Distributed 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
Automatic Hardware Synthesis of Nested Loops Using UET Grids and VHDL

HPCN Europe '97 Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
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
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

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. Many scientific algorithms, especially nested loops, which require nearest-neighbor communication in a lattice space, are modeled by a task graph or iteration space with the properties of a grid. We consider the nested loop model with unit dependencies thus having an iteration space with the form of a n-dimensional grid. The exact model is that of generalized grids with diagonal edges, allowing unequal boundaries for each dimension. We survey the optimal time scheduling techniques for UET-UCT (unit execution time - unit communication time) grid topologies, using unbounded and bounded number of processors, without allowing task duplication. UET-UCT scheduling of generalized n-dimensional grids is low complexity tractable.