12 May 2016 Many-core graph analytics using accelerated sparse linear algebra routines
Author Affiliations +
Abstract
Graph analytics is a key component in identifying emerging trends and threats in many real-world applications. Largescale graph analytics frameworks provide a convenient and highly-scalable platform for developing algorithms to analyze large datasets. Although conceptually scalable, these techniques exhibit poor performance on modern computational hardware. Another model of graph computation has emerged that promises improved performance and scalability by using abstract linear algebra operations as the basis for graph analysis as laid out by the GraphBLAS standard. By using sparse linear algebra as the basis, existing highly efficient algorithms can be adapted to perform computations on the graph. This approach, however, is often less intuitive to graph analytics experts, who are accustomed to vertex-centric APIs such as Giraph, GraphX, and Tinkerpop. We are developing an implementation of the high-level operations supported by these APIs in terms of linear algebra operations. This implementation is be backed by many-core implementations of the fundamental GraphBLAS operations required, and offers the advantages of both the intuitive programming model of a vertex-centric API and the performance of a sparse linear algebra implementation. This technology can reduce the number of nodes required, as well as the run-time for a graph analysis problem, enabling customers to perform more complex analysis with less hardware at lower cost. All of this can be accomplished without the requirement for the customer to make any changes to their analytics code, thanks to the compatibility with existing graph APIs.
© (2016) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Stephen Kozacik, Aaron L. Paolini, Paul Fox, Eric Kelmelis, "Many-core graph analytics using accelerated sparse linear algebra routines", Proc. SPIE 9848, Modeling and Simulation for Defense Systems and Applications XI, 984808 (12 May 2016); doi: 10.1117/12.2228554; https://doi.org/10.1117/12.2228554
PROCEEDINGS
6 PAGES


SHARE
RELATED CONTENT

Benchmarks for target tracking
Proceedings of SPIE (September 16 2011)
Prolog-Based World Models For Mobile Robot Navigation
Proceedings of SPIE (January 01 1987)
Efficient eigenvalue computation on the Maspar
Proceedings of SPIE (November 01 1993)
CULA: hybrid GPU accelerated linear algebra routines
Proceedings of SPIE (April 26 2010)
High-level PC-based laser system modeling
Proceedings of SPIE (May 01 1991)
A Factorized Extended Kalman Filter
Proceedings of SPIE (January 04 1986)

Back to Top