Two-Dimensional Scheduling of Algorithms with Uniform Dependencies

Authors:
N. A. Likhoded
Affiliations:
-
Venue:
PaCT '999 Proceedings of the 5th International Conference on Parallel Computing Technologies
Year:
1999

Citing 5
Cited 1

VLSI array processors

VLSI array processors
Some efficient solutions to the affine scheduling problem: I. One-dimensional time

International Journal of Parallel Programming
The Organization of Computations for Uniform Recurrence Equations

Journal of the ACM (JACM)
Mapping Nested Loop Algorithms into Multidimensional Systolic Arrays

IEEE Transactions on Parallel and Distributed Systems
On Time Mapping of Uniform Dependence Algorithms into Lower Dimensional Processor Arrays

IEEE Transactions on Parallel and Distributed Systems

Scheduling Functions for Spatiotemporal Mapping of d-Dimensional Algorithms with Homogeneous Dependences on (d-2)-Dimensional Parallel Architectures

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

A formal method to schedule algorithms for the special case of 3D → 1D spatial mapping is proposed. The method is based on a technique of two-dimensional scheduling. Initial 3D algorithms should be represented as a system of uniform recurrence equations or as a uniform loopn est. The method can be generalized for the case of 4D → 2D, 5D → 3D spatial mapping or for the case of affine scheduling with the same linear part.