Analysis of parallel algorithm for matrix multiplication on hypercubes

Kini, Gopalakrishna N (2002) Analysis of parallel algorithm for matrix multiplication on hypercubes. In: National Conference on Advanced Computing, ist and 2nd of February, 2002, PSG college of Technology, Coimbatore, India.

[img] PDF
2 NCAC Feb 2002 paper2.pdf - Published Version
Restricted to Registered users only

Download (128kB) | Request a copy


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

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: SIMD, Hypercube Network, Matrix multiplication, broadcast, BIT, BIT.COMLEMENT, time complexity.
Subjects: Engineering > MIT Manipal > Computer Science and Engineering
Depositing User: MIT Library
Date Deposited: 20 Dec 2014 10:13
Last Modified: 20 Dec 2014 10:13

Actions (login required)

View Item View Item