Fast Iterative Graph Computation with Block Updates

Download Now
Provided by: VLD Digital
Topic: Storage
Format: PDF
Scaling iterative graph processing applications to large graphs is an important problem. Performance is critical, as data scientists need to execute graph programs many times with varying parameters. The need for a high-level, high-performance programming model has inspired much research on graph programming frameworks. In this paper, the authors show that the important class of computationally light graph applications - applications that perform little computation per vertex - has severe scalability problems across multiple cores as these applications hit an early \"Memory wall\" that limits their speedup.
Download Now

Find By Topic