Hi, ParMetis is an effective tool for graph partitioning, but when I tested on a large graph I didn't know how much memory resources to allocate and it always cause failure of task.
So I wondered if ParMetis could provide a formula to calculate the memory required for the specified number of vertices and edges so that I can know how many resources to set before executing the task.
Thanks and Looking forward to your reply.
Hi, ParMetis is an effective tool for graph partitioning, but when I tested on a large graph I didn't know how much memory resources to allocate and it always cause failure of task.
So I wondered if ParMetis could provide a formula to calculate the memory required for the specified number of vertices and edges so that I can know how many resources to set before executing the task.
Thanks and Looking forward to your reply.