Graph Connected Component Analysis with Bulk-Synchronous-Parallel Processing

In an undirected graph, a connected component is a subgraph in which any two vertices are connected to each other by paths. Usual algorithms build a graph where each vertex is labeled with its component number. They use a search from an unclassified vertex to build the connected component containing…

Continue reading

The Bulk Synchronous Parallel model for graph processing

The BSP Model The Bulk Synchronous Parallel (BSP) is a model for designing parallel algorithms. The BSP model was developed by Leslie Valiant of Harvard University during the 1980s and published in 1990. Computation proceeds as a sequence of iterations, called supersteps. Each superstep involves a phase of parallel computations,…

Continue reading

dtk – introduction

What is dtk? When we carry out software development in Inria research teams, recurring questions arise: “We have lots of software librairies and applications, that are all equally important but we cannot maintain them. Besides, we do not know where to add new features.” “We need a modular architecture, but…

Continue reading

ADT WebRobotics

1. Résumé de l’ADT (tiré de la demande d’ADT ADT_Submission3 WebRobotics) Les EPI Indes et Coprin sont associées dans l’introduction de la plate-forme d’exécution Hop comme socle de configuration et de commande des robots de Coprin, en particulier des robots d’assistance à la personne. Le projet répond à plusieurs attentes…

Continue reading

ADT BigGraphs: calculs sur de très grands graphes

Pour mener des expérimentations sur de très grands graphes (plusieurs centaines de millions d’éléments), les chercheurs doivent se tourner vers des infrastructures distribuées. Les middlewares existants de calculs distribués sur les graphes affichent certaines limites quand à leurs modèles et leurs performances. À partir de l’étude de ces middlewares, l’ADT…

Continue reading