You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@giraph.apache.org by "Dionysios Logothetis (Jira)" <ji...@apache.org> on 2020/05/12 18:22:00 UTC
[jira] [Resolved] (GIRAPH-26) Improve PseudoRandomVertexInputFormat
to create a more realistic synthetic graph (e.g. power-law distributed
vertex-cardinality).
[ https://issues.apache.org/jira/browse/GIRAPH-26?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]
Dionysios Logothetis resolved GIRAPH-26.
----------------------------------------
Resolution: Fixed
> Improve PseudoRandomVertexInputFormat to create a more realistic synthetic graph (e.g. power-law distributed vertex-cardinality).
> ---------------------------------------------------------------------------------------------------------------------------------
>
> Key: GIRAPH-26
> URL: https://issues.apache.org/jira/browse/GIRAPH-26
> Project: Giraph
> Issue Type: Test
> Components: benchmark
> Affects Versions: 1.0.0
> Reporter: Jake Mannix
> Assignee: Sean Choi
> Priority: Minor
> Fix For: 1.0.0
>
> Attachments: GIRAPH-26-2.patch, GIRAPH-26-3.patch, GIRAPH-26.patch
>
>
> The PageRankBenchmark class, to be a proper benchmark, should run over graphs which look more like data seen in the wild, and web link graphs, social network graphs, and text corpora (represented as a bipartite graph) all have power-law distributions, so benchmarking a synthetic graph which looks more like this would be a nice test which would stress cases of uneven split-distribution and bottlenecks of subclusters of the graph of heavily connected vertices.
--
This message was sent by Atlassian Jira
(v8.3.4#803005)