Hi, guys,

Pregel has been revealed on 8/11, what is your opinion of, does anybody know
how to get the presentation, and is anyone interested in implementing it?

Thank you,
Mark

I'm interested in working on it.

The paper is still not out.. Only the summary has been made available. Am I
missing something?
Amandeep Khurana
Computer Science Graduate Student
University of California, Santa Cruz
On Thu, Sep 3, 2009 at 9:46 AM, Mark Kerzner <[EMAIL PROTECTED]> wrote:

> Hi, guys,
>
> Pregel has been revealed on 8/11, what is your opinion of, does anybody
> know
> how to get the presentation, and is anyone interested in implementing it?
>
> Thank you,
> Mark
>

Then we should think of a name and create the project somewhere. Does not
have to be the same place as Hadoop, can be Google code to start with...
How about

Madoop
Mississippi (221 bridges)
Danube (lotsa bridges)

Mark

On Thu, Sep 3, 2009 at 2:53 PM, Amandeep Khurana <[EMAIL PROTECTED]> wrote:

> I'm interested in working on it.
>
> The paper is still not out.. Only the summary has been made available. Am I
> missing something?
>
>
> Amandeep Khurana
> Computer Science Graduate Student
> University of California, Santa Cruz
>
>
> On Thu, Sep 3, 2009 at 9:46 AM, Mark Kerzner <[EMAIL PROTECTED]>
> wrote:
>
> > Hi, guys,
> >
> > Pregel has been revealed on 8/11, what is your opinion of, does anybody
> > know
> > how to get the presentation, and is anyone interested in implementing it?
> >
> > Thank you,
> > Mark
> >
>

Brenta
http://en.wikipedia.org/wiki/Brenta_(river)

On Thu, Sep 3, 2009 at 3:07 PM, Mark Kerzner <[EMAIL PROTECTED]> wrote:

> Then we should think of a name and create the project somewhere. Does not
> have to be the same place as Hadoop, can be Google code to start with...
> How about
>
> Madoop
> Mississippi (221 bridges)
> Danube (lotsa bridges)
>
> Mark
>
>
>
> On Thu, Sep 3, 2009 at 2:53 PM, Amandeep Khurana <[EMAIL PROTECTED]> wrote:
>
>> I'm interested in working on it.
>>
>> The paper is still not out.. Only the summary has been made available. Am
>> I
>> missing something?
>>
>>
>> Amandeep Khurana
>> Computer Science Graduate Student
>> University of California, Santa Cruz
>>
>>
>> On Thu, Sep 3, 2009 at 9:46 AM, Mark Kerzner <[EMAIL PROTECTED]>
>> wrote:
>>
>> > Hi, guys,
>> >
>> > Pregel has been revealed on 8/11, what is your opinion of, does anybody
>> > know
>> > how to get the presentation, and is anyone interested in implementing
>> it?
>> >
>> > Thank you,
>> > Mark
>> >
>>
>
>

There is another project-  Hamburg - on similar lines. Check that out too.
Amandeep Khurana
Computer Science Graduate Student
University of California, Santa Cruz
On Thu, Sep 3, 2009 at 1:08 PM, Mark Kerzner <[EMAIL PROTECTED]> wrote:

> Brenta
> http://en.wikipedia.org/wiki/Brenta_(river)<http://en.wikipedia.org/wiki/Brenta_%28river%29>
>
> On Thu, Sep 3, 2009 at 3:07 PM, Mark Kerzner <[EMAIL PROTECTED]>
> wrote:
>
> > Then we should think of a name and create the project somewhere. Does not
> > have to be the same place as Hadoop, can be Google code to start with...
> > How about
> >
> > Madoop
> > Mississippi (221 bridges)
> > Danube (lotsa bridges)
> >
> > Mark
> >
> >
> >
> > On Thu, Sep 3, 2009 at 2:53 PM, Amandeep Khurana <[EMAIL PROTECTED]>
> wrote:
> >
> >> I'm interested in working on it.
> >>
> >> The paper is still not out.. Only the summary has been made available.
> Am
> >> I
> >> missing something?
> >>
> >>
> >> Amandeep Khurana
> >> Computer Science Graduate Student
> >> University of California, Santa Cruz
> >>
> >>
> >> On Thu, Sep 3, 2009 at 9:46 AM, Mark Kerzner <[EMAIL PROTECTED]>
> >> wrote:
> >>
> >> > Hi, guys,
> >> >
> >> > Pregel has been revealed on 8/11, what is your opinion of, does
> anybody
> >> > know
> >> > how to get the presentation, and is anyone interested in implementing
> >> it?
> >> >
> >> > Thank you,
> >> > Mark
> >> >
> >>
> >
> >
>

Ok, then, I can join hamburg. Where is it?

