[
https://issues.apache.org/jira/browse/GIRAPH-908?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14027242#comment-14027242
]
Hudson commented on GIRAPH-908:
-------------------------------
ABORTED: Integrated in Giraph-trunk-Commit #1452 (See
[https://builds.apache.org/job/Giraph-trunk-Commit/1452/])
GIRAPH-918: GIRAPH-908 has a small bug reg counting entries (pavanka) (pavanka:
http://git-wip-us.apache.org/repos/asf?p=giraph.git&a=commit&h=ffdddff32e7ac6e2cbb5ae8471c1192c69ac6a94)
* CHANGELOG
* giraph-core/src/main/java/org/apache/giraph/worker/BspServiceWorker.java
> support for partitioned input in giraph
> ---------------------------------------
>
> Key: GIRAPH-908
> URL: https://issues.apache.org/jira/browse/GIRAPH-908
> Project: Giraph
> Issue Type: Sub-task
> Reporter: Pavan Kumar
> Assignee: Pavan Kumar
> Attachments: GIRAPH-908.patch
>
>
> When the graph we need to work on is already partitioned into a fixed number
> of buckets, with properties such as high edge-locality, low fan-out to other
> buckets, etc. [for instance using techniques such as
> https://people.cam.cornell.edu/~jugander/papers/wsdm13-blp.pdf ]
> we should be able to partition our graph based on such a mapping, to improve
> local-requests, etc. thus avoiding huge network communication. this diff is
> especially useful we repeatedly run algorithms on top of the same graph. In
> such case, we can compute the partitioning once & then use it to speed up
> processing, (also requiring less network bandwidth, etc.) for the rest
> applications on same/ similar graphs.
> The diff is big & partly reviewed by my colleagues. Putting it up for review
--
This message was sent by Atlassian JIRA
(v6.2#6252)
