Documentos de conferencia · 2018
Exhaustive community enumeration on a cluster
Solo ficha. El repositorio marca este trabajo como «None»: el PDF no es público, así que aquí no hay texto para leer. Ver la ficha en el repositorio.
Resumen
A parallelization based on MPI and OpenMP of an algorithm that evaluates and counts all the possible communities of a graph is presented. Performance results of the parallelization of the algorithm obtained on a cluster of workstations are reported. Load balancing was used to improve the speedups obtained on the cluster. Two different kinds of load balancing approaches were used: One that involved only MPI and a second one in which MPI and OpenMP were combined. The reason for the load imbalance is described. © 2018 IEEE.