p.2887
p.2892
p.2900
p.2904
p.2908
p.2912
p.2916
p.2920
p.2925
A Multilevel Hypergraph Partitioning Algorithm Based on Simulated Annealing
Abstract:
Multilevel hypergraph partitioning is a significant and extensively researched problem in combinatorial optimization. In this paper, we present a multilevel hypergraph partitioning algorithm based on simulated annealing approach for global optimization. Experiments on the benchmark suite of several unstructured meshes show that, for 2-, 4-, 8-, 16-and 32-way partitioning, although more running time was demanded, the quality of partition produced by our algorithm are on the average 14% and the maximum 22% better than those produced by partitioning software hMETIS in term of the SOED metric.
Info:
Periodical:
Pages:
2908-2911
Citation:
Online since:
August 2013
Authors:
Price:
Сopyright:
© 2013 Trans Tech Publications Ltd. All Rights Reserved
Share:
Citation: