Generation of Balanced Subdomain Clusters with Minimum Interface for Distributed Domain Decomposition Applications
نویسندگان
چکیده
Balancing and dual Domain Decomposition Methods (DDMs) are used in practice on parallel computing environments with the number of generated subdomains being generally larger than the number of available processors. The present study describes partitioning concepts used to: (a) generate subdomains for such DDMs and (b) organize these subdomains into subdomain clusters, in order to assign each cluster to a processor. The discussion concerns distributed computing environments with dedicated homogeneous processors, as well as with heterogeneous and/or non-dedicated processors. The FETI method is used to obtain numerical results demonstrating the merits of the described partitioning algorithms.
منابع مشابه
Finite Difference Simulations of the Navier-Stokes Equations Using Parallel Distributed Computing
This paper discusses the implementation of a numerical algorithm for simulating incompressible fluid flows based on the finite difference method and designed for parallel computing platforms with distributed-memory, particularly for clusters of workstations. The solution algorithm for the Navier-Stokes equations utilizes an explicit scheme for pressure and an implicit scheme for velocities, i...
متن کاملPetroleum Reservoir Simulation Using Finite Volume Method with Non-structured Grids and Parallel Distributed Computing
This paper discusses the implementation of a numerical method for simulating petroleum reservoirs, based on finite volume technique using non-structured grids, designed for parallel computing platforms with distributed-memory, particularly for clusters of workstations. Non-structured meshes are used in order to enhance the capability of conforming the irregular boundary of the reservoir allowin...
متن کاملA Load Balancing Package for Domain Decomposition on Distributed Memory Systems
We present a tool for balanced decomposition of spatial domains. In addition to applying a nested bisection algorithm to determine the boundaries of each subdomain, the tool replicates a user speciied zone along the boundaries of the subdomain in order to minimize future interactions between subdomains. Results of running the tool on the Cray T3D system, as well as using it in the implementatio...
متن کاملDistributed-Memory Computing With the Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA)
The Langley Aerothermodynamic Upwind Relaxation Algorithm (LAURA), a NavierStokes solver, has been modi ed for use in a parallel, distributed-memory environment using the Message-Passing Interface (MPI) standard. A standard domain decomposition strategy is used in which the computational domain is divided into subdomains with each subdomain assigned to a processor. Performance is examined on de...
متن کاملBeyond Amls: Domain Decomposition with Rational Filtering∗
This paper proposes a rational filtering domain decomposition technique for the solution of large and sparse symmetric generalized eigenvalue problems. The proposed technique is purely algebraic and decomposes the eigenvalue problem associated with each subdomain into two disjoint subproblems. The first subproblem is associated with the interface variables and accounts for the interaction among...
متن کامل