Low copy message passing on the Alliant CAMPUS/800
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Efficient Algorithms for the Block Hessenberg Form
The Journal of Supercomputing
NetSolve: A Network-Enabled Solver: Examples and Users
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Sourcebook of parallel computing
The design and implementation of the MRRR algorithm
ACM Transactions on Mathematical Software (TOMS)
Parallelization of a method for the solution of the inverse additive singular value problem
MATH'05 Proceedings of the 8th WSEAS International Conference on Applied Mathematics
ISTASC'04 Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation
ACM Transactions on Mathematical Software (TOMS)
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Adams-Bashforth and Adams-Moulton methods for solving differential Riccati equations
Computers & Mathematics with Applications
A piecewise-linearized algorithm based on the Krylov subspace for solving stiff ODEs
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
In this paper, we describe extensions to a proposed set of linear algebra communication routines for communicating and manipulating data structures that are distributed among the memories of a distributed memory MIMD computer. In particular, recent experience shows that higher performance can be attained on such architectures when parallel dense matrix algorithms utilize a data distribution that views the computational nodes as a logical two dimensional mesh. The motivation for the BLACS continues to be to increase portability, efficiency and modularity at a high level. The audience of the BLACS are mathematical software experts and people with large scale scientific computation to perform. A systematic effort must be made to achieve a de facto standard for the BLACS.