In recent years, the Massively Parallel Computation (MPC) model has gained significant attention. However, most distributed and parallel graph algorithms in the MPC model are designed for static ...

This describes making your nodes more powerful by using an FPGA co-processor, dodging the punishment of Amdahl's law (i.e. parallel overhead). It is intrinsically easier to partition between 10 ...

The team designed a fully dynamic APSP algorithm in the MPC model with low round complexity that is faster than all the existing static parallel APSP algorithms.