Abstract
Using space-filling curves to partition unstructured finite element meshes is a widely applied strategy when it comes to distributing load among several computation nodes. Compared to more elaborated graph partitioning packages, this geometric approach is relatively easy to implement and very fast. However, results are not expected to be as good as those of the latter, but no detailed comparison has ever been published. In this paper we will present results of our experiments comparing the quality of partitionings computed with different types of space-filling curves to those generated with the graph partitioning package Metis.
This work was partly supported by the German Science Foundation (DFG) project SFB-376 and by the IST Program of the EU under contract number IST-1999-14186 (ALCOM-FT).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fox, G., Williams, R., Messina, P.: Parallel Computing Works! Morgan Kaufmann, San Francisco (1994)
Hendrickson, B., Devine, K.: Dynamic load balancing in computational mechanics. Computer Methods in Applied Mechanics and Engineering 184, 485–500 (2000)
Schloegel, K., Karypis, G., Kumar, V.: Graph partitioning for high performance scientific simulations. In: Dongarra, J., et al. (eds.) The Sourcebook of ParallelComputing, Morgan Kaufmann, San Francisco (2002) (to appear)
Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20(1), 359–392 (1998)
Walshaw, C., Cross, M.: Mesh partitioning: A multilevel balancing and refinement algorithm. SIJSSC: SIAM Journal on Scientific and Statistical Computing, apparently renamed SIAM Journal on Scientific Computing 22 (2000)
Hendrickson, B., Leland, R.: The chaco user’s guide — version 2.0 (1994)
Preis, R., Diekmann, R.: Party - a software library for graph partitioning. Advances in Computational Mechanics with Parallel and Distributed Processing, 63–71 (1997)
Preis, R.: The PARTY graphpartitioning-library – user manual – version 1.99
Fiduccia, C.M., Mattheyses, R.M.: A linear time heuristic for improving network partitions. In: Design Automation Conference (May 1984)
Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal 49(2), 291–307 (1970)
Diekmann, R., Monien, B., Preis, R.: Using helpful sets to improve graph bisections. In: Interconnection Networks and Mapping and Scheduling Parallel Computations. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 21, pp. 57–73. AMS Publications (1995)
Hilbert, D.: Über die stetige Abbildung einer Linie auf ein Flächenstück. Mathematische Annalen 38, 459–460 (1891)
Sagan, H.: Space Filling Curves. Springer, Heidelberg (1994)
Wierum, J.-M.: Definition of a new circular space-filling curve – βΩ-indexing. Technical Report TR-001-02, Paderborn Center for Parallel Computing (2002), http://www.upb.de/pc2/
Alber, J., Niedermeier, R.: On multi-dimensional hilbert indexings. In: Hsu, W.-L., Kao, M.-Y. (eds.) COCOON 1998. LNCS, vol. 1449, pp. 329–338. Springer, Heidelberg (1998)
Zumbusch, G.: On the quality of space-filling curve induced partitions. Zeitschrift für Angewandte Mathematik und Mechanik 81(Suppl./1), 25–28 (2001)
Zumbusch, G.: Load balancing for adaptivly refined grids. Technical Report 722, SFB 256, University Bonn (2001)
Hungershöfer, J., Wierum, J.-M.: On the quality of partitions based on space-filling curves. In: Sloot, P.M.A., Tan, C.J.K., Dongarra, J., Hoekstra, A.G. (eds.) ICCS-ComputSci 2002. LNCS, vol. 2331, pp. 36–45. Springer, Heidelberg (2002)
Hendrickson, B., Kolda, T.G.: Graph partitioning models for parallel computing. Parallel Computing 26(12), 1519–1534 (2000)
Walshaw, C.: The graph partitioning archive, http://www.gre.ac.uk/c.walshaw/partition/
Battiti, R., Bertossi, A.: Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Transactions on Computers 48(4), 361–385 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schamberger, S., Wierum, JM. (2003). Graph Partitioning in Scientific Simulations: Multilevel Schemes versus Space-Filling Curves. In: Malyshkin, V.E. (eds) Parallel Computing Technologies. PaCT 2003. Lecture Notes in Computer Science, vol 2763. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45145-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-45145-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40673-0
Online ISBN: 978-3-540-45145-7
eBook Packages: Springer Book Archive