GitHub user uzadude opened a pull request:
https://github.com/apache/spark/pull/14068
enhanced simulate multiply
## What changes were proposed in this pull request?
We have a use case of multiplying very big sparse matrices. we have about
1000x1000 distributed block matrices multiplication and the simulate multiply
goes like O(n^4) (n being 1000). it takes about 1.5 hours. We modified it
slightly with classical hashmap and now run in about 30 seconds O(n^2).
## How was this patch tested?
We have added a performance test and verified the reduced time.
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/uzadude/spark master
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/spark/pull/14068.patch
To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:
This closes #14068
----
commit 0126ea142ef3a842f00b82920483285c28ab7666
Author: oraviv <[email protected]>
Date: 2016-07-06T06:35:58Z
enhanced simulate multiply
----
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
