Abstract
Achieving an even load balance with a low communication overhead is a fundamental task in parallel computing. In this paper we consider the problem of partitioning an array into a number of blocks such that the maximum amount of work in any block is as low as possible. We review different proposed schemes for this problem and the complexity of their communication pattern. We present new approximation algorithms for computing a well balanced generalized block distribution as well as an algorithm for computing an optimal semi-generalized block distribution. The various algorithms are tested and compared on a number of different matrices.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. J. Berger and S. H. Bokhari, A partitioning strategy for nonuniform problems on multiprocessors, IEEE Trans. Comput., C-36 (1987), pp. 570–580.
R. Bleck, S. Dean, M. O'Keefe, and A. Sawdey, A comparison of data-parallel and message-passing versions of the Miami Isopycnic Coordinate Ocean Model (MICOM), Parallel Comput., 21 (1995), pp. 1695–1720.
S. H. Bokhari, T. W. Crockett, and D. M. Nicol, Parametric binary dissection, Tech. Rep. ICASE Report No. 93-39, Nasa Langley Research Center, 1993.
B. Chapman, P. Mehrotra, and H. Zima, Programming in Vienna Fortran, Sci. Prog., 1 (1992), pp. 31–50.
-, High performance Fortran languages: Advanced applications and their implementation, Future Generation Computer Systems, (1995), pp. 401–407.
-, Extending HPF for advanced data parallel applications, IEEE Trans. Par. Dist. Syst., (Fall 1994), pp. 59–70.
G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker, Solving Problems on Concurrent Processors, vol. 1, Prentice-Hall, Englewood Cliffs, NJ, 1988.
M. R. Garey and D. S. Johnson, Computers and Intractability, Freeman, 1979.
M. Grigni and F. Manne, On the complexity of the generalized block distribution. To appear in the proceedings of 1996 Workshop on Irregular Problems, 1996.
High Performance Fortran Forum, High performance language specification. Version 1.0, Sci. Prog., 1–2 (1993), pp. 1–170.
High Performance Fortran Forum Home Page. http://www.crpc.rice.edu/HPFF/home.html.
F. Manne, Load Balancing in Parallel Sparse Matrix Computations, PhD thesis, University of Bergen, Norway, 1993.
F. Manne and T. Sørevik, Optimal partitioning of sequences, J. Alg., 19 (1995), pp. 235–249.
B. Olstad and F. Manne, Efficient partitioning of sequences, IEEE Trans. Comput., 44 (1995), pp. 1322–1326.
M. Ujaldon, S. D. Sharma, J. Saltz, and E. Zapata, Run-time techniques for parallelizing sparse matrix problems, in Proceedings of 1995 Workshop on Irregular Problems, 1995.
M. Ujaldon, E. L. Zapata, B. M. Chapman, and H. P. Zima, Vienna-Fortran/HPF extensions for sparse and irregular problems and their compilation. Submitted to IEEE Trans. Par. Dist. Syst.
H. Zima, H. Bast, and M. Gerndt, Superb: A tool for semi-automatic MIMD/SIMD parallelization, Parallel Comput., (1986), pp. 1–18.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manne, F., Sørevik, T. (1996). Partitioning an array onto a mesh of processors. In: Waśniewski, J., Dongarra, J., Madsen, K., Olesen, D. (eds) Applied Parallel Computing Industrial Computation and Optimization. PARA 1996. Lecture Notes in Computer Science, vol 1184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62095-8_50
Download citation
DOI: https://doi.org/10.1007/3-540-62095-8_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62095-2
Online ISBN: 978-3-540-49643-4
eBook Packages: Springer Book Archive