Computational Science Technical Note CSTN-126


Graph Generation on GPUs using Dynamic Memory Allocation

A. Leist and K. A. Hawick

Archived January 2011


Complex networks are often studied using statistical measurements over many independently generated samples. Irregular data structures such as graphs that involve dynamical memory management and "pointer chasing" are an important class of application and have attracted recent interest in the form of the Graph500 benchmark formulation. The generation of simulated sample network graphs and measurement of their properties can be accelerated using Graphical Processing Units (GPUs) and we discuss some algorithmic approaches using Compute Unified Device Architecture (CUDA). We particularly discuss recent support for dynamic memory allocation within CUDA GPU code and present some performance data for Watts' $\alpha$ small-world network model.

Keywords: graphs; networks; small-world; CUDA; GPUs

Full Document Text: PDF version.

Citation Information: BiBTeX database for CSTN Notes.

BiBTeX reference:

  author = {A. Leist and K. A. Hawick},
  title = {Graph Generation on GPUs using Dynamic Memory Allocation},
  booktitle = {Proc. International Conference on Parallel and Distributed Processing
	Techniques and Applications (PDPTA'11)},
  year = {2011},
  number = {PDP3939},
  pages = {229-235},
  address = {Las Vegas, USA},
  month = {18-21 July},
  publisher = {CSREA},
  timestamp = {2011.05.16}

[ CSTN Index | CSTN BiBTeX ]