Hi Jeyendran, I was just sayiing the same thing about the documentation on another thread, couldn't agree more. There will be progress on this soon, I promise. I'd like us to reach a model of "if you add a new feature or change a core feature, the patch gets committed contingent on a new wiki page of docs going up on the website." There's still nothing about our new Vertex API, master compute, etc. on the wiki.
I would say 8 gigs to play with is a great amount where you will most definitely be able to get very large interesting graphs to run in-memory, depending on how many workers (with 8G each) you have to work with. having 3-4 workers per machine is not a bad thing if you are provisioned to do this. And lots of machines. This is a distributed batch processing framework, so more is better ;)
as far as vertices with a million edges, sure but it depends on how many of them and your compute resources. Again, can't go into much detail but Giraph has been extensively tested using real-world, large, interesting, useful graph data. This includes large social graphs that have supernodes. So if you're supplying that, and you have the gear to run your data, you've picked the right tool. You can spill to disk, run in memory, or spread the load and scale to many, many workers (Mapper tasks) hosted on many nodes and Giraph will behave well if you have the compute resource to scale to fit your volume of data.
Hi Jeyendran, nice to meet you.
Answers inline.All vertices assigned to that worker.
On 9/10/12 11:23 PM, Jeyendran Balakrishnan wrote:
I am trying to understand what kind of data Giraph holds in memory per
My questions in descending order of importance:
1. Does Giraph hold in memory exactly one vertex of data at a time, or does
it need to hold all the vertexes assigned to that worker?
Depends on how much memory you have. Would recommend making a custom vertex implementation that has a very efficient store for better scalability (i.e. see IntIntNullIntVertex).
2. Can Giraph handle vertexes with, a million edges per vertex?
Limitations are that the vertex implementation must be Writable, the vertex index must be WritableComparable, edge type Writable, message type Writable.
If not, at what order of magnitude does it break down? - 1000 edges, 10K
edges, 100K edges?...
(Of course, I understand that this depends upon the -Xmx value, so let's
say we fix a value of -Xmx8g).
3. Are there any limitations on the kind of objects that can be used as
Specifically, does Giraph assume that vertices are lightweight (eg,
integer vertex ID + simple Java primitive vertex values + collection of
or can Giraph support heavyweight vertices (hold complex nested Java
objects in a vertex)?
Messages and vertices can be spilled to disk, but you must enable this.
4. More generally, what data is stored in memory, and what, if any, is
offloaded/spilled to disk?
Agreed that documentation is lacking =). That being said, the presentations explain most of the design approach and reasons. I would refer to the Pregel paper for a more detailed look or ask if you have any specific questions.
Would appreciate any light the experts can throw on this.
On this note, I would like to mention that the presentations posted on the
Wiki explain what Giraph can do, and how to use it from a coding
perspective, but there are no explanations of the design approach used, the
rationale behind the choices, and the software architecture. I feel that new
users can really benefit from a design and architecture document, along the
lines of Hadoop and Lucene. For folks who are considering whether or not to
use Giraph, this can be a big help. The only alternative today is to read
the source code, the burden of which might in itself be reason for folks not
to consider using Giraph.
My 2c :-)
Thanks a lot,