Yes, the GIM-V of Pegasus can be used to implement Belman Ford. But I do not see how selective activation can happen in that approach. I see nothing like selective activation in GIM-V.
Regards, Mike From: Sebastian Schelter <[email protected]> To: [email protected] Date: 04/20/2012 01:55 PM Subject: Re: shortest-path maintenance Maybe a look at Pegasus [1] could be helpful. This framework uses a so called "Generalized Iterative Matrix Vector Multiplication" to implement a variety of graph algorithms on MapReduce. They did not include shortest distance computation, but the Belman Ford algorithm is also be implementable with their model. Best, Sebastian [1] http://www.cs.cmu.edu/~pegasus/
