A parallel algorithm with improved performance of finite volume method (SIMPLE-TS)

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper a parallel version of the finite volume method SIMPLE-TS for calculation of two-dimensional compressible, viscous gas flows with improved performance is presented. It is demonstrated on a problem regarded to micro gas flows, taking place in Micro-Electro-Mechanical Systems (MEMS). The reorganisation of the parallel algorithm improve the algorithm performance, when more cores are used for calculations on computational grids with relatively small number of nodes or cells. The reorganisation is two-fold: first to reduce the number of communications between the processes, and second to reorder the calculation of some variables in such a way that increases the number of calculations during the communications between the processes. The comparison of speed-up between previous and new parallel versions of SIMPLE-TS was performed on two types of clusters with regard to the communication hardware: the first uses specialised cards with low latency for the interconnections between the computers and the other uses conventional cards for the interconnections. The clusters are a part of the GRID-infrastructure of the European Research Area (ERA). © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Shterev, K. S., Stefanov, S. K., & Atanassov, E. I. (2012). A parallel algorithm with improved performance of finite volume method (SIMPLE-TS). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7116 LNCS, pp. 351–358). https://doi.org/10.1007/978-3-642-29843-1_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free