You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@hama.apache.org by "Edward J. Yoon" <ed...@apache.org> on 2009/07/02 03:24:58 UTC
Re: FYI, Large-scale graph computing at google.
See : http://wiki.apache.org/hama/Hamburg
On Mon, Jun 22, 2009 at 3:28 PM, Edward J. Yoon<ed...@apache.org> wrote:
> Hmm, It sounds like Pregel seems a computing framework for the graph
> using dynamic programming. And,
>
> "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"
>
> They seems use the network communication instead of map/red
> 'intermediate file'. Check this out -- Bulk Synchronous Parallel Model
> (http://en.wikipedia.org/wiki/Bulk_Synchronous_Parallel)
>
> On Mon, Jun 22, 2009 at 11:59 AM, Edward J. Yoon<ed...@apache.org> wrote:
>> http://googleresearch.blogspot.com/2009/06/large-scale-graph-computing-at-google.html
>>
>> --
>> Best Regards, Edward J. Yoon @ NHN, corp.
>> edwardyoon@apache.org
>> http://blog.udanax.org
>>
>
>
>
> --
> Best Regards, Edward J. Yoon @ NHN, corp.
> edwardyoon@apache.org
> http://blog.udanax.org
>
--
Best Regards, Edward J. Yoon @ NHN, corp.
edwardyoon@apache.org
http://blog.udanax.org
Re: FYI, Large-scale graph computing at google.
Posted by "Edward J. Yoon" <ed...@apache.org>.
FYI, In this paper -- 'Bulk Synchronous Parallel Computing - A
Paradigm for Transportable Software', 'BSP-L implementation of the
efficient matrix multiplication algorithm' was introduced.
On Thu, Jul 2, 2009 at 4:14 PM, Edward J. Yoon<ed...@apache.org> wrote:
> Yeah, It really great. I little talked about it with Greg Malewicz.
>
> If you have a interest, let's attend the PODC.
>
> On Thu, Jul 2, 2009 at 11:25 AM, Samuel Guo<gu...@gmail.com> wrote:
>> It sounds great!
>> A new paradigm is suitable for graph computing.
>>
>> On Thu, Jul 2, 2009 at 9:24 AM, Edward J. Yoon <ed...@apache.org>wrote:
>>
>>> See : http://wiki.apache.org/hama/Hamburg
>>>
>>> On Mon, Jun 22, 2009 at 3:28 PM, Edward J. Yoon<ed...@apache.org>
>>> wrote:
>>> > Hmm, It sounds like Pregel seems a computing framework for the graph
>>> > using dynamic programming. And,
>>> >
>>> > "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"
>>> >
>>> > They seems use the network communication instead of map/red
>>> > 'intermediate file'. Check this out -- Bulk Synchronous Parallel Model
>>> > (http://en.wikipedia.org/wiki/Bulk_Synchronous_Parallel)
>>> >
>>> > On Mon, Jun 22, 2009 at 11:59 AM, Edward J. Yoon<ed...@apache.org>
>>> wrote:
>>> >>
>>> http://googleresearch.blogspot.com/2009/06/large-scale-graph-computing-at-google.html
>>> >>
>>> >> --
>>> >> Best Regards, Edward J. Yoon @ NHN, corp.
>>> >> edwardyoon@apache.org
>>> >> http://blog.udanax.org
>>> >>
>>> >
>>> >
>>> >
>>> > --
>>> > Best Regards, Edward J. Yoon @ NHN, corp.
>>> > edwardyoon@apache.org
>>> > http://blog.udanax.org
>>> >
>>>
>>>
>>>
>>> --
>>> Best Regards, Edward J. Yoon @ NHN, corp.
>>> edwardyoon@apache.org
>>> http://blog.udanax.org
>>>
>>
>
>
>
> --
> Best Regards, Edward J. Yoon @ NHN, corp.
> edwardyoon@apache.org
> http://blog.udanax.org
>
--
Best Regards, Edward J. Yoon @ NHN, corp.
edwardyoon@apache.org
http://blog.udanax.org
Re: FYI, Large-scale graph computing at google.
Posted by "Edward J. Yoon" <ed...@apache.org>.
Yeah, It really great. I little talked about it with Greg Malewicz.
If you have a interest, let's attend the PODC.
On Thu, Jul 2, 2009 at 11:25 AM, Samuel Guo<gu...@gmail.com> wrote:
> It sounds great!
> A new paradigm is suitable for graph computing.
>
> On Thu, Jul 2, 2009 at 9:24 AM, Edward J. Yoon <ed...@apache.org>wrote:
>
>> See : http://wiki.apache.org/hama/Hamburg
>>
>> On Mon, Jun 22, 2009 at 3:28 PM, Edward J. Yoon<ed...@apache.org>
>> wrote:
>> > Hmm, It sounds like Pregel seems a computing framework for the graph
>> > using dynamic programming. And,
>> >
>> > "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"
>> >
>> > They seems use the network communication instead of map/red
>> > 'intermediate file'. Check this out -- Bulk Synchronous Parallel Model
>> > (http://en.wikipedia.org/wiki/Bulk_Synchronous_Parallel)
>> >
>> > On Mon, Jun 22, 2009 at 11:59 AM, Edward J. Yoon<ed...@apache.org>
>> wrote:
>> >>
>> http://googleresearch.blogspot.com/2009/06/large-scale-graph-computing-at-google.html
>> >>
>> >> --
>> >> Best Regards, Edward J. Yoon @ NHN, corp.
>> >> edwardyoon@apache.org
>> >> http://blog.udanax.org
>> >>
>> >
>> >
>> >
>> > --
>> > Best Regards, Edward J. Yoon @ NHN, corp.
>> > edwardyoon@apache.org
>> > http://blog.udanax.org
>> >
>>
>>
>>
>> --
>> Best Regards, Edward J. Yoon @ NHN, corp.
>> edwardyoon@apache.org
>> http://blog.udanax.org
>>
>
--
Best Regards, Edward J. Yoon @ NHN, corp.
edwardyoon@apache.org
http://blog.udanax.org
Re: FYI, Large-scale graph computing at google.
Posted by Samuel Guo <gu...@gmail.com>.
It sounds great!
A new paradigm is suitable for graph computing.
On Thu, Jul 2, 2009 at 9:24 AM, Edward J. Yoon <ed...@apache.org>wrote:
> See : http://wiki.apache.org/hama/Hamburg
>
> On Mon, Jun 22, 2009 at 3:28 PM, Edward J. Yoon<ed...@apache.org>
> wrote:
> > Hmm, It sounds like Pregel seems a computing framework for the graph
> > using dynamic programming. And,
> >
> > "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"
> >
> > They seems use the network communication instead of map/red
> > 'intermediate file'. Check this out -- Bulk Synchronous Parallel Model
> > (http://en.wikipedia.org/wiki/Bulk_Synchronous_Parallel)
> >
> > On Mon, Jun 22, 2009 at 11:59 AM, Edward J. Yoon<ed...@apache.org>
> wrote:
> >>
> http://googleresearch.blogspot.com/2009/06/large-scale-graph-computing-at-google.html
> >>
> >> --
> >> Best Regards, Edward J. Yoon @ NHN, corp.
> >> edwardyoon@apache.org
> >> http://blog.udanax.org
> >>
> >
> >
> >
> > --
> > Best Regards, Edward J. Yoon @ NHN, corp.
> > edwardyoon@apache.org
> > http://blog.udanax.org
> >
>
>
>
> --
> Best Regards, Edward J. Yoon @ NHN, corp.
> edwardyoon@apache.org
> http://blog.udanax.org
>