A parallel community detection algorithm

Severini, Lorenzo (2013) A parallel community detection algorithm. [Laurea magistrale], Università di Bologna, Corso di Studio in Informatica [LM-DM270], Documento ad accesso riservato.
Documenti full-text disponibili:
[img] Documento PDF
Full-text accessibile solo agli utenti istituzionali dell'Ateneo

Download (2MB) | Contatta l'autore


Complex networks analysis is a very popular topic in computer science. Unfortunately this networks, extracted from different contexts, are usually very large and the analysis may be very complicated: computation of metrics on these structures could be very complex. Among all metrics we analyse the extraction of subnetworks called communities: they are groups of nodes that probably play the same role within the whole structure. Communities extraction is an interesting operation in many different fields (biology, economics,...). In this work we present a parallel community detection algorithm that can operate on networks with huge number of nodes and edges. After an introduction to graph theory and high performance computing, we will explain our design strategies and our implementation. Then, we will show some performance evaluation made on a distributed memory architectures i.e. the supercomputer IBM-BlueGene/Q "Fermi" at the CINECA supercomputing center, Italy, and we will comment our results.

Tipologia del documento
Tesi di laurea (Laurea magistrale)
Autore della tesi
Severini, Lorenzo
Relatore della tesi
Corso di studio
Ordinamento Cds
Parole chiave
parallel computing community detection algorithm Blue Gene/Q
Data di discussione della Tesi
13 Novembre 2013

Altri metadati

Statistica sui download

Gestione del documento: Visualizza il documento