ScaWL: Scaling k-WL (Weisfeiler-Lehman) Algorithms in Memory and Performance on Shared and Distributed-Memory Systems
Gespeichert in:
| Titel: | ScaWL: Scaling k-WL (Weisfeiler-Lehman) Algorithms in Memory and Performance on Shared and Distributed-Memory Systems |
|---|---|
| Autoren: | Coby Soss, Aravind Sukumaran Rajam, Janet Layne, Edoardo Serra, Mahantesh Halappanavar, Assefaw H. Gebremedhin |
| Quelle: | ACM Transactions on Architecture and Code Optimization. 22:1-25 |
| Verlagsinformationen: | Association for Computing Machinery (ACM), 2025. |
| Publikationsjahr: | 2025 |
| Beschreibung: | The k -dimensional Weisfeiler-Lehman ( k -WL) algorithm—developed as an efficient heuristic for testing if two graphs are isomorphic—is a fundamental kernel for node embedding in the emerging field of graph neural networks. Unfortunately, the k -WL algorithm has exponential storage requirements, limiting the size of graphs that can be handled. This work presents a novel k -WL scheme with a storage requirement orders of magnitude lower while maintaining the same accuracy as the original k -WL algorithm. Due to the reduced storage requirement, our scheme allows for processing much bigger graphs than previously possible on a single compute node. For even bigger graphs, we provide the first distributed-memory implementation. Our k -WL scheme also has significantly reduced communication volume and offers high scalability. Our experimental results demonstrate that our approach is significantly faster and has superior scalability compared to five other implementations employing state-of-the-art techniques. |
| Publikationsart: | Article |
| Sprache: | English |
| ISSN: | 1544-3973 1544-3566 |
| DOI: | 10.1145/3715124 |
| Rights: | CC BY |
| Dokumentencode: | edsair.doi...........8b8cdf4f27b1edcb447b150b39b5ecd9 |
| Datenbank: | OpenAIRE |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstract: | The k -dimensional Weisfeiler-Lehman ( k -WL) algorithm—developed as an efficient heuristic for testing if two graphs are isomorphic—is a fundamental kernel for node embedding in the emerging field of graph neural networks. Unfortunately, the k -WL algorithm has exponential storage requirements, limiting the size of graphs that can be handled. This work presents a novel k -WL scheme with a storage requirement orders of magnitude lower while maintaining the same accuracy as the original k -WL algorithm. Due to the reduced storage requirement, our scheme allows for processing much bigger graphs than previously possible on a single compute node. For even bigger graphs, we provide the first distributed-memory implementation. Our k -WL scheme also has significantly reduced communication volume and offers high scalability. Our experimental results demonstrate that our approach is significantly faster and has superior scalability compared to five other implementations employing state-of-the-art techniques. |
|---|---|
| ISSN: | 15443973 15443566 |
| DOI: | 10.1145/3715124 |