Name
Abstract | ||
|---|---|---|
In this paper we propose a parallel block Lanczos algorithm suitable for MIMD distributed memory message passing architectures. We first consider a direct parallelization of the classic block Lanczos algorithm and we evaluate its performance. Then, after a discussion of these results, we reorganize the block algorithm obtaining a modified version that has a better behaviour with respect to the performance in the considered computing environment. We assume a unidirectional ring as connection topology and a block column wrap-around matrices distribution. We have chosen this approach to improve load-balancing, to eliminate the intersection of messages and to decrease communication. The two parallel block Lanczos algorithms have been tested on a Convex Meta Series, a cluster of HP Series 9000 workstations, running the PVM communication system. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1109/EMPDP.1995.389179 | San Remo |
Keywords | Field | DocType |
hp series,connection topology,parallel modified block lanczos,memory architecture,block column wrap-around matrix,block algorithm,convex meta series,classic block lanczos algorithm,better behaviour,parallel block lanczos,pvm communication system,parallel block lanczos algorithm,topology,clustering algorithms,communication system,parallel algorithms,distributed memory,lanczos algorithm,message passing,symmetric matrices,concurrent computing,workstations,system testing,algorithm design and analysis,load balance,load balancing | Lanczos resampling,Algorithm design,Block Lanczos algorithm,Computer science,Parallel algorithm,Parallel computing,Distributed memory,Lanczos algorithm,Memory architecture,MIMD | Conference |
ISBN | Citations | PageRank |
0-8186-7031-2 | 1 | 0.47 |
References | Authors | |
4 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| M. R. Guarracino | 1 | 47 | 3.47 |
| F. Perla | 2 | 5 | 2.49 |