You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@flink.apache.org by greghogan <gi...@git.apache.org> on 2017/02/09 16:29:37 UTC

[GitHub] flink issue #2733: [FLINK-4896] [gelly] PageRank algorithm for directed grap...

Github user greghogan commented on the issue:

    https://github.com/apache/flink/pull/2733
  
    Running on a c4.xlarge with 4 slots and a 4 GB preallocated TaskManager heap. EdgeList measures the time to simplify the graph since the library PageRank using Scatter-Gather ("PageRankSG") requires each vertex to have both incoming and outgoing edges. "PageRank" is the algorithm from this PR.
    
    Algorithm | Scale 16 | Scale 18
    ------------ | ------------- | -------------
    EdgeList | 2537 ms | 8779 ms
    PageRank | 9563 ms | 39558 ms
    PageRankSG | 11188 ms | 47736 ms


---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at infrastructure@apache.org or file a JIRA ticket
with INFRA.
---