hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Thomas Jungblut <thomas.jungb...@gmail.com>
Subject Re: Question on GraphJobRunner
Date Mon, 12 Nov 2012 18:08:22 GMT
>
> Did we hit a scalability bottleneck here?


yes.

2012/11/12 Suraj Menon <menonsuraj5@gmail.com>

> In the GraphJobRunner implementation, during the runtime-partitioning
> phase, each peer reads a vertex from input and sends the vertex to the
>  peer that holds the partition and then gets into sync.  Why are we not
> reading all the vertices and sending all vertices to their respective peers
> all at once in one sync? Did we hit a scalability bottleneck here?
>
> Just found this when I was re-factoring the graph code with Superstep
> chaining. Apologies, if this was already discussed and I am late to the
> party.
>
> -Suraj
>

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message