@inproceedings{86933ad1b45a449aa6a6eef48b5b9905,
title = "Parallel multilevel algorithms for multi-constraint graph partitioning",
abstract = "Sequential multi-constraint graph partitioners have been developed to address the load balancing requirements of multi-phase simulations. The efficient execution of large multi-phase simulations on high performance parallel computers requires that the multi-constraint partitionings are computed in parallel. This paper presents a parallel formulation of a recently developed multi-constraint graph partitioning algorithm. We describe this algorithm and give experimental results conducted on a 128-processor Cray T3E. We show that our parallel algorithm is able to efficiently compute partitionings of similar edge-cuts as serial multi-constraint algorithms, and can scale to very large graphs. Our parallel multi-constraint graph partitioner is able to compute a threeconstraint 128-way partitioning of a 7.5million node graph in about 7 seconds on 128 processors of a Cray T3E.",
author = "Kirk Schloegel and George Karypis and Vipin Kumar",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.; 6th International European Conference on Parallel Computing, Euro-Par 2000 ; Conference date: 29-08-2000 Through 01-09-2000",
year = "2000",
doi = "10.1007/3-540-44520-x_39",
language = "English (US)",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "296--310",
editor = "Arndt Bode and Thomas Ludwig and Wolfgang Karl and Roland Wism{\"u}ller",
booktitle = "Euro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings",
}