flink-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Vasia Kalavri (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (FLINK-1536) Graph partitioning operators for Gelly
Date Sun, 29 May 2016 20:17:12 GMT

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

Vasia Kalavri commented on FLINK-1536:
--------------------------------------

Hi [~rohit13k],
a graph in gelly is represented by 2 datasets; for vertices and edges. Datasets are distributed
immutable collections of data. That is, additions or removals return a new Graph.

> 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)

Mime
View raw message