Carregant...
Carregant...

Vés al contingut (premeu Retorn)

MapReduce vs. pipelining counting triangles

Autor
Edelmira Pasarella; Maria-Esther Vidal; Cristina Zoltan
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
10th Alberto Mendelzon Workshop on Foundations of Data Management
Any de l'edició
2016
Data de presentació
2016-06-10
Llibre d'actes
AMW2016: proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management: Panama City, Panama, May 8-10, 2016
Pàgina inicial
1
Pàgina final
5
Editor
CEUR-WS.org
Projecte finançador
EUROPEAN FEDER funds
Modelos y métodos computacionales para datos masivos estructurados
Repositori
http://hdl.handle.net/2117/90688 Obrir en finestra nova
URL
http://ceur-ws.org/Vol-1644/paper33.pdf Obrir en finestra nova
Resum
In this paper we follow an alternative approach named pipeline, to implement a parallel implementation of the well-known problem of counting triangles in a graph. This problem is especially interesting either when the input graph does not fit in memory or is dynamically generated. To be concrete, we implement a dynamic pipeline of processes and an ad-hoc MapReduce version using the language Go. We explote the ability of Go language to deal with channels and spawned processes. An empirical evalua...
Citació
Edelmira Pasarella, Maria-Esther Vidal, Cristina Zoltan. MapReduce vs. pipelining counting triangles. A: Alberto Mendelzon Workshop on Foundations of Data Management. "AMW2016: proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management: Panama City, Panama, May 8-10, 2016". Panama City: CEUR-WS.org, 2016, p. 1-5.
Paraules clau
Mapreduce, Pipeline Computation, Counting Triangle
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

Arxius