Pregel - Large Scale Graph Computing at Google

Large Scale Graph Computing at Google - on the official Google Research blog.

Here is an extract -

... we have created scalable infrastructure, named Pregel, to mine a wide range of graphs. In Pregel, programs are expressed as a sequence of iterations. In each iteration, a vertex can, independently of other vertices, receive messages sent to it in the previous iteration, send messages to other vertices, modify its own and its outgoing edges' states, and mutate the graph's topology (experts in parallel processing will recognize that the Bulk Synchronous Parallel Model inspired Pregel).

I wouldn't say this is directly PLT related, but it is a parallel programming model - compute-communicate-synchronize-loop - that is probably of interest to language buffs from the DSL angle, like the GPU programming models.

Comment viewing options

Select your preferred way to display the comments and click "Save settings" to activate your changes.

Definitely on topic

So who's going to implement Connection Machine LISP on it?

Postscript The principal investigator has an MIT CSAIL connection, according to an old resumé. So maybe it's already implemented...

Hyperlink broken

Heads up... "an old resumé" doesn't work. You forgot the href according to the underlying "View Page Source" in Firefox.

Fixed. Thanks.

Fixed. Thanks.

Thanks each


Nobody is interested in connection machine lisp any more. Maybe CM Python, though :P