Rapid multipole graph drawing on the GPU

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

As graphics processors become powerful, ubiquitous and easier to program, they have also become more amenable to general purpose high-performance computing, including the computationally expensive task of drawing large graphs. This paper describes a new parallel analysis of the multipole method of graph drawing to support its efficient GPU implementation. We use a variation of the Fast Multipole Method to estimate the long distance repulsive forces in force directed layout. We support these multipole computations efficiently with a k-d tree constructed and traversed on the GPU. The algorithm achieves impressive speedup over previous CPU and GPU methods, drawing graphs with hundreds of thousands of vertices within a few seconds via CUDA on an NVIDIA GeForce 8800 GTX.

Original languageEnglish (US)
Title of host publicationGraph Drawing - 16th International Symposium, GD 2008, Revised Papers
Pages90-101
Number of pages12
DOIs
StatePublished - Aug 20 2009
Externally publishedYes
Event16th International Symposium on Graph Drawing, GD 2008 - Heraklion, Crete, Greece
Duration: Sep 21 2008Sep 24 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5417 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other16th International Symposium on Graph Drawing, GD 2008
CountryGreece
CityHeraklion, Crete
Period9/21/089/24/08

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Godiyal, A., Hoberock, J., Garland, M., & Hart, J. C. (2009). Rapid multipole graph drawing on the GPU. In Graph Drawing - 16th International Symposium, GD 2008, Revised Papers (pp. 90-101). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5417 LNCS). https://doi.org/10.1007/978-3-642-00219-9-10