You are viewing a plain text version of this content. The canonical link for it is here.
Posted to issues@flink.apache.org by "Ivan Mushketyk (JIRA)" <ji...@apache.org> on 2016/11/20 13:10:58 UTC
[jira] [Commented] (FLINK-1536) Graph partitioning operators for
Gelly
[ https://issues.apache.org/jira/browse/FLINK-1536?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15681133#comment-15681133 ]
Ivan Mushketyk commented on FLINK-1536:
---------------------------------------
Hi [~vkalavri]
What is the status of this task? Is anybody working on this at the moment?
If nobody is working I would be interested in working on this.
> 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)