AMULET: Adaptive Matrix-Multiplication-Like Tasks
원문 초록
Many useful tasks in data science and machine learning applications can be written as simple variations of matrix multiplication. However, users have difficulty performing such tasks as existing matrix/vector libraries support only a limited class of computations hand-tuned for each unique hardware platform. Users can alternatively write the task as a simple nested loop but current compilers are not sophisticated enough to generate fast code for the task written in this way. To address these issues, we extend an open-source compiler to recognize and optimize these matrix multiplication-like tasks. Our framework, called Amulet, uses both database-style and compiler optimization techniques to generate fast code tailored to its execution environment. We show through experiments that Amulet achieves speedups on a variety of matrix multiplication-like tasks compared to existing compilers. For large matrices Amulet typically performs within 15% of hand-tuned matrix multiplication libraries, while handling a much broader class of computations.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Bridging the PLC Binary Analysis Gap: A Cross-Compiler Dataset and Neural Framework for Industrial Control Systems
Optimization of Armv9 architecture general large language model inference performance based on Llama.cpp
WhiteFox: White-Box Compiler Fuzzing Empowered by Large Language Models
Compiler Optimization for Quantum Computing Using Reinforcement Learning
BaCO: A Fast and Portable Bayesian Compiler Optimization Framework
SimCLF: A Simple Contrastive Learning Framework for Function-level Binary Embeddings
토론
이 논문과 연결된 포럼 글이 아직 없습니다.