Computational Technology Resources - CCP

M. Kravčenko^1,2, M. Merta¹ and J. Zapletal^1,2

¹ IT4Innovations, VSB-Technical University of Ostrava, Czech Republic
²Department of Applied Mathematics, Faculty of Electrical Engineering and Computer Science, VSB-Technical University of Ostrava, Czech Republic

doi:10.4203/ccp.111.2

purchase the full-text of this paper

M. Kravcenko, M. Merta, J. Zapletal, "Using Discrete Mathematics to Optimize Parallelism in Boundary Element Method", in , (Editors), "Proceedings of the Fifth International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 2, 2017. doi:10.4203/ccp.111.2

Keywords: distributed parallelism, cyclic decomposition of complete graphs, boundary element method, high performance computing, adaptive cross approximation.

Summary

In this work we present an approach for distribution of system matrices occurring in the fast boundary element method (BEM) among computational nodes in order to accelerate their assembly. An underlying mesh is decomposed into a given number of submeshes, pairs of which represent blocks in a system matrix. The aim is to distribute the submeshes among computational nodes in a way which minimizes the amount of mesh parts owned by a single process and which inherently defines the distribution of the system matrix. Additionally, each process owns exactly one diagonal block since their assembly is typically the most time consuming in the fast BEM. The distribution of submeshes is based on a cyclic decomposition of complete graphs into dense subgraphs. We briefly present the method, a boundary element environment it is implemented in and provide results of numerical experiments.

purchase the full-text of this paper (price £22)

go to the previous paper
go to the next paper
return to the table of contents
return to the book description
purchase this book (price £45 +P&P)

	Computational & Technology Resources an online resource for computational, engineering & technology publications
	not logged in - login
Front Page Browse CCP CSETS CTR IJRT Other Authors Search Purchase Guide FAQ Contact us	Civil-Comp Proceedings ISSN 1759-3433 CCP: 111 PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, GRID AND CLOUD COMPUTING FOR ENGINEERING Edited by: Paper 2 Using Discrete Mathematics to Optimize Parallelism in Boundary Element Method M. Kravčenko^1,2, M. Merta¹ and J. Zapletal^1,2 ¹ IT4Innovations, VSB-Technical University of Ostrava, Czech Republic ²Department of Applied Mathematics, Faculty of Electrical Engineering and Computer Science, VSB-Technical University of Ostrava, Czech Republic doi:10.4203/ccp.111.2 purchase the full-text of this paper Full Bibliographic Reference for this paper M. Kravcenko, M. Merta, J. Zapletal, "Using Discrete Mathematics to Optimize Parallelism in Boundary Element Method", in , (Editors), "Proceedings of the Fifth International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 2, 2017. doi:10.4203/ccp.111.2 Keywords: distributed parallelism, cyclic decomposition of complete graphs, boundary element method, high performance computing, adaptive cross approximation. Summary In this work we present an approach for distribution of system matrices occurring in the fast boundary element method (BEM) among computational nodes in order to accelerate their assembly. An underlying mesh is decomposed into a given number of submeshes, pairs of which represent blocks in a system matrix. The aim is to distribute the submeshes among computational nodes in a way which minimizes the amount of mesh parts owned by a single process and which inherently defines the distribution of the system matrix. Additionally, each process owns exactly one diagonal block since their assembly is typically the most time consuming in the fast BEM. The distribution of submeshes is based on a cyclic decomposition of complete graphs into dense subgraphs. We briefly present the method, a boundary element environment it is implemented in and provide results of numerical experiments. purchase the full-text of this paper (price £22) go to the previous paper go to the next paper return to the table of contents return to the book description purchase this book (price £45 +P&P)
Back to top	©Civil-Comp Limited 2023 - terms & conditions