[jira] [Closed] (FLINK-1536) Graph partitioning operators for Gelly

["Martijn Visser (Jira)" <ji...@apache.org>]

     [ https://issues.apache.org/jira/browse/FLINK-1536?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Martijn Visser closed FLINK-1536.
---------------------------------
    Resolution: Won't Fix

Gelly has been removed, see FLINK-29668

> 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: Not a Priority
>              Labels: stale-assigned
>
> 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.20.10#820010)