giraph-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Eli Reisman (JIRA)" <>
Subject [jira] [Commented] (GIRAPH-535) Range-partitioning and edge locality benchmark
Date Mon, 25 Feb 2013 19:10:12 GMT


Eli Reisman commented on GIRAPH-535:

I have not had a chance to build it yet, but I had looked at the code in some detail and I
like everything I see.

> Range-partitioning and edge locality benchmark
> ----------------------------------------------
>                 Key: GIRAPH-535
>                 URL:
>             Project: Giraph
>          Issue Type: New Feature
>            Reporter: Alessandro Presta
>            Assignee: Alessandro Presta
>         Attachments: GIRAPH-535.patch
> Range-based partitioning can drastically reduce network communication when using a vertex
id space where close ids correspond to vertices likely to be connected.
> We currently have an incomplete implementation of range-based partitioning that tries
to be very generic (allowing arbitrarily different partition sizes).
> Talking about this with Avery, we thought that for now it's better to add a simpler version
(which tries to split as evenly as possible) and leave the current classes there in case someone
wants to implement a more complex logic.
> A nice-to-have is also extending the pseudo-random formats to generate a required ratio
of partition-local edges, in order to estimate the impact of locality with benchmarks.

This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see:

View raw message