[
https://issues.apache.org/jira/browse/FLINK-1536?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14353709#comment-14353709
]
joey commented on FLINK-1536:
-----------------------------
Thank you, I will pay attention to it. Now i am try to get familiar with Flink
and Gelly. It's really a cool project. By the way, it looks like that GSOC asks
the candidate to submit Push Request(github) or patches before joining the
selection procedure, is that true? Nevertheless, I am new to open source
project and hopefully may join your project. Now, I am 2nd year PhD student in
France, mainly do research in graph combinatorial optimization (max clique,
clique clustering, graph partition, etc).
> 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
(v6.3.4#6332)
