A decomposition method for efficient use of distributed supercomputers for finite element applications
- 24 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The interconnection of geographically distributed supercomputers via highspeed networks makes available the needed compute power for large-scale scientific applications, such as finite element applications. In this paper we propose a two-level data decomposition method for efficient execution of finite element applications on a network of supercomputers. Our method exploits the following features that may be different for each supercomputer in the system: processor speed, number of processors used from each supercomputer, local network performance, wide area network performance and wide area topology. Preliminary experiments involving a nonlinear, finite element application executed on a network of two supercomputers, one located at Argonne National Laboratory and the other one at the Cornell Theory Center, demonstrate a 20% reduction in execution time when the proposed decomposition is used as compared with naively applying conventional decompositions that are applicable to single supercomputers.Keywords
This publication has 10 references indexed in Scilit:
- Performance Modeling of Interactive, Immersive Virtual Environments for Finite Element SimulationsThe International Journal of Supercomputer Applications and High Performance Computing, 1996
- Virtual reality and parallel systems performance analysisComputer, 1995
- Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problemsConcurrency: Practice and Experience, 1994
- Some of what one needs to know about using head-mounted displays to improve teleoperator performanceIEEE Transactions on Robotics and Automation, 1993
- A parallel finite element method with a supercomputer networkComputers & Structures, 1993
- Partitioning of unstructured problems for parallel processingComputing Systems in Engineering, 1991
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- On the mapping of massively parallel processors onto finite element graphsComputers & Structures, 1989
- A Partitioning Strategy for Nonuniform Problems on MultiprocessorsIEEE Transactions on Computers, 1987
- Optimization by Simulated AnnealingScience, 1983