On Thu, Sep 3, 2009 at 3:12 PM, Amandeep Khurana <[EMAIL PROTECTED]> wrote:

> There is another project-  Hamburg - on similar lines. Check that out too.
>
>
> Amandeep Khurana
> Computer Science Graduate Student
> University of California, Santa Cruz
>
>
> On Thu, Sep 3, 2009 at 1:08 PM, Mark Kerzner <[EMAIL PROTECTED]>
> wrote:
>
> > Brenta
> > http://en.wikipedia.org/wiki/Brenta_(river)<
> http://en.wikipedia.org/wiki/Brenta_%28river%29>
> >
> > On Thu, Sep 3, 2009 at 3:07 PM, Mark Kerzner <[EMAIL PROTECTED]>
> > wrote:
> >
> > > Then we should think of a name and create the project somewhere. Does
> not
> > > have to be the same place as Hadoop, can be Google code to start
> with...
> > > How about
> > >
> > > Madoop
> > > Mississippi (221 bridges)
> > > Danube (lotsa bridges)
> > >
> > > Mark
> > >
> > >
> > >
> > > On Thu, Sep 3, 2009 at 2:53 PM, Amandeep Khurana <[EMAIL PROTECTED]>
> > wrote:
> > >
> > >> I'm interested in working on it.
> > >>
> > >> The paper is still not out.. Only the summary has been made available.
> > Am
> > >> I
> > >> missing something?
> > >>
> > >>
> > >> Amandeep Khurana
> > >> Computer Science Graduate Student
> > >> University of California, Santa Cruz
> > >>
> > >>
> > >> On Thu, Sep 3, 2009 at 9:46 AM, Mark Kerzner <[EMAIL PROTECTED]>
> > >> wrote:
> > >>
> > >> > Hi, guys,
> > >> >
> > >> > Pregel has been revealed on 8/11, what is your opinion of, does
> > anybody
> > >> > know
> > >> > how to get the presentation, and is anyone interested in
> implementing
> > >> it?
> > >> >
> > >> > Thank you,
> > >> > Mark
> > >> >
> > >>
> > >
> > >
> >
>

Hamburg is here: http://wiki.apache.org/hadoop/Hamburg

Ashutosh

On Thu, Sep 3, 2009 at 16:42, Mark Kerzner <[EMAIL PROTECTED]> wrote:

> Ok, then, I can join hamburg. Where is it?
>
> On Thu, Sep 3, 2009 at 3:12 PM, Amandeep Khurana <[EMAIL PROTECTED]> wrote:
>
> > There is another project-  Hamburg - on similar lines. Check that out
> too.
> >
> >
> > Amandeep Khurana
> > Computer Science Graduate Student
> > University of California, Santa Cruz
> >
> >
> > On Thu, Sep 3, 2009 at 1:08 PM, Mark Kerzner <[EMAIL PROTECTED]>
> > wrote:
> >
> > > Brenta
> > > http://en.wikipedia.org/wiki/Brenta_(river)<http://en.wikipedia.org/wiki/Brenta_%28river%29>
> <
> > http://en.wikipedia.org/wiki/Brenta_%28river%29>
> > >
> > > On Thu, Sep 3, 2009 at 3:07 PM, Mark Kerzner <[EMAIL PROTECTED]>
> > > wrote:
> > >
> > > > Then we should think of a name and create the project somewhere. Does
> > not
> > > > have to be the same place as Hadoop, can be Google code to start
> > with...
> > > > How about
> > > >
> > > > Madoop
> > > > Mississippi (221 bridges)
> > > > Danube (lotsa bridges)
> > > >
> > > > Mark
> > > >
> > > >
> > > >
> > > > On Thu, Sep 3, 2009 at 2:53 PM, Amandeep Khurana <[EMAIL PROTECTED]>
> > > wrote:
> > > >
> > > >> I'm interested in working on it.
> > > >>
> > > >> The paper is still not out.. Only the summary has been made
> available.
> > > Am
> > > >> I
> > > >> missing something?
> > > >>
> > > >>
> > > >> Amandeep Khurana
> > > >> Computer Science Graduate Student
> > > >> University of California, Santa Cruz
> > > >>
> > > >>
> > > >> On Thu, Sep 3, 2009 at 9:46 AM, Mark Kerzner <[EMAIL PROTECTED]
> >
> > > >> wrote:
> > > >>
> > > >> > Hi, guys,
> > > >> >
> > > >> > Pregel has been revealed on 8/11, what is your opinion of, does
> > > anybody
> > > >> > know
> > > >> > how to get the presentation, and is anyone interested in
> > implementing
> > > >> it?
> > > >> >
> > > >> > Thank you,
> > > >> > Mark
> > > >> >
> > > >>
> > > >
> > > >
> > >
> >
>

