A Method for Parallelizing Algorithms by Vector Scheduling Functions

Authors:
S. V. Bakhanovich;N. A. Likhoded
Affiliations:
Institute of Mathematics, Belarussian Academy of Sciences, ul. Surganova 11, Minsk, 220072 Belarus bsv@im.bas-net.by;Institute of Mathematics, Belarussian Academy of Sciences, ul. Surganova 11, Minsk, 220072 Belarus bsv@im.bas-net.by
Venue:
Programming and Computing Software
Year:
2001

Citing 4
Cited 1

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

International Journal of Parallel Programming
Mapping uniform loop nests onto distributed memory architectures

Parallel Computing
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

A consistent generation of pipeline parallelism and distribution of operations and data among processors

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

A technique for parallelizing multidimensional algorithms with uniform dependencies designed for the implementation on parallel architectures of smaller dimensionalities is suggested. The technique is based on multidimensional separate scheduling of the basic operations of the algorithm. A procedure for the construction of a scheduling (parallelizing) function on the basis of theoretical results is suggested.