# Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory

Manuela Fischer

SIROCCO, pp. 124-138, 2019.

Cited by: 0|Bibtex|Views13
EI

Abstract:

Recently, studying fundamental graph problems in the \emph{Massively Parallel Computation (MPC) framework, inspired by the MapReduce paradigm, has gained a lot of attention. An assumption common to a vast majority of approaches is to allow $\widetilde{\Omega}(n)$ memory per machine, where $n$ is the number of nodes in the graph and \$\wi...More

Code:

Data:

Full Text