Use the SSSP benchmark: http://wiki.apache.org/hama/Benchmarks#Single_Shortest_Path_Problem
Not much more work than plain BFS. Maybe you find a MapReduce benchmark on the internet for SSSP. Am 25. März 2012 05:08 schrieb Edward J. Yoon <[email protected]>: > Didn't yet. > > But BSP based BFS will faster than MR. :) > > 나의 iPhone에서 보냄 > > 2012. 3. 25. 오전 9:03 Apurv Verma <[email protected]> 작성: > > > Hi, > > Are there some benchmarks comparing mapreduce with hama. Is a breadth > > first search in hama faster than in map-reduce or it is as fast in both? > I > > need to present some comparisons to the nutch community. > > > > -- > > thanks and regards, > > > > Apurv Verma > > B. Tech.(CSE) > > IIT- Ropar > -- Thomas Jungblut Berlin <[email protected]>
