giraph-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Jonathan Bishop <jbishop....@gmail.com>
Subject Re: Minimum superstep time
Date Tue, 27 Nov 2012 21:53:58 GMT
Sebastian,

I am evaluating a directed acyclic graph (DAG). So the vertices in one
superstep are not dependent on each other, only upon their predecessors.

What do you mean "execute the messaging simultaneously"? I am simply using
BasicVertex.sendMsg() during BasicVertex.compute(). Is there another way to
do this?

Jon




On Tue, Nov 27, 2012 at 10:19 AM, Sebastian Schelter <ssc@apache.org> wrote:

> Are the vertices which are active in supersteps dependent on each other?
> If this is not the case, you could try to execute the messaging
> simultaneously.
>
> Could you give a little more details about the problem, which you are
> trying to solve?
>
> /s
>
>
> On 27.11.2012 19:07, Jonathan Bishop wrote:
> > Hi,
> >
> > I am involved in a project which requires thousands of supersteps. In
> each
> > superstep there are about 1 thousand vertices, each sending a message.
> The
> > message size is not large, about 40 bytes or so.
> >
> > I am seeing abouth 3000-5000ms per superstep. I am curious what others
> with
> > similar problem sizes are seeing.
> >
> > Thanks,
> >
> > Jon
> >
>
>

Mime
View raw message