Authors
Robert Ryan McCune, Tim Weninger, Greg Madey
Publication date
2015
Journal
ACM Computing Surveys
Volume
48
Issue
2
Pages
25
Publisher
ACM
Description
The vertex-centric programming model is an established computational paradigm recently incorporated into distributed processing frameworks to address challenges in large-scale graph processing. Billion-node graphs that exceed the memory capacity of commodity machines are not well supported by popular Big Data tools like MapReduce, which are notoriously poor performing for iterative graph algorithms such as PageRank. In response, a new type of framework challenges one to “think like a vertex” (TLAV) and implements user-defined programs from the perspective of a vertex rather than a graph. Such an approach improves locality, demonstrates linear scalability, and provides a natural way to express and compute many iterative graph algorithms. These frameworks are simple to program and widely applicable but, like an operating system, are composed of several intricate, interdependent components, of …
Total citations
20152016201720182019202020212022202320242025133145555348514039354