Cyclops [10] is a synchronous graph processing model that presents a distributed immutable view of the graph. While it provides local se-mantics to the programmer, it retains the synchronous nature of the BSP model. Compared to the systems mentioned so far, all fun-damentally synchronous, our framework allows better efficiency in the use of the resources, by allowing overlap of communication and computation, and exploits all the available parallelism by the use of active messages.