Abstract
The combinatorial optimization problem of assigning the communicating processes of a parallel program onto a parallel machine so as to minimize its overall execution time is called static mapping.
This paper presents Scotch, a software package for static mapping based on the recursive bipartitioning of both the source process graph and the target architecture graph. Scotch can map any weighted source graph onto any weighted target graph in a time linear in the number of source edges and logarithmic in the number of target vertices. We give brief descriptions of the algorithm and its bipartitioning methods, and compare its performance to other mapping and partitioning programs.
This work was supported by the French GDR PRS
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. T. Barnard and H. D. Simon. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, 6(2): 101–117, 1994.
F. Ercal, J. Ramanujam, and P. Sadayappan. Task allocation onto a hypercube by recursive mincut bipartitionning. JPDC, 10:35–44, 1990.
C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In Proc. 19th Design Autom. Conf., pages 175–181. IEEE, 1982.
M. R. Garey and D. S. Johnson. Computers and Intractablility: A Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco, 1979.
S. W. Hammond. Mapping unstructured grid computations to massively parallel computers. PhD thesis, Rensselaer Polytechnic Institute, feb 1992.
B. Hendrickson and R. Leland. The Chaco user's guide. Technical Report SAND93-2339, Sandia National Laboratories, nov 1993.
B. Hendrickson and R. Leland. An empirical study of static load balancing algorithms. In Proceedings of SHPCC'94, Knoxville, pages 682–685. IEEE, may 1994.
G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. TR 95-035, University of Minnesota, jun 1995.
G. Karypis and V. Kumar. MeTiS — Unstructured Graph Partitioning and Sparse Matrix Ordering System — Version 2.0. University of Minnesota, jun 1995.
D. M. Nicol. Rectilinear partitioning of irregular data parallel computations. Journal of Parallel and Distributed Computing, 23:119–134, 1994.
F. Pellegrini. Application de méthodes de partition à la résolution de problèmes de graphes issus du parallélisme. Thèse de Doctorat, Université Bordeaux I, jan 1995.
F. Pellegrini. Scotch 3.0 User's guide. Technical Report 1095-95, LaBRI, Université Bordeaux I, oct 1995.
A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis, 11(3):430–452, jul 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pellegrini, F., Roman, J. (1996). Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1996. Lecture Notes in Computer Science, vol 1067. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61142-8_588
Download citation
DOI: https://doi.org/10.1007/3-540-61142-8_588
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61142-4
Online ISBN: 978-3-540-49955-8
eBook Packages: Springer Book Archive