[
https://issues.apache.org/jira/browse/FLINK-1536?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15286478#comment-15286478
]
Vasia Kalavri commented on FLINK-1536:
--------------------------------------
Hi [~rohit13k],
thank you for your interest. As far as I know nobody is currently working on
this JIRA. Bear in mind that Gelly is built on top of the Flink DataSet API,
i.e. it only supports static graphs, so I don't think this JIRA is the right
place to start if you want to experiment with dynamic graph partitioning.
You might want to take a look at gelly-stream, a WIP graph streaming API that
[~senorcarbone] and I have been working on. You can find our code
[here|https://github.com/vasia/gelly-streaming]. We are currently working with
a student on adding stream partitioning. If you're interested, feel free to
start a discussion on that repository.
> Graph partitioning operators for Gelly
> --------------------------------------
>
> Key: FLINK-1536
> URL: https://issues.apache.org/jira/browse/FLINK-1536
> Project: Flink
> Issue Type: New Feature
> Components: Gelly
> Reporter: Vasia Kalavri
> Priority: Minor
>
> Smart graph partitioning can significantly improve the performance and
> scalability of graph analysis applications. Depending on the computation
> pattern, a graph partitioning algorithm divides the graph into (maybe
> overlapping) subgraphs, optimizing some objective. For example, if
> communication is performed across graph edges, one might want to minimize the
> edges that cross from one partition to another.
> The problem of graph partitioning is a well studied problem and several
> algorithms have been proposed in the literature. The goal of this project
> would be to choose a few existing partitioning techniques and implement the
> corresponding graph partitioning operators for Gelly.
> Some related literature can be found [here|
> http://www.citeulike.org/user/vasiakalavri/tag/graph-partitioning].
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
