most citedASYMP: Fault-tolerant Mining of Massive Graphs

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DC2017★ 1 cited

ASYMP: Fault-tolerant Mining of Massive Graphs

Eduardo Fleury, Silvio Lattanzi, Vahab Mirrokni +1

We present ASYMP, a distributed graph processing system developed for the timely analysis of graphs with trillions of edges. ASYMP has several distinguishing features including a r…