Presentation
COSMOS: Performance Portable Graph Pattern Matching with Domain-Specific Software Distributed Shared Memory
SessionProgramming Frameworks
DescriptionGraph pattern matching (GPM) is essential in fields like circuit logic synthesis, anomaly detection, social network analysis, cheminformatics, recommendation systems, and classification systems. Its NP-completeness and the irregular nature of graph data make scaling to distributed systems challenging. By utilizing architecture-specific communication techniques and topology-aware data partitioning, the scalability of GPM on large-scale data can be improved. However, the lack of performance portability complicates the parallel evolution of GPM software with hardware architectures, burdening developers.
This paper proposes a vertex-addressing scheme based on a distributed shared memory model (DSM) that relaxes strict DSM constraints, achieving both performance portability and scalability. This approach enables seamless code extension to thousands of nodes across different supercomputing architectures while maintaining performance comparable to manually optimized versions.
This paper proposes a vertex-addressing scheme based on a distributed shared memory model (DSM) that relaxes strict DSM constraints, achieving both performance portability and scalability. This approach enables seamless code extension to thousands of nodes across different supercomputing architectures while maintaining performance comparable to manually optimized versions.
Event Type
Paper
TimeWednesday, 19 November 202511:37am - 12:00pm CST
Location275
Programming Frameworks