Abstract

This paper firstly gives a description of the traditional distribution schemes of parallel matrix multiplication and an analysis of their efficiencies. In order to reduce communication expenses between multiple processors, two solutions are offered in this paper, and the corresponding specific implementation models are also listed. Then a method of how to calculate the n-th power of massive matrix is proposed. Finally, the experimental results show that this method of calculating the n-th power of massive matrix can reduce the execution time and improve the efficiency.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.