In superstep 1 you should definitely store the edges in a collection that
allows fast lookups (like a HashSet) and use that to your neighborhood
checks. Otherwise you will lose a huge amount of performance on high-degree
vertices.
On Wed, Mar 19, 2014 at 7:21 AM, Suijian Zhou
Hi Alex,
Probably your best bet is to use IPoIB, as far as I know there are no
bindings to IB verbs for Java...
- Jan
On Tue, Feb 4, 2014 at 3:43 AM, Alexander Frolov
alexndr.fro...@gmail.comwrote:
Hello,
I am using cluster with Infiniband FDR. I want to deploy Giraph on Apache
Hadoop
HI Artie,
CDH 4.4 is based on Hadoop 2.0.0, so you should probably use that build
profile (
http://www.cloudera.com/content/cloudera-content/cloudera-docs/CDH4/latest/CDH-Version-and-Packaging-Information/cdhvd_topic_3.html?scroll=topic_3_1_unique_7
).
- Jan
On Thu, Sep 19, 2013 at 6:33 PM,
. Is there a way
i can disable this check..? i remember someone posting this earlier..!! but
not sure how..;-(
@Jan, yes, actually even i want to see results,..:-)
PS thanks for all help..
On Thu, Feb 7, 2013 at 9:47 PM, Jan van der Lugt janl...@gmail.comwrote:
I never actually ran bc_random, so
It should work with version 0.2, but let me check. Since the API is
changing all the time at the moment, it's very different to track all those
changes. Probably they are numerous instances of the same error.
On Wed, Feb 6, 2013 at 9:26 AM, pradeep kumar pradeep0...@gmail.com wrote:
Hi Lugt,
.
- Jan
On Wed, Feb 6, 2013 at 9:48 AM, Jan van der Lugt janl...@gmail.com wrote:
It should work with version 0.2, but let me check. Since the API is
changing all the time at the moment, it's very different to track all those
changes. Probably they are numerous instances of the same error
Green-Marl comes with an implementation of betweenness centrality and
allows you to compile it to Giraph code:
https://github.com/stanford-ppl/Green-Marl
The BC algorithm:
https://github.com/stanford-ppl/Green-Marl/blob/master/apps/src/bc_random.gm
On Tue, Feb 5, 2013 at 8:07 PM, Sebastian
Hi Gustavo,
If your graph fits in memory, you might be interested Green-Marl, a
language tailored for graph processing:
https://github.com/stanford-ppl/Green-Marl
You can compile your Green-Marl program to an extremely fast C++ program,
but also to Giraph program when your graph does not fit in
Hi everyone,
Some of you might already know Green-Marl, Green-Marl compatibility was
even mentioned as a new feature for Giraph 0.2, but for those who don't,
let me give you a quick introduction.
Green-Marl is a domain-specific language tailored to graph algorithms. It
has many features that
