incubator-hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Samuel Guo <guosi...@gmail.com>
Subject Re: New approach for mat-mat mult using mapreduce iterations
Date Sun, 22 Mar 2009 02:30:13 GMT
do you mean "one mr job one iteration"? I don't think it will improve
the performance of mat-mat mult. the scheduling of the jobs will be a
problem while multiplication.

On 3/20/09, Edward J. Yoon <edwardyoon@apache.org> wrote:
> Just considering, single table doesn't need much time to full scan.
> So, if each row of matrix A have one mapreduce job, it'll be fast. (Of
> course, there is a N time iterations.)
>
> for(int i = 0; i < A.getColumns(); i++) {
>     // run Job
> }
>
> What do you think?
> --
> Best Regards, Edward J. Yoon
> edwardyoon@apache.org
> http://blog.udanax.org
>

Mime
View raw message