You do not use map-reduce algorithms to do compute jobs faster- they are usually much slower than the same computation in one program. You use map-reduce to do things that are otherwise impossible.
On Sat, Jul 28, 2012 at 9:27 PM, Ted Dunning <[email protected]> wrote: > I am unaware of such comparisons. I also don't know of any practical > implementations for doing really huge decompositions in parallel. > > > On Sat, Jul 28, 2012 at 10:27 AM, mohsen jadidi > <[email protected]>wrote: > >> Thank you for your replies. What I am interested to know is that if I want >> to compute the SVD for huge matrix , how much faster my computation get by >> using Mahout. >> >> On Fri, Jul 27, 2012 at 8:12 PM, Dmitriy Lyubimov <[email protected]> >> wrote: >> >> > IMO it doesn't make much sense to compare non-parallel and a parallel >> > algorithm (assuming they are running approximately same flops-sized >> > computation). Which is probably why there's not so many (i don't know >> > any). >> > >> > However, there are studies comparing parallel approaches (e.g. certain >> > mahout vs. giraph methods) given same amount of flops capacity in a >> > cluster, but i think you need to be more specific because there are >> > too many areas of interest you are talking about. >> > >> > On Fri, Jul 27, 2012 at 8:57 AM, mohsen jadidi <[email protected]> >> > wrote: >> > > Hey all, >> > > >> > > I am looking for some case studies which has evaluated some of Mahout >> > > algorithm implementation like different decomposition or different >> > > classifier. I just want to know how much faster is the Mahout in >> compare >> > of >> > > regular non. paralleled algorithms.I couldnt find anything useful. >> > > >> > > Thanks in advance, >> > > >> > > -- >> > > Mohsen Jadidi >> > >> >> >> >> -- >> Mohsen Jadidi >> -- Lance Norskog [email protected]
