Geometric scheduling of 2-D UET-UCT uniform dependence loops

Authors:
Ioannis Drositis;Theodore Andronikos;Goerge Manis;George Papakonstantinu;Nectarios Koziris
Affiliations:
Compputing Systems Laboratory, Department of Electrical and Cmputer Engineering, National Technical University of Athens, Athens, Greece;Compputing Systems Laboratory, Department of Electrical and Cmputer Engineering, National Technical University of Athens, Athens, Greece;Compputing Systems Laboratory, Department of Electrical and Cmputer Engineering, National Technical University of Athens, Athens, Greece;Compputing Systems Laboratory, Department of Electrical and Cmputer Engineering, National Technical University of Athens, Athens, Greece;Compputing Systems Laboratory, Department of Electrical and Cmputer Engineering, National Technical University of Athens, Athens, Greece
Venue:
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Year:
2002

Citing 10
Cited 0

Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays

IEEE Transactions on Computers
UET scheduling with unit interprocessor communication delays

Discrete Applied Mathematics
Time Optimal Linear Schedules for Algorithms with Uniform Dependencies

IEEE Transactions on Computers
Scheduling In and Out Forests in the Presence of Communication Delays

IEEE Transactions on Parallel and Distributed Systems
Optimal scheduling for UET/VET-UCT generalized n-dimensional grid task graphs

Journal of Parallel and Distributed Computing
The Organization of Computations for Uniform Recurrence Equations

Journal of the ACM (JACM)
The parallel execution of DO loops

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Constructive Methods for Scheduling Uniform Loop Nests

IEEE Transactions on Parallel and Distributed Systems
Geometric Scheduling of 2-D Uniform Dependence Loops

ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Finding an optimal time schedule is one of the primary tasks in the area of parallelizing uniform dependence loops. Due to the existence of dependence vectors, the index space of such a loop, is split into subspaces of points that can be executed at different time instances. The geometric representation of these sets form certain polygonal shapes called patterns, with special attributes and characteristics. In this paper we present a scheduling technique that is based on the geometric attributes of the index space and the dependence vector set. Our strategy can be applied to architectures that consider unit execution-zero communication delay (UET) or unit execution-unit communication (UET-UCT) model, as a new method for transforming UET-UCT problems to UET equivalent ones is presented.