Software and Algorithms for Graph Queries on Multithreaded Architectures

Search-based graph queries, such as finding short paths and isomorphic subgraphs, are dominated by memory latency. If input graphs can be partitioned appropriately, large cluster-based computing platforms can run these queries. However, the lack of compute-bound processing at each vertex of the input graph and the constant need to retrieve neighbors implies low processor utilization. Furthermore, graph classes such as scale-free social networks lack the locality to make partitioning clearly effective. Massive multithreading is an alternative architectural paradigm, in which a large shared memory is combined with processors that have extra hardware to support many thread contexts. The processor speed is typically slower than normal, and there is no data cache. Rather than mitigating memory latency, multithreaded machines tolerate it. This paradigm is well aligned with the problem of graph search, as the high ratio of memory requests to computation can be tolerated via multithreading....

• Type: Conference
• Year: 2007
• Where: IPPS
• Authors: Jonathan W. Berry, Bruce Hendrickson, Simon Kahan, Petr Konecny
• Keywords: Distributed And Parallel Computing, IPPS 2007, Memory Latency, Sandia National Laboratories, Search-based Graph Queries