flink-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "joey (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (FLINK-1536) GSoC project: Graph partitioning operators for Gelly
Date Sat, 07 Mar 2015 16:19:38 GMT

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

joey commented on FLINK-1536:

Hello, i am interested in this propose and I have knowledge in some graph partition  techniques(multi-level
and evolutionary). Before start, just  two questions.Is the algorithm implemented parallelized
or serialized.?  How big are the input graphs? Thank you

> GSoC project: 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, Java API
>            Reporter: Vasia Kalavri
>            Priority: Minor
>              Labels: graph, gsoc2015, java
> 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