Elemental
Jack Poulson, Bryan Marker, Robert A. Geijn et al. · ACM Transactions on Mathematical Software · 2013
Parallelizing dense matrix computations to distributed memory architectures is a well-studied subject and generally considered to be among the best understood domains of parallel computing. Two packages, developed in the mid 1990s, still enjoy regular use: ScaLAPACK and PLAPACK. With the advent of many-core architectures, which may very well take the shape of distributed memory architectures within a single processor, these packages must be revisited since the traditional MPI-based approaches will likely need to be extended. Thus, this is a good time to review lessons learned since the introduction of these two packages and to propose a simple yet effective alternative. Preliminary performance results show the new solution achieves competitive, if not superior, performance on large clusters.
Cited by 209 works. doi:10.1145/2427023.2427030
Authors
References
- The algebraic eigenvalue problem
- The Algebraic Eigenvalue Problem
- A set of level 3 basic linear algebra subprograms
- MPI: The Complete Reference
- ScaLAPACK Users' Guide
- Automatically Tuned Linear Algebra Software
- Anatomy of high-performance matrix multiplication
- The Torus-Wrap Mapping for Dense Matrix Calculations on Massively Parallel Computers
- A 48-Core IA-32 message-passing processor with DVFS in 45nm CMOS
- A divide and conquer method for the symmetric tridiagonal eigenproblem