Candidate Distribution Algorithm

• Attempt to eliminate synchronization

• Partition candidates: Ci ? Cj ? ?, if i ? j

  • Based on semantics

• All data for Ci is stored locally at Pi

  • require data replication
  • possible after redistribution

Previous slide

Next slide

Back to first slide

View graphic version