Efficient Matrix Multiplication on SIMD Computers

DOI10.1137/0613026zbMath0757.65050OpenAlexW1993644742MaRDI QIDQ3988995

Tor Sørevik, Fredrik Manne, Marián Vajteršic, Petter E. Bjørstad

Publication date: 28 June 1992

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2e912451d38834f012e443feee60635b196afff9

zbMATH Keywords

performancelarge scale matrix computationsWinograd's algorithmSIMD computersdata flow algorithmsmatrix multiplication algorithmsStrassen's algorithm parallel computing

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (5)

Fast rectangular matrix multiplication and QR decomposition ⋮ Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures ⋮ Massively parallel Poisson and QR factorization solvers ⋮ FAST MATRIX MULTIPLICATION ALGORITHMS ON MIMD ARCHITECTURES ⋮ The problem of small and large matrices in parallel Matrix Multiplication

Uses Software

• Algorithm 679

This page was built for publication: Efficient Matrix Multiplication on SIMD Computers