Ember: A Compiler for Efficient Embedding Operations on Decoupled Access-Execute Architectures
원문 초록
Irregular embedding lookups are a critical bottleneck in recommender models, sparse large language models, and graph learning models. In this paper, we first demonstrate that, by offloading these lookups to specialized access units, Decoupled Access-Execute (DAE) processors achieve 2.6$\times$ higher performance and 6.4$\times$ higher performance/watt than GPUs on end-to-end models. Then, we propose the Ember compiler for automatically generating optimized DAE code from PyTorch and TensorFlow. Conversely from other DAE compilers, Ember features multiple intermediate representations specifically designed for different optimization levels. In this way, Ember can implement all optimizations to match the performance of hand-written code, unlocking the full potential of DAE architectures at scale.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph World Model
S2FGL: Spatial Spectral Federated Graph Learning
Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations
Fast and Distributed Equivariant Graph Neural Networks by Virtual Node Learning
Higher-Order Graph Databases
Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark
토론
이 논문과 연결된 포럼 글이 아직 없습니다.