puzzlef / leiden-communities-openmp-dynamic

Design of OpenMP-based Dynamic Leiden algorithm for community detection.
https://arxiv.org/abs/2405.11658
MIT License
0 stars 0 forks source link

Optimizing load-balacing of the aggregation phase for Dynamic Leiden #2

Closed wolfram77 closed 3 months ago

wolfram77 commented 4 months ago

The observations are as follows.

On temporal graphs:

On large graphs:

It appears that restricting the refinement phase actually ends up increasing the aggregation time for DF Leiden. To my understanding, this is due to poor load balancing in the aggregation phase. Our original assumption for the refinement phase was that the communities to be converted to super-vertices are roughly identical. This is not the case when the refimenement phase is restricted!

wolfram77 commented 3 months ago

use CHUNK_SIZE of 32 for DF Leiden