Abstract
Parallel adaptive hp finite element methods (FEM), in which both grid size h and local polynomial order p are dynamically altered, are the most effective discretization schemes for a large class of problems. The greatest difficulty in using these methods on parallel computers is the design of efficient schemes for data storage, access and distribution. We describe here the development of a comprehensive infrastructureAdaptive Finite Elements Application Programmers Interface (AFEAPI), that addresses these concerns. AFEAPI provides a simple base for users to develop their own parallel adaptive hp finite element codes. It is responsible for the parallel mesh database, mesh partitioning and redistribution and optionally solution of the large irregularly sparse systems of linear equations generated in these schemes. Dynamic hashing schemes and B-trees are used to store and access the distributed unstructured data efficiently.
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
Sagan, H.: Space Filling Curves. Springer, New York (1995)
Carter Edwards, H., Browne, J.C.: Scalable Dynamic Distributed Array and Its Application to a Parallel hp adaptive Finite Element Code. In: Procedings of POOMA 1996: Parallel Object-Oriented Methods and Applications Conference, Santa Fe, New Mexico (February 1996)
Patra, A., Oden, J.T.: Problem Decomposition Strategies for Adaptive hp Finite Element Methods. Computing Systems in Engineering 6(2) (1995)
Patra, A., Oden, J.T.: Computational Techniques for Adaptive hp Finite Element Methods. Finite Elements in Analysis and Design 25, 27–39 (1997)
Patra, A.: Fast Solvers for Adaptive hp Finite Element Methods. In: Eighth SIAM Conference on Parallel Processing, Minneapolis (March 1997)
Patra, A., Kim, D.W.: Efficient Mesh partitioning for adaptive hp meshes. In: XIth Domain Decomposition Conference, Greenwich, U.K., July 21-24 (1998)
Kohn, S.R., Baden, S.B.: A Robust Parallel Programming Mod el for Dynamic Non-uniform Scientific Computations. In: Proceedings of the Scalable High Performance Computing Conference (SHPCC 1994), pp. 509–597. IEEE Computer Society Press, Los Alamitos (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Patra, A.K., Long, J., Laszloffy, A. (1999). Efficient Parallel Adaptive Finite Element Methods Using Self-Scheduling Data and Computations. In: Banerjee, P., Prasanna, V.K., Sinha, B.P. (eds) High Performance Computing – HiPC’99. HiPC 1999. Lecture Notes in Computer Science, vol 1745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46642-0_52
Download citation
DOI: https://doi.org/10.1007/978-3-540-46642-0_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66907-4
Online ISBN: 978-3-540-46642-0
eBook Packages: Springer Book Archive