(Pregel-like) graph computations consist of a sequence of *iterations*. To perform the graph job, internally, we also do additional global synchronizations. For example, counts and synchronizes the number of total vertices among Workers.
So, the total *supersteps* of BSP program for graph job = *iterations* + additional supersteps. On Thu, Jan 3, 2013 at 6:44 PM, Shuo Wang <ecisp.wangs...@gmail.com> wrote: > Hi, > > What is the difference between the *iterations* and the *supersteps* when > we run pagerank or sssp on HAMA? > > wangshuo -- Best Regards, Edward J. Yoon @eddieyoon
