Mailing-List: contact dev-help@giraph.apache.org; run by ezmlm
Precedence: bulk
Reply-To: dev@giraph.apache.org
Date: Tue, 21 Aug 2012 10:55:38 +1100 (NCT)
From: "Jakob Homan (JIRA)" <jira@apache.org>
To: giraph-dev@incubator.apache.org
Message-ID: <163852612.32747.1345506938173.JavaMail.jiratomcat@arcas>
In-Reply-To: 
 <907631067.23408.1315369869965.JavaMail.tomcat@hel.zones.apache.org>
Subject: [jira] [Commented] (GIRAPH-26) Improve
 PseudoRandomVertexInputFormat to create a more realistic synthetic graph
 (e.g. power-law distributed vertex-cardinality).
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8
Content-Transfer-Encoding: 7bit


    [ https://issues.apache.org/jira/browse/GIRAPH-26?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13438327#comment-13438327 ] 

Jakob Homan commented on GIRAPH-26:
-----------------------------------

The colt library is explicitly ok to include (for some reason), despite its nonstandard license: http://www.apache.org/legal/resolved.html#category-a
                
> 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: 0.2.0
>            Reporter: Jake Mannix
>            Assignee: Sean Choi
>            Priority: Minor
>             Fix For: 0.2.0
>
>         Attachments: 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 is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators: https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira