Cited in
(34)- Graph reconstruction in the congested clique
- Equivalence classes and conditional hardness in massively parallel computations
- Forest resampling for distributed sequential Monte Carlo
- Scheduling MapReduce jobs on identical and unrelated processors
- The role of randomness in the broadcast congested clique model
- A programming model and foundation for lineage-based distributed computation
- Round compression for parallel matching algorithms
- An efficient algorithm to construct disjoint path covers of DCell networks
- The vertex-pancyclicity of data center networks
- The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
- MapReduce
- G-Hadoop
- Hadoop
- Pegasus
- ScalaBLAST
- BlobSeer
- Pregel
- ELF
- GraphLog
- Java CoG Kit
- DryadLINQ
- Spark
- Bigtable
- BigDatalog
- DeepMind Lab
- Akka
- LaCasa
- Scalding
- Scoobi
- Open Science Grid
- A hardware independent parallel programming model
- GEODIS: towards the optimization of data locality-aware job scheduling in geo-distributed data centers
- Graphalytics
- Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC
This page was built for software: Dryad
