Re: Some questions about execution workflow of HamaGraph.

2012-09-19 Thread 顾荣
Haha, I got it. It makes sense. This all happens in the loadVertices() function of class GraphJobRunner. It is at the setup stage on each task. The few supersteps of a job are spent on partitioning and assigning vertices among tasks. Thanks for expalining this patiently to me, Thomas and Yuesheng.

Re: Some questions about execution workflow of HamaGraph.

2012-09-19 Thread Thomas Jungblut
To be more detailed, it will be done during runtime in every of the tasks. Each task gets its block from HDFS and then starts partitioning. 2012/9/19 Thomas Jungblut > Like Yuesheng Hu already mentioned in the GraphJobRunner > method loadVertices in the setup stage. > > > 2012/9/19 顾荣 > >> Sorr

Re: Some questions about execution workflow of HamaGraph.

2012-09-19 Thread Thomas Jungblut
Like Yuesheng Hu already mentioned in the GraphJobRunner method loadVertices in the setup stage. 2012/9/19 顾荣 > Sorry, I sent last mail by mistake, it's unfinished in the last mail. > > Hi Thomas, > > I just read this part of code in the *submitJobInternal*() function of > *org.apache.hama.bsp.B

Re: Some questions about execution workflow of HamaGraph.

2012-09-19 Thread 顾荣
Sorry, I sent last mail by mistake, it's unfinished in the last mail. Hi Thomas, I just read this part of code in the *submitJobInternal*() function of *org.apache.hama.bsp.BSPJobClient. *As you mentioned.raw BSPs have the opportunity to partition before the job, *// Create the splits for the job

Re: Some questions about execution workflow of HamaGraph.

2012-09-19 Thread 顾荣
Hi Thomas, I just read this part of code in the *submitJobInternal*() function of *org.apache.hama.bsp.BSPJobClient. *As you mentioned.raw BSPs have the opportunity to partition before the job, *// Create the splits for the job LOG.debug("Creating splits at " + fs.makeQualified(submitSplitFi

Re: Some questions about execution workflow of HamaGraph.

2012-09-19 Thread Thomas Jungblut
Hey, the file is getting split like Hadoop does it, defined by the inputformat. It will be partitioned during runtime, raw BSPs have the opportunity to partition before the job, but this is not soo scalable so we have not done this in graph algorithms. There is no load balancing besides the usual

Re: Some questions about execution workflow of HamaGraph.

2012-09-19 Thread 顾荣
Thanks for your valuable hint, Yuesheng. I am getting on with it:) 2012/9/19 Yuesheng Hu > org.apache.hama.graph.GraphJobRunner is the most important class in should > read, also other classes in org.apache.hama.graph > > > 2012/9/19 顾荣 > > > Hi All,I have some questions about your design in H

Re: Some questions about execution workflow of HamaGraph.

2012-09-19 Thread Yuesheng Hu
org.apache.hama.graph.GraphJobRunner is the most important class in should read, also other classes in org.apache.hama.graph 2012/9/19 顾荣 > Hi All,I have some questions about your design in HamaGraph. Let me take > the PageRank example to illustrate my questions. > > I have 3 Groom Servers eac

Some questions about execution workflow of HamaGraph.

2012-09-19 Thread 顾荣
Hi All,I have some questions about your design in HamaGraph. Let me take the PageRank example to illustrate my questions. I have 3 Groom Servers each with 3 free BSP task nodes in my Hama cluster.The input file is as blow. "stackoverflow.comyahoo.com facebook.comtwitter.comgoogle.com