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 memory anymore.
- Jan On Tue, Dec 11, 2012 at 8:33 PM, Gustavo Enrique Salazar Torres < gsala...@ime.usp.br> wrote: > Hi Avery: > > Regarding resources I guess I won't need that much, our graph has 60,000 > nodes only, I believe one c1.xlarge EC2 machine can handle this or scale if > needed. > > Thank you very much. > Gustavo > > On Tue, Dec 11, 2012 at 4:40 PM, Avery Ching <ach...@apache.org> wrote: > >> We are running several Giraph applications in production using our >> version of Hadoop (Corona) at Facebook. The part you have to be careful >> about is ensuring you have enough resources for your job to run. But >> otherwise, we are able to run at FB-scale (i.e. 1billion+ nodes, many more >> edges). >> >> Avery >> >> >> On 12/11/12 5:58 AM, Gustavo Enrique Salazar Torres wrote: >> >>> Hi: >>> >>> I implemented a graph algorithm to recommend content to our users. >>> Although it is working (implementation uses Mahout) it very inefficient >>> because I have to run many iterations in order to perform a breadth-first >>> search on my graph. >>> I would like to use Giraph for that task. I would like to know if it is >>> production ready. I'm running jobs on Amazon EMR. >>> >>> Thanks in advance. >>> Gustavo >>> >> >> > > > >
