2019 · 42 citations · 24 references
ComputingComputer EngineeringComputer ScienceAlgorithmsParallel AlgorithmsParallel ComputingData ParallelismGraph AlgorithmsParallel Computing SystemsGraph MatchingIndependent Set AlgorithmsMatching AlgorithmsMatching ProblemsMaximum Independent Set ApproximationMaximum Matching ApproximationParallel Graph AlgorithmsParallel Matching Algorithms
The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale parallel computation frameworks and has recently gained a lot of importance, especially in the context of classic graph problems. In this work, we mainly consider maximal matching and maximal independent set problems in the MPC model.
24
Sanjay Ghemawat · Communications of the ACM · 2008 · 18.5K citations · Full text
Spark: cluster computing with working sets
Matei Zaharia, Mosharaf Chowdhury, Michael J. Franklin et al. · 2010 · 4.2K citations
Michael Isard, Mihai Budiu, Yuan Yu et al. · 2007 · 2.5K citations
Locality in Distributed Graph Algorithms
Nathan Linial · SIAM Journal on Computing · 1992 · 885 citations