[jira] [Commented] (GIRAPH-1134) Track number of input splits in command line
[ https://issues.apache.org/jira/browse/GIRAPH-1134?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel=15930356#comment-15930356 ] ASF GitHub Bot commented on GIRAPH-1134: Github user asfgit closed the pull request at: https://github.com/apache/giraph/pull/24 > Track number of input splits in command line > > > Key: GIRAPH-1134 > URL: https://issues.apache.org/jira/browse/GIRAPH-1134 > Project: Giraph > Issue Type: Improvement >Reporter: Maja Kabiljo >Assignee: Maja Kabiljo >Priority: Minor > > The progress we track during input reports how much data have we read, but > not how much data there is to read. -- This message was sent by Atlassian JIRA (v6.3.15#6346)
[jira] [Comment Edited] (GIRAPH-1135) Implementing Minimum Spanning Tree in vertex-centric model
[ https://issues.apache.org/jira/browse/GIRAPH-1135?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel=15929499#comment-15929499 ] Lahiru edited comment on GIRAPH-1135 at 3/17/17 7:01 AM: - Hi I'm Lahiru and I am a Computer Engineering student at University of Peradeniya, Sri Lanka. I have good knowledge in following fields Data structures and algorithms, Python, C, C++, java,... I am interested in this gsoc project and I would like to contribute for the project. Can you please provide more additional details about this project??? was (Author: asamala): Hi I'm Lahiru and I am a Computer Engineering student at University of Peradeniya, Sri Lanka. I have good knowledge in following fields Data structures and algorithms, Python, C, C++, java,... I am interested in this gsoc project and I would like to contribute for the project. my linked in profile https://www.linkedin.com/in/lahiruls Can you please provide more additional details about this project??? > Implementing Minimum Spanning Tree in vertex-centric model > -- > > Key: GIRAPH-1135 > URL: https://issues.apache.org/jira/browse/GIRAPH-1135 > Project: Giraph > Issue Type: Improvement > Components: examples >Reporter: Claudio Martella >Assignee: Alessio Arleo > Labels: gsoc2017 > > A Minimum Spanning Tree is a tree that spans all the vertices of a connected > graph such that the sum of the weights is minimum among all possible such > trees. Finding Minimum Spanning Tree on a large graph has many applications. > MST algorithm is one of the basic graph algorithms. Currently, Giraph has an > implementation of Page Rank algorithm as part of its source code. An > implementation of MST algorithm will strengthen our use cases. > Recently Mohsen Ghaffari et al. have shown that MST can be calculated in > O(log* n) rounds of communications in Congested Clique model [1]. Congested > Clique have been shown to be the impromptu distributed algorithmic model > which has direct relations with Pregel. We can try to implement the paradigm > in Giraph. > [1] MST in Log-Star Rounds of Congested Clique :- > http://dl.acm.org/citation.cfm?id=2933103 -- This message was sent by Atlassian JIRA (v6.3.15#6346)
[jira] [Comment Edited] (GIRAPH-1135) Implementing Minimum Spanning Tree in vertex-centric model
[ https://issues.apache.org/jira/browse/GIRAPH-1135?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel=15929499#comment-15929499 ] Lahiru edited comment on GIRAPH-1135 at 3/17/17 6:50 AM: - Hi I'm Lahiru and I am a Computer Engineering student at University of Peradeniya, Sri Lanka. I have good knowledge in following fields Data structures and algorithms, Python, C, C++, java,... I am interested in this gsoc project and I would like to contribute for the project. my linked in profile https://www.linkedin.com/in/lahiruls Can you please provide more additional details about this project was (Author: asamala): Hi I'm Lahiru and I am a Computer Engineering student at University of Peradeniya, Sri Lanka. I have good knowledge in following fields Data structures and algorithms, Python, C, C++, java,... I am interested in this gsoc project and I would like to contribute for the project. my linked in profile https://www.linkedin.com/in/lahiruls > Implementing Minimum Spanning Tree in vertex-centric model > -- > > Key: GIRAPH-1135 > URL: https://issues.apache.org/jira/browse/GIRAPH-1135 > Project: Giraph > Issue Type: Improvement > Components: examples >Reporter: Claudio Martella >Assignee: Alessio Arleo > Labels: gsoc2017 > > A Minimum Spanning Tree is a tree that spans all the vertices of a connected > graph such that the sum of the weights is minimum among all possible such > trees. Finding Minimum Spanning Tree on a large graph has many applications. > MST algorithm is one of the basic graph algorithms. Currently, Giraph has an > implementation of Page Rank algorithm as part of its source code. An > implementation of MST algorithm will strengthen our use cases. > Recently Mohsen Ghaffari et al. have shown that MST can be calculated in > O(log* n) rounds of communications in Congested Clique model [1]. Congested > Clique have been shown to be the impromptu distributed algorithmic model > which has direct relations with Pregel. We can try to implement the paradigm > in Giraph. > [1] MST in Log-Star Rounds of Congested Clique :- > http://dl.acm.org/citation.cfm?id=2933103 -- This message was sent by Atlassian JIRA (v6.3.15#6346)
[jira] [Commented] (GIRAPH-1135) Implementing Minimum Spanning Tree in vertex-centric model
[ https://issues.apache.org/jira/browse/GIRAPH-1135?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel=15929499#comment-15929499 ] Lahiru commented on GIRAPH-1135: Hi I'm Lahiru and I am a Computer Engineering student at University of Peradeniya, Sri Lanka. I have good knowledge in following fields Data structures and algorithms, Python, C, C++, java,... I am interested in this gsoc project and I would like to contribute for the project. my linked in profile https://www.linkedin.com/in/lahiruls > Implementing Minimum Spanning Tree in vertex-centric model > -- > > Key: GIRAPH-1135 > URL: https://issues.apache.org/jira/browse/GIRAPH-1135 > Project: Giraph > Issue Type: Improvement > Components: examples >Reporter: Claudio Martella >Assignee: Alessio Arleo > Labels: gsoc2017 > > A Minimum Spanning Tree is a tree that spans all the vertices of a connected > graph such that the sum of the weights is minimum among all possible such > trees. Finding Minimum Spanning Tree on a large graph has many applications. > MST algorithm is one of the basic graph algorithms. Currently, Giraph has an > implementation of Page Rank algorithm as part of its source code. An > implementation of MST algorithm will strengthen our use cases. > Recently Mohsen Ghaffari et al. have shown that MST can be calculated in > O(log* n) rounds of communications in Congested Clique model [1]. Congested > Clique have been shown to be the impromptu distributed algorithmic model > which has direct relations with Pregel. We can try to implement the paradigm > in Giraph. > [1] MST in Log-Star Rounds of Congested Clique :- > http://dl.acm.org/citation.cfm?id=2933103 -- This message was sent by Atlassian JIRA (v6.3.15#6346)
