Abstract

Matrix multiplication is a fundamental component of many numerical and non-numerical algorithms. Algorithms suitable for conventional, single- processor computers are not appreciable for parallel architectures. Many algorithms with inherent parallelism have a higher computational complexity than the best sequential counterpart. An implementation of parallel matrix multiplication algorithm on hypercube SIMD model is introduced