> > 2. (New feature) hama-mapreduce
I don't want to disgard Suraj's work on this, but don't you think this is not more than an example? If people run HDFS, why should they use the Hama MapReduce if they could just start up tasktrackers and run a full mapreduce. I think if we can split out the sort and merging and make it as robust as in MapReduce it can be a useful feature. Don't take it personally, it is just my opinion. Do you think Mikalai is finished with the random graph gen and the SpMV for the next release? Otherwise I want to contribute my kmeans (giraph is going to put some example up there as well from a stanford student), there is a top k-SSSP algorithm in work (not by me) and some other very secret thing ;) At least I wanted to add (with suraj of course!) the remote memory access and the local storage of objects in the new Superstep API. 2012/5/4 Praveen Sripati <[email protected]> > Not sure what additional algorithms to be implemented. But, any which > show significance improvements over MR/Hadoop would be useful in the > adoption of BSP/Hama. > > Praveen > > On Fri, May 4, 2012 at 2:44 PM, Suraj Menon <[email protected]> wrote: > > We can rope in fault tolerance in offline mode. Testing the feature would > > be more tedious. I hope we have 2 months for the next release? > > > > On Fri, May 4, 2012 at 3:16 AM, Edward J. Yoon <[email protected] > >wrote: > > > >> Hi, > >> > >> I think it's time to discuss roadmap of our next release. > >> > >> 1. Improve web UI > >> 2. (New feature) hama-mapreduce > >> 3. Improve real-time usage (and documentation) > >> 4. Improve RPC messenger > >> > >> and ? > >> > >> -- > >> Best Regards, Edward J. Yoon > >> @eddieyoon > >> > -- Thomas Jungblut Berlin <[email protected]>
