Brief announcement: subgraph isomorphism on a multithreaded shared memory architecture

  • Authors:

  • Claire C. Ralph;Vitus J. Leung;William McLendon, III

  • Affiliations:

  • Cornell University, Ithaca, NY, USA;Sandia National Laboratory, Albuquerque, NM, USA;Sandia National Laboratory, Albuquerque, NM, USA

  • Venue:
  • Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Graph algorithms tend to suffer poor performance due to the irregularity of access patterns within general graph data structures, arising from poor data locality, which translates to high memory latency. The result is that advances in high-performance solutions for graph algorithms are most likely to come through advances in both architectures and algorithms. Specialized MMT shared memory machines offer a potentially transformative environment in which to approach the problem. Here, we explore the challenges of implementing Subgraph Isomorphism (SI) algorithms based on the Ullmann and VF2 algorithms in the Cray XMT environment, where issues of memory contention, scheduling, and compiler parallelizability must be optimized.