If you're not into getting too deep into BSP itself, you could use the graph package. That requires that you can express your logic by the viewpoint of a single vertex. Maybe you can teach us a bit more about your algorithm.
2012/10/22 Apurv Verma <[email protected]> > Hello Francisco, > Do you mean you want to offer some tips or you are asking for some? For > the latter case you can see my > > http://code.google.com/p/anahad/source/browse/trunk/src/main/java/org/anahata/bsp/WordCount.java > > This is crude and at the moment not scalable but you'll get the crux of it. > > -- > Regards, > Apurv Verma > > > > > > On Mon, Oct 22, 2012 at 7:07 PM, Francisco Sanches > <[email protected]>wrote: > > > Colleagues, > > > > Would you like tips, information on how to turn a hadoop implementation > of > > a program in an implementation of the same program in hama bsp. For I > have > > implemented a program that works centrality in large graphs implemented > in > > hadoop and would like to pass it to hama. > > > > -- > > Francisco Sanches > > >
