[
https://issues.apache.org/jira/browse/HAMA-221?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13231928#comment-13231928
]
Thomas Jungblut commented on HAMA-221:
--------------------------------------
Very simplistic first working scratch of the normal matrix multiplication:
https://github.com/thomasjungblut/thomasjungblut-common/blob/master/src/de/jungblut/math/bsp/MatrixMultiplicationBSP.java
It uses row and column partitioning and a bit of messaging.
However this can be much more improved.
bq.I think it'd be nice also to implement the well known algorithms Cannon and
DNS using BSP model and eventually add them to the hama-examples module.
Do you have some papers for them? Especially MPI versions can be very well
translated to BSP I've seen ;)
This is a good example for DNS:
http://imada.sdu.dk/~daniel/DM818-2011/Assignments/mand3/index.html
> A BSP matrix multiplication implementation.
> -------------------------------------------
>
> Key: HAMA-221
> URL: https://issues.apache.org/jira/browse/HAMA-221
> Project: Hama
> Issue Type: Improvement
> Components: bsp, matrix
> Affects Versions: 0.3.0
> Reporter: Edward J. Yoon
> Assignee: Thomas Jungblut
>
> Using the BSP model, we could improve the performance of mat-mat
> multiplication. Let's evaluation it out on this issue.
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:
https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
