Performance modeling for hierarchical graph partitioning inn heterogeneous multi-core environment

摘要

Considering application behavior in graph partitioning is an arduous task because of the Chicken-and-egg problem: the application behavior depends on how the graph is decomposed while achieving load balance requires the knowledge of how the application utilizes the underlying resources. Advances in multi-core processors further complicate the endeavor by introducing hardware diversity and intra-node contention. As an attempt to quantify performance for partitioning refinement, we propose a model