Graph Processing in Map ReduceIn my previous post about Google's Pregel model, a general pattern of parallel graph processing can be expressed as multiple iterations of processing until a termination condition is reached. Within each iteration, same processing happens at a set of nodes (ie: context nodes). Each context node perform a sequence of steps independently (hence achieving parallelism) Aggregate all incoming messages
