[
https://issues.apache.org/jira/browse/FLINK-1536?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17321770#comment-17321770
]
Flink Jira Bot commented on FLINK-1536:
---------------------------------------
This issue and all of its Sub-Tasks have not been updated for 180 days. So, it
has been labeled "stale-minor". If you are still affected by this bug or are
still interested in this issue, please give an update and remove the label. In
7 days the issue will be closed automatically.
> Graph partitioning operators for Gelly
> --------------------------------------
>
> Key: FLINK-1536
> URL: https://issues.apache.org/jira/browse/FLINK-1536
> Project: Flink
> Issue Type: New Feature
> Components: Library / Graph Processing (Gelly)
> Reporter: Vasia Kalavri
> Assignee: Ivan Mushketyk
> Priority: Minor
> Labels: stale-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
(v8.3.4#803005)
