MapReduce vs. pipelining counting triangles

Autor: Pasarella Sánchez, Ana Edelmira, Vidal Serodio, Maria Esther, Zoltan Torres, Ana Cristina

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

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 memo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::acdf42009ead97e2c35e1ec4e4cf17e3
http://hdl.handle.net/2117/90688