Many-core graph analytics using accelerated sparse linear algebra routines

Stephen Kozacik; Aaron L. Paolini; Paul Fox; Eric Kelmelis

doi:10.1117/12.2228554

12 May 2016 Many-core graph analytics using accelerated sparse linear algebra routines

Stephen Kozacik, Aaron L. Paolini, Paul Fox, Eric Kelmelis

Proceedings Volume 9848, Modeling and Simulation for Defense Systems and Applications XI; 984808 (2016) https://doi.org/10.1117/12.2228554
Event: SPIE Defense + Security, 2016, Baltimore, MD, United States

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.

Citation Download Citation

Stephen Kozacik, Aaron L. Paolini, Paul Fox, and 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); https://doi.org/10.1117/12.2228554

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available