articleFeb 23, 2013Closed access

Ligra

Carnegie Mellon University

Indexed incrossref

Abstract

There has been significant recent interest in parallel frameworks for processing graphs due to their applicability in studying social networks, the Web graph, networks in biology, and unstructured meshes in scientific simulation. Due to the desire to process large graphs, these systems have emphasized the ability to run on distributed memory machines. Today, however, a single multicore server can support more than a terabyte of memory, which can fit graphs with tens or even hundreds of billions of edges. Furthermore, for graph algorithms, shared-memory multicores are generally significantly more efficient on a per core, per dollar, and per joule basis than distributed memory systems, and shared-memory…

Citation impact

808
total citations
FWCI
41.42
Percentile
100%
References
299
Citations per year

Authors

2

Topics & keywords

Keywords
  • Computer science
  • Terabyte
  • Parallel computing
  • Out-of-core algorithm
  • Distributed memory
  • Theoretical computer science
  • Distributed computing
  • Graph
No related works found for this paper.

Funding