1 resultado para computer algorithm
em AMS Tesi di Laurea - Alm@DL - Università di Bologna
Filtro por publicador
- Repository Napier (3)
- Aberdeen University (2)
- Abertay Research Collections - Abertay University’s repository (1)
- Aberystwyth University Repository - Reino Unido (2)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (2)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (2)
- Aston University Research Archive (8)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (5)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (11)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (14)
- Boston University Digital Common (6)
- Brock University, Canada (5)
- Bucknell University Digital Commons - Pensilvania - USA (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (5)
- CaltechTHESIS (1)
- Cambridge University Engineering Department Publications Database (9)
- CentAUR: Central Archive University of Reading - UK (27)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (18)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- CUNY Academic Works (3)
- Dalarna University College Electronic Archive (2)
- Department of Computer Science E-Repository - King's College London, Strand, London (5)
- Digital Commons - Michigan Tech (1)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (15)
- DigitalCommons - The University of Maine Research (1)
- DigitalCommons@The Texas Medical Center (1)
- DigitalCommons@University of Nebraska - Lincoln (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (3)
- Greenwich Academic Literature Archive - UK (13)
- Helda - Digital Repository of University of Helsinki (7)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (75)
- Martin Luther Universitat Halle Wittenberg, Germany (1)
- Massachusetts Institute of Technology (2)
- Nottingham eTheses (5)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (20)
- Queensland University of Technology - ePrints Archive (567)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (18)
- Repositorio Institucional Universidad de Medellín (1)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- Universidad de Alicante (8)
- Universidad Politécnica de Madrid (7)
- Universidade Complutense de Madrid (1)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universitat de Girona, Spain (4)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (1)
- University of Canberra Research Repository - Australia (1)
- University of Connecticut - USA (1)
- University of Michigan (28)
- University of Queensland eSpace - Australia (18)
- University of Washington (1)
- WestminsterResearch - UK (1)
Resumo:
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.