Scalable force directed graph layout algorithms using fast multipole methods
Type
Conference PaperKAUST Department
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) DivisionKAUST Supercomputing Laboratory (KSL)
Computer Science Program
Extreme Computing Research Center
Core Labs
Date
2012-06Permanent link to this record
http://hdl.handle.net/10754/564557
Metadata
Show full item recordAbstract
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.Citation
Yunis, E., Yokota, R., & Ahmadia, A. (2012). Scalable Force Directed Graph Layout Algorithms Using Fast Multipole Methods. 2012 11th International Symposium on Parallel and Distributed Computing. doi:10.1109/ispdc.2012.32Conference/Event name
2012 11th International Symposium on Parallel and Distributed Computing, ISPDC 2012ISBN
9780769548050ae974a485f413a2113503eed53cd6c53
10.1109/ISPDC.2012.32