Dryad
From MaRDI portal
Software:20912
swMATH8916MaRDI QIDQ20912FDOQ20912
Author name not available (Why is that?)
Cited In (13)
- An efficient algorithm to construct disjoint path covers of DCell networks
- A hardware independent parallel programming model
- Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC
- Equivalence classes and conditional hardness in massively parallel computations
- The extra connectivity, extra conditional diagnosability and \(t/k\)-diagnosability of the data center network DCell
- GEODIS: towards the optimization of data locality-aware job scheduling in geo-distributed data centers
- The vertex-pancyclicity of data center networks
- The role of randomness in the broadcast congested clique model
- Scheduling MapReduce jobs on identical and unrelated processors
- Graph reconstruction in the congested clique
- Round Compression for Parallel Matching Algorithms
- Forest resampling for distributed sequential Monte Carlo
- A programming model and foundation for lineage-based distributed computation
This page was built for software: Dryad
