Minimizing Communication Penalty of Triangular Solvers by Runtime Mesh Configuration and Workload Redistribution |
| |
Authors: | Wang Dianqin Chu Eleanor |
| |
Affiliation: | (1) Department of Mathematics and Statistics, University of Guelph, Guelph, Ontario, Canada, N1G 2W1 |
| |
Abstract: | In this article, we study the effects of network topology and load balancing on the performance of a new parallel algorithm for solving triangular systems of linear equations on distributed-memory message-passing multiprocessors. The proposed algorithm employs novel runtime data mapping and workload redistribution methods on a communication network which is configured as a toroidal mesh. A fully parameterized theoretical model is used to predict communication behaviors of the proposed algorithm relevant to load balancing, and the analytical performance results correctly determine the optimal dimensions of the toroidal mesh, which vary with the problem size, the number of available processors, and the hardware parameters of the machine. Further enhancement to the proposed algorithm is then achieved through redistributing the arithmetic workload at runtime. Our FORTRAN implementation of the proposed algorithm as well as its enhanced version has been tested on an Intel iPSC/2 hypercube, and the same code is also suitable for executing the algorithm on the iPSC/860 hypercube and the Intel Paragon mesh multiprocessor. The actual timing results support our theoretical findings, and they both confirm the very significant impact a network topology chosen at runtime can have on the computational load distribution, the communication behaviors and the overall performance of parallel algorithms. |
| |
Keywords: | parallel algorithm triangular solver hypercube mesh torus overlap of communications by computations load balancing performance modeling and evaluation |
本文献已被 SpringerLink 等数据库收录! |
|