Abstract
We use a parallel direct solver based on the Schur complement method for solving large sparse linear systems arising from the finite element method. A domain decomposition of a problem is performed using a graph partitioning. It results in sparse submatrices with balanced sizes. An envelope method is used to factorize these submatrices. However, the memory requirements to store them and the computational cost to factorize them depends heavily on their structure. We propose a technique that modifies the multilevel graph partitioning schema to balance real computational load or memory requirements of the solver.
This work was supported by IBS3086102 grant of Czech Academy of Science and by MŠMT under research program #J04/98:212300014.
Chapter PDF
Similar content being viewed by others
References
George, A., Liu, J.: Computer Solution of Large Sparse Positive Definite Systems. Prentice Hall, Englewood Cliffs (1981)
Hendricson, B.: Graph partitioning and parallel solvers: Has emperor no clothes? In: Ferreira, A., Rolim, J.D.P., Teng, S.-H. (eds.) IRREGULAR 1998. LNCS, vol. 1457, pp. 218–225. Springer, Heidelberg (1998)
Hendricson, B.: Load balancing fictions, falsehoods and fallacies. Applied Mathematical Modelling 25, 99–108 (2000)
Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359–392 (1998)
Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. J. of Parallel and Distrib. Comput. 48, 96–129 (1998)
Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proceedings of the 1995 ACM/IEEE conference on Supercomputing (CDROM), p. 28. ACM Press, New York (1995)
Walshaw, C., Cross, M.: Mesh Partitioning: a Multilevel Balancing and Refinement Algorithm. SIAM J. Sci. Comput. 22, 63–80 (2000)
Pellegrini, F.: Static mapping by dual recursive bipartitioning of process and architecture graphs. In: SHPCC 1994, pp. 486–493 (1994)
Kumfert, G., Pothen, A.: Two improved algorithms for envelope and wavefront reduction. BIT 37, 559–590 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Medek, O., Tvrdík, P., Kruis, J. (2004). Load and Memory Balanced Mesh Partitioning for a Parallel Envelope Method. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds) Euro-Par 2004 Parallel Processing. Euro-Par 2004. Lecture Notes in Computer Science, vol 3149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27866-5_96
Download citation
DOI: https://doi.org/10.1007/978-3-540-27866-5_96
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22924-7
Online ISBN: 978-3-540-27866-5
eBook Packages: Springer Book Archive