Efficient Matrix Multiplication on SIMD Computers
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 823632
- PARALLEL MATRIX MULTIPLICATION ON THE CONNECTION MACHINE
- A fast algorithm for matrix multiplication and its efficient realization on systolic arrays
- GEMMW: A portable level 3 BLAS Winograd variant of Strassen's matrix- matrix multiply algorithm
- scientific article; zbMATH DE number 4072257
Cited in
(15)- A family of new efficient arrays for matrix multiplication
- Fast rectangular matrix multiplication and QR decomposition
- scientific article; zbMATH DE number 4072257 (Why is no real title available?)
- Strassen's algorithm on coarse grained multicomputers
- scientific article; zbMATH DE number 3876582 (Why is no real title available?)
- Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm
- FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES
- The problem of small and large matrices in parallel Matrix Multiplication
- Exploiting parallelism in matrix-computation kernels for symmetric multiprocessor systems: matrix-multiplication and matrix-addition algorithm optimizations by software pipelining and threads allocation
- scientific article; zbMATH DE number 823632 (Why is no real title available?)
- Efficient complex matrix multiplication
- Emmerald: a fast matrix–matrix multiply using Intel's SSE instructions
- Adaptive Winograd's matrix multiplications
- Massively parallel Poisson and QR factorization solvers
- Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures
This page was built for publication: Efficient Matrix Multiplication on SIMD Computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988995)