Rapid multipole graph drawing on the GPU

Apeksha Godiyal, Jared Hoberock, Michael Garland, John C. Hart

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

Graph Drawing
Graphics Processors
Fast multipole Method
Layout
Speedup
High Performance
Program processors
Computing
Graph in graph theory
Estimate
Graphics processing unit
Drawing

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

Rapid multipole graph drawing on the GPU. / Godiyal, Apeksha; Hoberock, Jared; Garland, Michael; Hart, John C.

Graph Drawing - 16th International Symposium, GD 2008, Revised Papers. 2009. p. 90-101 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5417 LNCS).

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

Godiyal, A, Hoberock, J, Garland, M & Hart, JC 2009, Rapid multipole graph drawing on the GPU. in Graph Drawing - 16th International Symposium, GD 2008, Revised Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5417 LNCS, pp. 90-101, 16th International Symposium on Graph Drawing, GD 2008, Heraklion, Crete, Greece, 9/21/08. https://doi.org/10.1007/978-3-642-00219-9-10
Godiyal A, Hoberock J, Garland M, Hart JC. Rapid multipole graph drawing on the GPU. In Graph Drawing - 16th International Symposium, GD 2008, Revised Papers. 2009. p. 90-101. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-00219-9-10
Godiyal, Apeksha ; Hoberock, Jared ; Garland, Michael ; Hart, John C. / Rapid multipole graph drawing on the GPU. Graph Drawing - 16th International Symposium, GD 2008, Revised Papers. 2009. pp. 90-101 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9254a52fad7c4bc0903be07aa1995bec,
title = "Rapid multipole graph drawing on the GPU",
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.",
author = "Apeksha Godiyal and Jared Hoberock and Michael Garland and Hart, {John C.}",
year = "2009",
month = "8",
day = "20",
doi = "10.1007/978-3-642-00219-9-10",
language = "English (US)",
isbn = "3642002188",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "90--101",
booktitle = "Graph Drawing - 16th International Symposium, GD 2008, Revised Papers",

}

TY - GEN

T1 - Rapid multipole graph drawing on the GPU

AU - Godiyal, Apeksha

AU - Hoberock, Jared

AU - Garland, Michael

AU - Hart, John C.

PY - 2009/8/20

Y1 - 2009/8/20

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=68749114440&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=68749114440&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-00219-9-10

DO - 10.1007/978-3-642-00219-9-10

M3 - Conference contribution

AN - SCOPUS:68749114440

SN - 3642002188

SN - 9783642002182

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 90

EP - 101

BT - Graph Drawing - 16th International Symposium, GD 2008, Revised Papers

ER -