Fast Parallel Realization of Matrix Multiplication.
MARYLAND UNIV COLLEGE PARK COMPUTER VISION LAB
Pagination or Media Count:
Fast parallel matrix multiplication algorithms in SIMD Single-Instruction-Multiple-Data and MIMD MUltiple-Instruction-Multiple-data modes are described for implementation in a parallel-binary matrix processing system with facilities for bit-wise parallel Boolean operation and power-of-two shifts on Boolean matrices. A comparative study of these algorithms is made on the basis of their relative time-complexities, when conventional binary and prime-modulus arithmetic are used for forming the matrix product. Author
- Theoretical Mathematics