Abstract
The paper is devoted to the problem of mapping affine loop nests onto distributed memory parallel computers. An algorithm to find an efficient scheduling and distribution of data and operations to virtual processors is presented. It reduces the sheduling and the alignment problems to the solving of linear algebraic equations. The algorithm finds the maximal degree of pipelined parallelism and tries to minimize the number of nonlocal communications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Darte, A., Robert, Y.: Affine-by-statement scheduling of uniform and affine loop nests over parametric domains. J. of Parallel and Distrib. Computing 29(1), 43–59 (1995)
Feautrier, P.: Some efficient solutions to the affine scheduling problem. Int. J. of Parallel Programming 25(5,6), 313–348, 389–420 (1992)
Voevodin, V.V., Voevodin, Vl.V.: Parallel computing, St. Petersburg, BHV-Petersburg (2002) (in Russian)
Dion, M., Robert, Y.: Mapping affine loop nests. Parallel Computing 22, 1373–1397 (1996)
Frolov, A.V.: Optimization of arrays allocation in FORTRAN programs for multiprocessor computing systems. Programming and Computer Software 24, 144–154 (1998)
Lee, H.-J., Fortes, J.A.B.: Automatic generation of modular time-spase mappings and data alignments. J. of VLSI Signal Processing 19, 195–208 (1998)
Darte, A., Robert, Y.: Mapping uniform loop nests onto distributed memory architectures. Parallel Computing 20, 679–710 (1994)
Lim, A.W., Lam, M.S.: Maximizing parallelism and minimizing synchronization with affine partitions. Parallel Computing 24(3,4), 445–475 (1998)
Lim, A.W., Lam, M.S.: An affine partitioning algorithm to maximize parallelism and minimize communication. In: Proceedings of the 1st ACM SIGARCH International Conference on Supercomputing (1999)
Bakhanovich, S.V., Likhoded, N.A.: A method for parallelizing algorithms by vector scheduling functions. Programming and Computer Software 27(4), 194–200 (2001)
Frolov, A.V.: Finding and using directed cuts of real graphs of algorithms. Programming and Computer Software 23(4), 230–239 (1997)
Lim, A.W., Liao, S.-W., Lam, M.S.: Blocking and array contraction across arbitrary nested loops using affine partitioning. In: Proceedings of the ACM SIGPLAN Simposium on Principles and Practice of Programming Languages (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Adutskevich, E.V., Likhoded, N.A. (2003). Mapping Affine Loop Nests: Solving of the Alignment and Scheduling Problems. In: Malyshkin, V.E. (eds) Parallel Computing Technologies. PaCT 2003. Lecture Notes in Computer Science, vol 2763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45145-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-45145-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40673-0
Online ISBN: 978-3-540-45145-7
eBook Packages: Springer Book Archive