Improve PseudoRandomVertexInputFormat to create a more realistic synthetic 
graph (e.g. power-law distributed vertex-cardinality).

                 Key: GIRAPH-26
             Project: Giraph
          Issue Type: Test
          Components: benchmark
            Reporter: Jake Mannix
            Priority: Minor

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 is automatically generated by JIRA.
For more information on JIRA, see:


Reply via email to