[
https://issues.apache.org/jira/browse/FLINK-1536?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14350558#comment-14350558
]
Vasia Kalavri commented on FLINK-1536:
--------------------------------------
Hi [~ayd]!
As a first step, it would be nice to get familiar with Flink and Gelly. I would
suggest you take a look in the [Flink documentation |
http://ci.apache.org/projects/flink/flink-docs-release-0.8/] and the [Gelly
guide |
http://ci.apache.org/projects/flink/flink-docs-master/gelly_guide.html]. Also,
go through the [Flink examples |
http://github.com/apache/flink/tree/master/flink-examples] and the [Gelly
examples |
http://github.com/apache/flink/tree/master/flink-staging/flink-gelly/src/main/java/org/apache/flink/graph/example].
Once you're confident enough, you can pick one of the [starter issues |
http://issues.apache.org/jira/browse/FLINK-992?jql=project%20%3D%20FLINK%20AND%20labels%20%3D%20starter]
and try to make your first contribution to Flink :-)
For GSoC, you will have to write up a proposal for a project. If you're
interested in working on Gelly, I can help you with that!
Make sure you subscribe to the mailing lists and let us know if you have any
questions!
-Vasia.
> 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)
