Chain Multiplication of Dense Matrices: Proposing a Shared Memory Based Parallel Algorithm
Chain multiplication of matrices is widely used for scientific computing. It becomes more challenging when there is large number of floating point dense matrices. Because, floating point operations take more time than integer operations. It would be interesting to lower the time of such chain operations. Now-a-days every multi-core processor system has built in parallel computational power. This power can only be utilized when compatible parallel algorithms were used. So, in this paper, a shared memory based parallel algorithms has been proposed to compute the multiplication of a long sequence of dense matrices. The algorithms have been tested with long sequence of matrices as input. The approach has been with 2×108 flops.