I expected that SIMDMultiplyMap/Reduce algorithm could be performed sparse mat-mat mult well and efficiently through RPC over nodes but I realized that's really bad algorithm for Hadoop/MapReduce.
I'm not sure exactly what kind of scheduling you are talking about, but I guess the iterative method is best for sparse mat-mat mult. On Sun, Mar 22, 2009 at 11:30 AM, Samuel Guo <[email protected]> wrote: > 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 <[email protected]> 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 >> [email protected] >> http://blog.udanax.org >> > -- Best Regards, Edward J. Yoon [email protected] http://blog.udanax.org
