> > We are also thinking about other underlying computing models (i.e. > streaming (asynchronous) graph processing - see
That is a really cool idea. But I don't think we are going to focus solely on graph computing. We want to enable an interface which can be used for it (straight forward as described in the Pregel Paper), but I think you are really graph experts- so we don't want to compete with each other :D Our asynchronous processing (in my opinion) will just enable the sending of messages within the computation phase. So the BarrierSync is just a little transition to make sure every task is ready and every message has been send. Your Vertex locking is a graph-only feature, this won't be effecting us anyways. Giraph runs completely as a MapReduce job on Hadoop today. > Allright. I think our result is the following: We (Apache Hama) are focussing on the YARN implementation of the BSP paradigm. If you want to run Giraph on a real BSP engine later, feel free to put your stuff on top of that. As far as I have seen, there is a 100% backward compatibility of YARN, so your current solution will run on YARN either. Best Regards, Thomas
