Communication weight given separately from (computational) weight
Hyperedges determined based on selected user neighborhood, with using the communication weight of the cell as the edge weight and every cell considering that cell as its neighbor as vertices
Automagical hierarchical partition, partitioning nodes via hypergraph and processes via RIB
Hypergraph and hierarchical partitioning depend on fixes to Zoltan crashes in https://github.com/sandialabs/Zoltan/pull/6. The hypergraph crash can be circumvented by setting NUM_LID_ENTRIES to 1. Hierarchical partition doesn't crash on the master branch on all setups.
Better Zoltan Hypergraph support.
Hypergraph and hierarchical partitioning depend on fixes to Zoltan crashes in https://github.com/sandialabs/Zoltan/pull/6. The hypergraph crash can be circumvented by setting
NUM_LID_ENTRIESto 1. Hierarchical partition doesn't crash on the master branch on all setups.