Trading Replication for Communication in Parallel Distributed-Memory Dense Solvers
暂无分享,去创建一个
[1] S. Lennart Johnsson,et al. Minimizing the Communication Time for Matrix Multiplication on Multiprocessors , 1993, Parallel Comput..
[2] S. Lennart Johnsson,et al. Multiplication of Matrices of Arbitrary Shape on a Data Parallel Computer , 1994, Parallel Comput..
[3] Alok Aggarwal,et al. Communication Complexity of PRAMs , 1990, Theor. Comput. Sci..
[4] Jack Dongarra,et al. MPI - The Complete Reference: Volume 1, The MPI Core , 1998 .
[5] Jaeyoung Choi,et al. Pumma: Parallel universal matrix multiplication algorithms on distributed memory concurrent computers , 1994, Concurr. Pract. Exp..
[6] P. Sadayappan,et al. Communication-Efficient Matrix Multiplication on Hypercubes , 1996, Parallel Comput..
[7] Robert A. van de Geijn,et al. SUMMA: scalable universal matrix multiplication algorithm , 1995, Concurr. Pract. Exp..
[8] Sivan Toledo,et al. The design, implementation, and evaluation of a symmetric banded linear solver for distributed-memory parallel computers , 1998, TOMS.
[9] Ramesh C. Agarwal,et al. A three-dimensional approach to parallel matrix multiplication , 1995, IBM J. Res. Dev..
[10] Message Passing Interface Forum. MPI: A message - passing interface standard , 1994 .