Hamburg has been excessively "stable" for some time.  If you want to do
something, I would recommend contributing to Mahout.

On Thu, Sep 3, 2009 at 3:51 PM, Ashutosh Chauhan <[EMAIL PROTECTED]
> wrote:

> Hamburg is here: http://wiki.apache.org/hadoop/Hamburg
>
>

But Ted,
I am interested specifically in Pregel kind of system, for distributed graph
operations, and Mahout is for distributed learning. Here what I would
ideally like to do:
   - Somebody must have info on Pregel - it's out, has been presented, and
   the information is public. Anybody has been there and can at least re-tell?
   The subscriptions are expensive, but I could buy one copy of the article, if
   it is available. I will also write directly to the authors;
   - Study that and discuss relevant information and architecture;
   - Do the first implementation.

I personally don't like the name Hamburg, but I could live with that.

Mark

On Thu, Sep 3, 2009 at 6:36 PM, Ted Dunning <[EMAIL PROTECTED]> wrote:

> Hamburg has been excessively "stable" for some time.  If you want to do
> something, I would recommend contributing to Mahout.
>
> On Thu, Sep 3, 2009 at 3:51 PM, Ashutosh Chauhan <
> [EMAIL PROTECTED]
> > wrote:
>
> > Hamburg is here: http://wiki.apache.org/hadoop/Hamburg
> >
> >
>

We've already made a prototype of Hamburg based on multi thread. It's
a BSP based graph computing framework, not a M/R based application.

Please Join to ... http://groups.google.com/group/hamburg-dev

On Fri, Sep 4, 2009 at 8:45 AM, Mark Kerzner<[EMAIL PROTECTED]> wrote:
> But Ted,
> I am interested specifically in Pregel kind of system, for distributed graph
> operations, and Mahout is for distributed learning. Here what I would
> ideally like to do:
>
>
>   - Somebody must have info on Pregel - it's out, has been presented, and
>   the information is public. Anybody has been there and can at least re-tell?
>   The subscriptions are expensive, but I could buy one copy of the article, if
>   it is available. I will also write directly to the authors;
>   - Study that and discuss relevant information and architecture;
>   - Do the first implementation.
>
> I personally don't like the name Hamburg, but I could live with that.
>
> Mark
>
> On Thu, Sep 3, 2009 at 6:36 PM, Ted Dunning <[EMAIL PROTECTED]> wrote:
>
>> Hamburg has been excessively "stable" for some time.  If you want to do
>> something, I would recommend contributing to Mahout.
>>
>> On Thu, Sep 3, 2009 at 3:51 PM, Ashutosh Chauhan <
>> [EMAIL PROTECTED]
>> > wrote:
>>
>> > Hamburg is here: http://wiki.apache.org/hadoop/Hamburg
>> >
>> >
>>
>

--
Best Regards, Edward J. Yoon @ NHN, corp.
[EMAIL PROTECTED]
http://blog.udanax.org

You would be entirely welcome in Mahout.   Graph based algorithms are key
for lots of kinds of interesting learning and would be a fabulous thing to
have in a comprehensive substrate.

I personally would also be very interested in learning more about about what
sorts of things Pregel is doing.  It is relatively easy to build simple
graph algorithms on top of Map-reduce, but these algorithms typically
require a map-reduce iteration to propagate information.  Good algorithms
for that architecture have exponential propagation so that you don't need a
huge number of iterations.  It smelled like Pregel was doing something much
more interesting.

On Thu, Sep 3, 2009 at 4:45 PM, Mark Kerzner <[EMAIL PROTECTED]> wrote:

> But Ted,
> I am interested specifically in Pregel kind of system, for distributed
> graph
> operations, and Mahout is for distributed learning. Here what I would
> ideally like to do:
>
>
>   - Somebody must have info on Pregel - it's out, has been presented, and
>   the information is public. Anybody has been there and can at least
> re-tell?
>   The subscriptions are expensive, but I could buy one copy of the article,
> if
>   it is available. I will also write directly to the authors;
>   - Study that and discuss relevant information and architecture;
>   - Do the first implementation.
>
> I personally don't like the name Hamburg, but I could live with that.
>
>

