> So, the bsp() method is called once per whole job ? > I thought that one superstep = one bsp() call.
Oh, .... yes, right. I'm going to fix some document and code error. I was designed the bsp() function, which user can whole BSP program ideally - https://issues.apache.org/jira/browse/HAMA-257 - but, I confused with Map function of MapReduce or Google Pregel, too. :/ On Tue, Feb 15, 2011 at 4:39 PM, Paweł Brach <[email protected]> wrote: > So, the bsp() method is called once per whole job ? > I thought that one superstep = one bsp() call. > I'm trying to find an example when the bsp() method is called more than once > on each node. > > Thanks. > > 2011/2/15 Edward J. Yoon <[email protected]> > >> You can understand it as a barrier count. After all peers have entered >> the barrier using sync() method, the system proceeds to the next >> superstep. >> >> And, even if queues are empty, the bsp job won't stop until each >> processes terminated. In SerializePrinting example case, the program >> will be finished after the for loop is done and the count of >> supersteps is same with a number of peers. >> >> Thanks. >> >> > -- Best Regards, Edward J. Yoon http://blog.udanax.org http://twitter.com/eddieyoon
