Emerald Login
    

Welcome guest

Article Request:
Subdomain cluster generation for domain decomposition methods using graph partitioning optimization

 

Article Information:

Title:

Subdomain cluster generation for domain decomposition methods using graph partitioning optimization

Author(s):

Dimos C. Charmpis, Manolis Papadrakakis

Journal:

Engineering Computations

Year:

2003

Volume:

20

Issue:

8

Page:

932 - 963


ISSN:

0264-4401


DOI:

10.1108/02644400310502973

Publisher:

MCB UP Ltd

Document Access:

Existing customers:

Please login above.

Purchase this document:
Price payable: GBP £13.00
plus handling charge of GBP £1.50 and VAT where applicable.
Purchase

Request this document:
Print or e-mail a document request to your librarian.
Request

Reprints & permissions:
Image: Rightslink Request

Abstract:

Balancing and dual domain decomposition methods (DDMs) comprise a family of efficient high performance solution approaches for a large number of problems in computational mechanics. Such DDMs are used in practice on parallel computing environments with the number of generated subdomains being generally larger than the number of available processors. This paper presents an effective heuristic technique for organizing the subdomains into subdomain clusters, in order to assign each cluster to a processor. This task is handled by the proposed approach as a graph partitioning optimization problem using the publicly available software METIS. The objective of the optimization process is to minimize the communication requirements of the DDMs under the constraint of producing balanced processor workloads. This constraint optimization procedure for treating the subdomain cluster generation task leads to increased computational efficiencies for balancing and dual DDMs.

Keywords:

Optimization, Parallel programming


Article Type:

Research Paper


Article URL:

http://www.emeraldinsight.com/10.1108/02644400310502973

Top