Just FYI, Hama (Hadoop Matrix, http://incubator.apache.org/hama) also
consider adopting this computing model based on bulk synchronous
parallel.

On Fri, Sep 4, 2009 at 9:57 AM, Edward J. Yoon<[EMAIL PROTECTED]> wrote:
> We've already made a prototype of Hamburg based on multi thread. It's
> a BSP based graph computing framework, not a M/R based application.
>
> Please Join to ... http://groups.google.com/group/hamburg-dev
>
> On Fri, Sep 4, 2009 at 8:45 AM, Mark Kerzner<[EMAIL PROTECTED]> wrote:
>> But Ted,
>> I am interested specifically in Pregel kind of system, for distributed graph
>> operations, and Mahout is for distributed learning. Here what I would
>> ideally like to do:
>>
>>
>>   - Somebody must have info on Pregel - it's out, has been presented, and
>>   the information is public. Anybody has been there and can at least re-tell?
>>   The subscriptions are expensive, but I could buy one copy of the article, if
>>   it is available. I will also write directly to the authors;
>>   - Study that and discuss relevant information and architecture;
>>   - Do the first implementation.
>>
>> I personally don't like the name Hamburg, but I could live with that.
>>
>> Mark
>>
>> On Thu, Sep 3, 2009 at 6:36 PM, Ted Dunning <[EMAIL PROTECTED]> wrote:
>>
>>> Hamburg has been excessively "stable" for some time.  If you want to do
>>> something, I would recommend contributing to Mahout.
>>>
>>> On Thu, Sep 3, 2009 at 3:51 PM, Ashutosh Chauhan <
>>> [EMAIL PROTECTED]
>>> > wrote:
>>>
>>> > Hamburg is here: http://wiki.apache.org/hadoop/Hamburg
>>> >
>>> >
>>>
>>
>
>
>
> --
> Best Regards, Edward J. Yoon @ NHN, corp.
> [EMAIL PROTECTED]
> http://blog.udanax.org
>

--
Best Regards, Edward J. Yoon @ NHN, corp.
[EMAIL PROTECTED]
http://blog.udanax.org

On Thu, Sep 3, 2009 at 6:55 PM, Ted Dunning <[EMAIL PROTECTED]> wrote:

> You would be entirely welcome in Mahout.   Graph based algorithms are key
> for lots of kinds of interesting learning and would be a fabulous thing to
> have in a comprehensive substrate.
>
> I personally would also be very interested in learning more about about
> what
> sorts of things Pregel is doing.  It is relatively easy to build simple
> graph algorithms on top of Map-reduce, but these algorithms typically
> require a map-reduce iteration to propagate information.  Good algorithms
> for that architecture have exponential propagation so that you don't need a
> huge number of iterations.  It smelled like Pregel was doing something much
> more interesting.
>

I second that.. Looks like Pregel is something more than just propagation.
However, the paper is still not available on ACM's website. So, we dont know
any details yet... Lets just wait for that to be available before talking
more about it.
>
> On Thu, Sep 3, 2009 at 4:45 PM, Mark Kerzner <[EMAIL PROTECTED]>
> wrote:
>
> > But Ted,
> > I am interested specifically in Pregel kind of system, for distributed
> > graph
> > operations, and Mahout is for distributed learning. Here what I would
> > ideally like to do:
> >
> >
> >   - Somebody must have info on Pregel - it's out, has been presented, and
> >   the information is public. Anybody has been there and can at least
> > re-tell?
> >   The subscriptions are expensive, but I could buy one copy of the
> article,
> > if
> >   it is available. I will also write directly to the authors;
> >   - Study that and discuss relevant information and architecture;
> >   - Do the first implementation.
> >
> > I personally don't like the name Hamburg, but I could live with that.
> >
> >
>

Are there any production applications that use Hama?

On Thu, Sep 3, 2009 at 7:07 PM, Edward J. Yoon <[EMAIL PROTECTED]>wrote:

> Just FYI, Hama (Hadoop Matrix, http://incubator.apache.org/hama) also
> consider adopting this computing model based on bulk synchronous
> parallel.
>
> On Fri, Sep 4, 2009 at 9:57 AM, Edward J. Yoon<[EMAIL PROTECTED]>
> wrote:
> > We've already made a prototype of Hamburg based on multi thread. It's
> > a BSP based graph computing framework, not a M/R based application.
> >
> > Please Join to ... http://groups.google.com/group/hamburg-dev
>

--
Ted Dunning, CTO
DeepDyve

Ted Dunning wrote:
> You would be entirely welcome in Mahout.   Graph based algorithms are key
> for lots of kinds of interesting learning and would be a fabulous thing to
> have in a comprehensive substrate.
>
> I personally would also be very interested in learning more about about what
> sorts of things Pregel is doing.  It is relatively easy to build simple
> graph algorithms on top of Map-reduce, but these algorithms typically
> require a map-reduce iteration to propagate information.  Good algorithms
> for that architecture have exponential propagation so that you don't need a
> huge number of iterations.  It smelled like Pregel was doing something much
> more interesting.
>

Exactly, it is not pushing bits of the graph around. Instead it has
partitioned the graph to different machines, and is pushing the work out
to the relevant bits of the graph, a sort of GraphReduce. I believe, not
having seen the code myself :)