Title: | A parallel multigrid method for the prediction of incompressible flows on workstation clusters | Authors: | Wechsler, Klaus Breuer, Michael Durst, Franz |
Language: | eng | Issue Date: | 1996 | Publisher: | Springer | Document Type: | Conference Object | Journal / Series / Working Paper (HSU): | Lecture notes in computer science | Volume: | 1156 | Page Start: | 53 | Page End: | 58 | Published in (Book): | Parallel Virtual Machine — EuroPVM '96 Third European PVM Conference Munich, Germany, October 7–9, 1996 Proceedings | Publisher Place: | Cham | Conference: | Third European PVM Conference | Abstract: | © Springer-Verlag Berlin Heidelberg 1996. A parallel multigrid method for the prediction of incompressible flows in complex geometries is investigated with respect to the performance on workstation clusters. The parallel implementation is based on grid partitioning and follows the message passing concept, ensuring a high degree of portability. A high numerical efficiency is obtained by a nonlinear multigrid method with a pressure-correction scheme as smoother. Within this investigation, up to 64 workstations located at the TU Munich connected by an ethernet switch are used as well as two workstations located at the University of Erlangen. The workstations in Erlangen and Munich are connected by a high-speed ATM-network. Global and local communication which is required within the solver is examined for different configurations of workstations. These results are used to understand the performance of the flow solver. Moreover, it is shown that speedups can be achieved for the computation of complex flow problems on workstation clusters, although these speedups are smaller compared to other parallel architectures |
Organization Units (connected with the publication): | Universität Erlangen-Nürnberg | ISBN: | 3540617795 | ISSN: | 0302-9743 |
Appears in Collections: | 6 - Publication references (without fulltext) of your publications before HSU |
Show full item record
CORE Recommender
User Tools
Items in openHSU are protected by copyright, with all rights reserved, unless otherwise indicated.