A Localized Algorithm for Optimizing Unstructured Mesh Partitions

@article{Walshaw1995ALA,
  title={A Localized Algorithm for Optimizing Unstructured Mesh Partitions},
  author={Chris Walshaw and Mark Cross and Martin G. Everett},
  journal={IJHPCA},
  year={1995},
  volume={9},
  pages={280-295}
}
A new method is described for optimizing graph partitions that arise in mapping unstructured mesh calculations to parallel computers. The method employs a combination of iterative techniques to evenly balance the workload and minimize the number and volume of interprocessor communications. When combined with a fast direct-partitioning technique (such as the Greedy algorithm) to give an initial partition, the resulting twostage process proves itself to be a powerful and flexible solution to the… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
22 Citations
25 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 22 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 25 references

An efficient heuristic for partitioning graphs

  • B. W. Kernighan, S. Lin
  • Bell Systems Tech. J. 49(Feb):291-308.
  • 1970
Highly Influential
3 Excerpts

A fast and high

  • G. Karypis, V. Kumar
  • 1995

A parallelisable algorithm for partitioning unstructured meshes

  • S. Johnson, M. Everett
  • In
  • 1995

Optimized partitioning of unstructured computational grids

  • R. Keunings
  • Int. J. Num. Meth. Engng. 38:433-450.
  • 1995

Similar Papers

Loading similar papers…