An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Automatic algorithm recognition and replacement: a new approach to program optimization
Automatic algorithm recognition and replacement: a new approach to program optimization
IEEE Transactions on Pattern Analysis and Machine Intelligence
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Edit Distance from Spectral Seriation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Integrated Performance Monitoring of a Cosmology Application on Leading HEC Platforms
ICPP '05 Proceedings of the 2005 International Conference on Parallel Processing
Towards automatic translation of OpenMP to MPI
Proceedings of the 19th annual international conference on Supercomputing
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
FANMOD: a tool for fast network motif detection
Bioinformatics
Efficient Detection of Network Motifs
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Open problems in the security of learning
Proceedings of the 1st ACM workshop on Workshop on AISec
An approach for matching communication patterns in parallel applications
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Transforming MPI source code based on communication patterns
Future Generation Computer Systems
Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Effective Performance Measurement at Petascale Using IPM
ICPADS '10 Proceedings of the 2010 IEEE 16th International Conference on Parallel and Distributed Systems
Weisfeiler-Lehman Graph Kernels
The Journal of Machine Learning Research
Visualizing distributed memory computations with hive plots
Proceedings of the Ninth International Symposium on Visualization for Cyber Security
Identifying HPC codes via performance logs and machine learning
Proceedings of the first workshop on Changing landscapes in HPC security
Hi-index | 0.00 |
Parallel computation in a high-performance computing environment can be characterized by the distributed memory access patterns of the underlying algorithm. During execution, networks of compute nodes exchange messages that indirectly exhibit these access patterns. Identifying the algorithm underlying these observable messages is the problem of latent class analysis over information flows in a computational network. Towards this end, our work applies methods from graph and network theory to classify parallel computations solely from network communication patterns. Pattern classification has applications to several areas including anomaly detection, performance analysis, and automated algorithm replacement. We discuss the difficulties encountered by previous efforts, introduce two new approximate matching techniques, and compare these approaches using massive datasets collected at Lawrence Berkeley National Laboratory.