mapping, locality-based mapping, remapping partitioners, partitioners, unstructured grids, algorithm
This paper describes the performance of locality-based mapping and remapping partitioners for unstructured grids. We show that the algorithm produces good mappings at a relatively low cost and can be easily parallelized. Further, the algorithm can provide remapping for incremental problems at a fraction of the total cost.
Ou, Chao Wei; Ranka, Sanjay; and Fox, Geoffrey C., "Fast Mapping And Remapping Algorithms For Irregular And Adaptive Problems" (1993). L.C. Smith College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects. Paper 8.
Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.