Abstract
This paper investigates two types of overhead due to duplicated local computations, which are frequently encountered in the parallel software of overlapping domain decomposition methods. To remove the duplication-induced overhead, we propose a parallel scheme that disjointly re-distributes the overlapping mesh points among irregularly shaped subdomains. The essence is to replace the duplicated local computations by an increased volume of the inter-processor communication. Since the number of inter-processor messages remains the same, the bandwidth consumption by an increased number of data values can often be justified by the removal of a considerably larger number of floating-point operations and irregular memory accesses in unstructured applications. Obtainable gain in the resulting parallel performance is demonstrated by numerical experiments.
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
Bjørstad, P.E., Espedal, M., Keyes, D. (eds.): Domain Decomposition Methods in Sciences and Engineering. In: Proceedings of the 9th International Conference on Domain Decomposition Methods, Domain Decomposition Press (1998)
Cai, X.: Overlapping domain decomposition methods. In: Langtangen, H.P., Tveito, A. (eds.) Advanced Topics in Computational Partial Differential Equations –Numerical Methods and Diffpack Programming, pp. 57–95. Springer, Heidelberg (2003)
Chan, T.F., Mathew, T.P.: Domain decomposition algorithms. In: Acta Numerica 1994, pp. 61–143. Cambridge University Press, Cambridge (1994)
Karypis, G., Kumar, V.: Metis: Unstructured graph partitioning and sparse matrix ordering system. Technical report, Department of Computer Science, University of Minnesota, Minneapolis/ St. Paul, MN (1995)
Kornhuber, R., Hoppe, R., Périaux, J., Pironneau, O., Widlund, O., Xu, J. (eds.): Domain Decomposition Methods in Sciences and Engineering. In: Proceedings of the 15th International Conference on Domain Decomposition Methods. Lecture Notes in Computational Science and Engineering, vol. 40, Springer, Heidelberg (2004)
Lai, C.-H., Bjørstad, P.E., Cross, M., Widlund, O. (eds.): Domain Decomposition Methods in Sciences and Engineering. In: Proceedings of the 11th International Conference on Domain Decomposition Methods, Domain Decomposition Press (1999)
Langtangen, H.P.: Computational Partial Differential Equations - Numerical Methods and Diffpack Programming, 2nd edn. Texts in Computational Science and Engineering. Springer, Heidelberg (2003)
Smith, B.F., Bjørstad, P.E., Gropp, W.: Domain Decomposition: ParallelMultilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press, Cambridge (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, X. (2006). Improving the Performance of Large-Scale Unstructured PDE Applications. In: Dongarra, J., Madsen, K., Waśniewski, J. (eds) Applied Parallel Computing. State of the Art in Scientific Computing. PARA 2004. Lecture Notes in Computer Science, vol 3732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558958_85
Download citation
DOI: https://doi.org/10.1007/11558958_85
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29067-4
Online ISBN: 978-3-540-33498-9
eBook Packages: Computer ScienceComputer Science (R0)