Matrix multiplication is a very important basic operation in linear algebra and graph algorithm, while the matrices in large-scale data processing are often sparse matrices. The MapReduce programming framework can effectively support the distributed computing of massive data. Therefore, how to use MapReduce programming framework to realize the multiplication of super large sparse matrix is studied. The traditional matrix multiplication parallel algorithm does not specifically optimize the sparse matrix, resulting in a large amount of unnecessary communication overhead during the calculation. A new algorithm--CRM (column row multiplication) is proposed and compared with the traditional matrix chunking algorithm.
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.