At this point I'm more interested in seeing how people are
implementing various algorithms on different parallel frameworks like
etc, as opposed to seeing anything "production ready". Its more of
taking notes on what frameworks work better for what techniques, being
able to illustrate some sort of heuristic on what algorithm should be
used with what framework. There are lots of small tradeoffs depending
on what is used and how. Just trying to map that all out.
An academic exercise, to be sure. =)
On Tue, Sep 27, 2011 at 3:14 PM, Jake Mannix <jake.man...@gmail.com> wrote:
> On Tue, Sep 27, 2011 at 12:31 PM, Aapo Kyrola <akyr...@cs.cmu.edu> wrote:
>> I have written a very simple Belief Propagation algorithm for binary
>> Not ready for prime-time either, though :).
> That's awesome! Where's the code? :)
> It shouldn't be construed that "not ready for prime-time" is *bad*, in case
> that's what it looked like I was saying.
> More examples the better, so we can see where the bottlenecks are, and move
> them toward productionalized stage!
>> On Sep 27, 2011, at 3:03 PM, Jake Mannix wrote:
>> Not really. It's really really early, and they're in the "examples" stage
>> - nothing is
>> really productionized. There's things like PageRank, finding shortest
>> path, but
>> nothing is really ready for prime time yet.
>> On Tue, Sep 27, 2011 at 11:56 AM, Josh Patterson <j...@cloudera.com>
>>> Is there a list of known algorithms that have been implemented on the
>>> Giraph framework?
>>> Twitter: @jpatanooga
>>> Solution Architect @ Cloudera
>>> hadoop: http://www.cloudera.com
>> Aapo Kyrola
>> Ph.D. student, http://www.cs.cmu.edu/~akyrola
Solution Architect @ Cloudera