A decomposition method for efficient use of distributed supercomputers for finite element applications

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.

[1]  Valerie E. Taylor,et al.  Performance Modeling of Interactive, Immersive Virtual Environments for Finite Element Simulations , 1996, Int. J. High Perform. Comput. Appl..

[2]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[3]  Genki Yagawa,et al.  A parallel finite element method with a supercomputer network , 1993 .

[4]  Shahid H. Bokhari,et al.  A Partitioning Strategy for Nonuniform Problems on Multiprocessors , 1987, IEEE Transactions on Computers.

[5]  Horst D. Simon,et al.  Partitioning of unstructured problems for parallel processing , 1991 .

[6]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[7]  Daniel A. Reed,et al.  Virtual Reality and Parallel Systems Performance Analysis , 1995, Computer.

[8]  Lawrence W. Stark,et al.  Some of what one needs to know about using head-mounted displays to improve teleoperator performance , 1993, IEEE Trans. Robotics Autom..

[9]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[10]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[11]  B. Nour-Omid,et al.  Solving finite element equations on concurrent computers , 1987 .

[12]  Charbel Farhat On the mapping of massively parallel processors onto finite element graphs , 1989 .

[13]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[14]  Carolina Cruz-Neira,et al.  Surround-Screen Projection-Based Virtual Reality: The Design and Implementation of the CAVE , 2023 .

[15]  William Gropp,et al.  Users guide for the ANL IBM SP1 , 1994 .