search menu icon-carat-right cmu-wordmark

Graph Algorithms on Future Architectures Poster (SEI 2015 Research Review)

October 2015 Poster
Scott McMillan

Delves into whether primitives and operations can be defined to separate graph analytic application development and complexity of underlying hardware concern

Publisher:

Software Engineering Institute

Abstract

Efficient graph analysis is important and pervasive. However, achieving high levels of performance is exceedingly difcult especially in the era of complex heterogeneous high-performance computing (HHPC) architectures. By defining a set of graph primitives and operations, we are able to separate the concerns between the graph expertise
needed to develop advanced graph analytics and the hardware expertise needed to achieve high levels of performance on the ever-increasing complexity of the
underlying hardware.