Scalable force directed graph layout algorithms using fast multipole methods

Handle URI:
http://hdl.handle.net/10754/564557
Title:
Scalable force directed graph layout algorithms using fast multipole methods
Authors:
Yunis, Enas Abdulrahman; Yokota, Rio ( 0000-0001-7573-7873 ) ; Ahmadia, Aron
Abstract:
We present an extension to ExaFMM, a Fast Multipole Method library, as a generalized approach for fast and scalable execution of the Force-Directed Graph Layout algorithm. The Force-Directed Graph Layout algorithm is a physics-based approach to graph layout that treats the vertices V as repelling charged particles with the edges E connecting them acting as springs. Traditionally, the amount of work required in applying the Force-Directed Graph Layout algorithm is O(|V|2 + |E|) using direct calculations and O(|V| log |V| + |E|) using truncation, filtering, and/or multi-level techniques. Correct application of the Fast Multipole Method allows us to maintain a lower complexity of O(|V| + |E|) while regaining most of the precision lost in other techniques. Solving layout problems for truly large graphs with millions of vertices still requires a scalable algorithm and implementation. We have been able to leverage the scalability and architectural adaptability of the ExaFMM library to create a Force-Directed Graph Layout implementation that runs efficiently on distributed multicore and multi-GPU architectures. © 2012 IEEE.
KAUST Department:
Extreme Computing Research Center; Core Labs
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
2012 11th International Symposium on Parallel and Distributed Computing
Conference/Event name:
2012 11th International Symposium on Parallel and Distributed Computing, ISPDC 2012
Issue Date:
Jun-2012
DOI:
10.1109/ISPDC.2012.32
Type:
Conference Paper
ISBN:
9780769548050
Appears in Collections:
Conference Papers; Extreme Computing Research Center

Full metadata record

DC FieldValue Language
dc.contributor.authorYunis, Enas Abdulrahmanen
dc.contributor.authorYokota, Rioen
dc.contributor.authorAhmadia, Aronen
dc.date.accessioned2015-08-04T07:03:55Zen
dc.date.available2015-08-04T07:03:55Zen
dc.date.issued2012-06en
dc.identifier.isbn9780769548050en
dc.identifier.doi10.1109/ISPDC.2012.32en
dc.identifier.urihttp://hdl.handle.net/10754/564557en
dc.description.abstractWe present an extension to ExaFMM, a Fast Multipole Method library, as a generalized approach for fast and scalable execution of the Force-Directed Graph Layout algorithm. The Force-Directed Graph Layout algorithm is a physics-based approach to graph layout that treats the vertices V as repelling charged particles with the edges E connecting them acting as springs. Traditionally, the amount of work required in applying the Force-Directed Graph Layout algorithm is O(|V|2 + |E|) using direct calculations and O(|V| log |V| + |E|) using truncation, filtering, and/or multi-level techniques. Correct application of the Fast Multipole Method allows us to maintain a lower complexity of O(|V| + |E|) while regaining most of the precision lost in other techniques. Solving layout problems for truly large graphs with millions of vertices still requires a scalable algorithm and implementation. We have been able to leverage the scalability and architectural adaptability of the ExaFMM library to create a Force-Directed Graph Layout implementation that runs efficiently on distributed multicore and multi-GPU architectures. © 2012 IEEE.en
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.subjectFast multipole methodsen
dc.subjectForce directed graph layouten
dc.subjectMulti-GPUsen
dc.titleScalable force directed graph layout algorithms using fast multipole methodsen
dc.typeConference Paperen
dc.contributor.departmentExtreme Computing Research Centeren
dc.contributor.departmentCore Labsen
dc.identifier.journal2012 11th International Symposium on Parallel and Distributed Computingen
dc.conference.date25 June 2012 through 29 June 2012en
dc.conference.name2012 11th International Symposium on Parallel and Distributed Computing, ISPDC 2012en
dc.conference.locationMunich/Garching, Bavariaen
kaust.authorYokota, Rioen
kaust.authorAhmadia, Aronen
kaust.authorYunis, Enas Abdulrahmanen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.