Re: What if the resulting graph is larger than the memory?

Sounds like you could make use of HBase to store your results. The vertices could simply be row keys into HBase... On Tue, May 21, 2013 at 2:52 AM, Han JU wrote: > Hi Maja, > > The input graph of my problem is not big, the calculation result is very > big. > In fact what does out-of-core graph

Re: ShortestPathExample on 300,000 node graph - Error: Exceeded limits on number of counters

Bence, I set that value to 100 - I think there is a recommendation to set this very high. Remember to reboot you cluster after making the change. Jon On Wed, Nov 28, 2012 at 6:07 AM, Magyar, Bence (US SSA) < bence.mag...@baesystems.com> wrote: > I have successfully run the shortest path e

Re: Minimum superstep time

le more details about the problem, which you are > trying to solve? > > /s > > > On 27.11.2012 19:07, Jonathan Bishop wrote: > > Hi, > > > > I am involved in a project which requires thousands of supersteps. In > each > > superstep there are about 1 th

Re: Number of messages to all vertices for the current supersetp

Sorry, I take that back. This does not seem to work either. I am guessing the context is not shared among the workers so the aggregation happens local to each worker. On Fri, Nov 16, 2012 at 1:36 PM, Jonathan Bishop wrote: > Hi, > > I found a solution for this which seems to work...h

Re: Heterogeneous Vertex Types

there something in the Giraph > architecture that precludes this? > > Thanks, > Nick > > On Jul 25, 2012, at 7:11 PM, Jonathan Bishop wrote: > > Nick, > > You may want to reconsider your approach as I don't think Giraph will be > happy with this. > > How a

Re: Heterogeneous Vertex Types

Nick, You may want to reconsider your approach as I don't think Giraph will be happy with this. How about using a new vertex value class with BasicVertex which can do both behaviours for you? Same for edge and message classes. This should be enough do what you want. Jon On Wed, Jul 25, 2012 at

Re: Exception when replacing EdgeListVertex VertexValue with my own class

rk and it seems to be the problem here. > > -- > aljoscha > > > On Wed, Jul 25, 2012 at 8:27 AM, Jonathan Bishop wrote: > >> Hi, >> >> I have been investigating the exception below. It happens when I attempt to >> replace the vertex value class, wh

Exception when replacing EdgeListVertex VertexValue with my own class

Hi, I have been investigating the exception below. It happens when I attempt to replace the vertex value class, which had been LongWritable, with a new class I am writing, MyGraphVertexValue. I am using Giraph-0.1. I have declared MyGraphVertex public so I am not sure why this would be happening.

Re: Giraph : newbie questions

Found the answer to my own question and thought I would post it... What I did was modify the HashPartitionerFactor as below. Hope this helps someone else! public class MyPartitionerFactory extends HashPartitionerFactory { class WorkerPartitioner extends HashWorkerPartitioner { @Overr

Re: Giraph : newbie questions

Avery, Is there an example of overriding the partitioner in the giraph 0.1 distribution? Thanks, Jon On Tue, Jul 17, 2012 at 11:00 AM, Avery Ching wrote: > Answers inline. > > > On 7/17/12 1:22 AM, Nicolas DUGUE wrote: > >> Thanks for your answer David ! >> >> Okay, but, is there a way to for

Problem with zookeeper setup

Hi, I am exploring Giraph 0.1 and was able to download, build, and run all the tests - all 58 passed. I can also run the SimpleShortestPathsVertex test using the supplied giraph jar. However, when I copy the java src file into eclipse and build my own jar I get the following error which leads me