Scalable high-quality 1D partitioning

@article{Lieber2014ScalableH1,
  title={Scalable high-quality 1D partitioning},
  author={Matthias Lieber and Wolfgang E. Nagel},
  journal={2014 International Conference on High Performance Computing & Simulation (HPCS)},
  year={2014},
  pages={112-119}
}
The decomposition of one-dimensional workload arrays into consecutive partitions is a core problem of many load balancing methods, especially those based on space-filling curves. While previous work has shown that heuristics can be parallelized, only sequential algorithms exist for the optimal solution. However, centralized partitioning will become infeasible in the exascale era due to the vast amount of tasks to be mapped to millions of processors. In this work, we first introduce… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

Similar Papers

Loading similar papers…