Development of a system and a Java API for large-scale graph processing based on Google's Pregel.
The system aids distributed processing of large graphs. It also provides a Java API for developing distributed computing solutions to graph problems. The API abstracts a distributed computational model for graphs proposed in Google's research paper : Pregel: A System for Large-Scale Graph Processing.
Programs that use our API are expressed as a sequence of iterations. Each iteration follows a vertex-centric approach that involves asynchronous computations running locally and independently on every vertex of the graph. At runtime the system composes the output of each computation to scale to huge graphs.
Our initial dev releases will offer API support for implementing solutions to some classical graph problems like PageRank, Dijkstra's Shortest Path whose execution times grow with large input graphs. The system can be deployed on a cluster of machines that communicate through Java RMI.