Abstract
In this paper we describe the basic scheme of an algorithm for optimising graph partitions which arise in mapping an application represented by an undirected graph to parallel computers. We introduce the domain of a minimum and two kinds of operations, simple migration and subgraph migration. The first one consists of moving one vertex of a graph at a time and can be effectively used inside domains to reach local minima. The second is used to change the domain, when the first one cannot operate. Subgraph migration consists of moving a connected subgraph to get out of the local minimum. We give the properties and principles of subset migration, and demonstrate these by experimental results.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S.T. Barnard and H.D. Simon. A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems. In Proceedings of the 6th SIAM Conference on Parallel Processing for Scientific Computing, pages 711–718, 1993.
B. Hendrickson and R. Leland. An Improved Spectral Graph partitioning Algorithm for mapping parallel Computations. Technical Report SAND92-1460, Sandia National labs, Albuquerque, NM., 1992.
B. Hendrickson and R. Leland. A Multilevel Algorithm for Partitioning Graphs. Technical Report SAND93-1301, Sandia National labs, Albuquerque, NM., 1993.
D.S. Johnson, C.R. Aragon, L.A. Mcgeoch, and C. Schevon. Optimization by Simulated Annealing: an Experimental Evaluation; Part I, Graph Partitioning. Operations Research, 37(6):865–892, November–December 1989.
D.S. Johnson, C.R. Aragon, L.A. Mcgeoch, and C. Schevon. Optimization by Simulated Annealing: an Experimental Evaluation; Part II, Graph Coloring and Number Partitioning. Operations Research, 39(3):378–406, May–June 1991.
G. Karypis and V. Kumar. A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs. Technical Report TR 95-035, Department of Computer Science, University of Minnesota, July 1995.
G. Karypis and V. Kumar. Parallel Multilevel Graph Partitioning. Technical Report TR. 95-036, Department of Computer Science, University of Minnesota, June 1995.
M.T. Kechadi and P. Kiernan. A Threshold Heuristic Scheduling Algorithm in Parallel and Distributed Systems. Technical Report TR. 95-05, University College Dublin, Belfield Dublin 4, Ireland, September 1995.
B. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. Bell Syst. Tech. Journal, 29:291–307, February 1970.
G.L. Miller, S-H. Teng, and S.A. Vavasis. A Unified Geometric Approach to Graph Separators. In Proceedings of the 31st Annual Symposium on Foundations of Computer Science, pages 538–547, 1991.
A. Pothen, H.D. Simon, and K-P. Lion. Partitioning Sparse Matrices with Eigenvectors of Graphs. SIAM Journal of Matrix Analysis and Applications, 11(3):430–452, July 1990.
A. Pothen, H.D. Sinon, L. Wang, and S.T. Barnard. Towards a Fast Implementation of Spectral Nested Disection. In Proceedings of Supercomputing'92, pages 42–51, 1992.
K. Shahookar and P. Mazumder. VLSI Cell Placement techniques. ACM Computing Surveys, 23(2):143–220, June 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kechadi, MT., Hegarty, D.F. (1998). A parallel technique for partitioning nodes of weighted graphs. In: Sloot, P., Bubak, M., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1998. Lecture Notes in Computer Science, vol 1401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037172
Download citation
DOI: https://doi.org/10.1007/BFb0037172
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64443-9
Online ISBN: 978-3-540-69783-1
eBook Packages: Springer Book Archive