flink-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Ivan Mushketyk (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (FLINK-1536) Graph partitioning operators for Gelly
Date Mon, 21 Nov 2016 12:13:58 GMT

    [ https://issues.apache.org/jira/browse/FLINK-1536?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15683429#comment-15683429

Ivan Mushketyk commented on FLINK-1536:

Good I'll give it a try after I am done with Bipartite graphs.

As far as I understand there are a number of algorithms for splitting a bipartite graph. Do
you have any preferences regarding what algorithm to implement first?

> 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

View raw message