Highly scalable sparse matrix multiplication

Source: Internet
Author: User
Keywords Sparse matrices multiplication height
Tags basic communication computing data data processing distributed distributed computing framework

Highly scalable sparse matrix multiplication

Wuzhiguang Mao Chen Han Lei Lijun

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.


Highly scalable sparse matrix multiplication

Related Article

Contact Us

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.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.