Hector: An Efficient Programming and Compilation Framework for Implementing Relational Graph Neural Networks in GPU Architectures-Reference-Cited by-同舟云学术

Hector: An Efficient Programming and Compilation Framework for Implementing Relational Graph Neural Networks in GPU Architectures

Published:2024-04-27 Issue: Volume: Page:528-544
ISSN:
Container-title:Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 3
language:
Short-container-title:

Author:

Wu Kun¹^ORCID,Hidayetoğlu Mert²^ORCID,Song Xiang³^ORCID,Huang Sitao⁴^ORCID,Zheng Da³^ORCID,Nisa Israt³^ORCID,Hwu Wen-Mei⁵¹^ORCID

Affiliation:

1. University of Illinois at Urbana-Champaign, Champaign, Illinois, USA

2. Stanford University, Stanford, California, USA

3. AWS AI, Santa Clara, California, USA

4. University of California, Irvine, Irvine, California, United States of America

5. Nvidia, Champaign, Illinois, United States of America

Publisher

ACM

Reference40 articles.

1. Kernel Methods for Mining Instance Data in Ontologies

2. Dan Busbridge, Dane Sherburn, Pietro Cavallo, and Nils Y. Hammerla. Relational graph attention networks. arXiv preprint arXiv:1904.05811, 2019. https://arxiv.org/abs/1904.05811.

3. Tianqi Chen, Thierry Moreau, Ziheng Jiang, Lianmin Zheng, Eddie Yan, Haichen Shen, Meghan Cowan, Leyuan Wang, Yuwei Hu, Luis Ceze, Carlos Guestrin, and Arvind Krishnamurthy. TVM: An Automated End-to-End Optimizing Compiler for Deep Learning. In 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18), pages 578--594, 2018. https://www.usenix.org/conference/osdi18/presentation/chen.

4. Supporting Linked Data Production for Cultural Heritage Institutes: The Amsterdam Museum Case Study

5. A Fast Approximation of the Weisfeiler-Lehman Graph Kernel for RDF Data