Publication | Open Access
Shuffles and Circuits
35
Citations
31
References
2016
Year
Unknown Venue
Circuit ComplexityCluster ComputingEngineeringNetwork AnalysisEducationMap-reduceDistributed Data AnalyticsCentral ProblemsDiscrete MathematicsParallel ComputingCombinatorial OptimizationComputer EngineeringGraph Connectivity ProblemsProbability TheoryComputer ScienceGraph AlgorithmScalable ComputingNetwork ScienceGraph TheoryCircuit DesignCloud ComputingFundamental LimitationsParallel ProgrammingRandomized AlgorithmMassive Data ProcessingBig Data
The goal of this paper is to identify fundamental limitations on how efficiently algorithms implemented on platforms such as MapReduce and Hadoop can compute the central problems in the motivating application domains, such as graph connectivity problems.
| Year | Citations | |
|---|---|---|
Page 1
Page 1