[
https://issues.apache.org/jira/browse/HAMA-129?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=12657267#action_12657267
]
Edward J. Yoon commented on HAMA-129:
-------------------------------------
for (int j = 0; j < blockSize; j++) {
SubMatrix b = matrix_b.getBlock(key.getColumn(), j);
SubMatrix c = a.mult(b);
output.collect(new BlockID(key.getRow(), j), new BlockWritable(c));
}
we can just use scanner.
> Improving speed of matrix multiplication
> ----------------------------------------
>
> Key: HAMA-129
> URL: https://issues.apache.org/jira/browse/HAMA-129
> Project: Hama
> Issue Type: Improvement
> Components: implementation
> Affects Versions: 0.1.0
> Reporter: Edward J. Yoon
> Assignee: Edward J. Yoon
> Fix For: 0.1.0
>
> Attachments: HAMA-129.patch, HAMA-129_v01.patch, HAMA-129_v02.patch
>
>
> We use a blockinputformat (row based partitioning). but it causes
> "java.lang.OutOfMemoryError: Java heap space" when size is big.
> I'll write the formulas and partition them as PIEstimator.
--
This message is automatically generated by JIRA.
-
You can reply to this email to add a comment to the issue online.
