[
https://issues.apache.org/jira/browse/MAHOUT-1299?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13725500#comment-13725500
]
Dmitriy Lyubimov commented on MAHOUT-1299:
------------------------------------------
it seems to me that it should be approached the same way as vector operation
optimizations were.
e.g. have a separate set of algorithms (rather than attaching an algorithm to a
concrete matrix) and set of important matrix properties (like isDiagonalLike,
isRowVectorized, isColVectorized, number of nonzero elements for sparse
matrices). Then have a cost estimation and pick the algorithm type.
It looks like this issue should be broadened in scope a little to include cost
optimization for binary times() in general. (and if it works, it actually
should eliminate need for all those tricks with timesRight(), timesLeft().).
But it also means that it is probably a little longer story to nail it right
than i initially hoped.
> Add optimized versions of timesLeft(), timesRight() to
> SparseRow~,SparseColMatrices and binary times() operation in general
> ---------------------------------------------------------------------------------------------------------------------------
>
> Key: MAHOUT-1299
> URL: https://issues.apache.org/jira/browse/MAHOUT-1299
> Project: Mahout
> Issue Type: New Feature
> Affects Versions: 0.8
> Reporter: Dmitriy Lyubimov
> Assignee: Dmitriy Lyubimov
> Priority: Minor
> Fix For: 0.9
>
>
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira
