Scientific distributed graph computing made easy
Home › Description

BigGrph is a distributed graph library. It supports shared-nothing clusters and comes with facilities for Torque and OAR clusters. BigGrph aims at helping the Research in distributed graph algorithmics. For this reason it proposes several programming paradigms: in addition to BSP and Map/Reduce, BigGrph supports asynchronous message passing, centralised, systolic, and mobile-agent based programming models.

BigGrph can be used from within the researcher's IDE. To allow this, it features automatic deployment of executable code, transparent retrieving of remote standard outputs/exceptions, and remote debugging.

The use of various optimization techniques (adequate data structures, parallelism, compact data encoding, etc) results in excellent overall performance. BigGrph loads and computes data faster than Giraph and GraphX, and it requires less memory to proceed. More information there.