mlsanityData to 7 Oct 2026

Allo: A Programming Model for Composable Accelerator Design

arXiv 2404.04815 ↗First posted 7 Apr 2024cs.PL cs.AR cs.LGcited by 16

Not on the map. Why?

Abstract (arXiv)

Special-purpose hardware accelerators are increasingly pivotal for sustaining performance improvements in emerging applications, especially as the benefits of technology scaling continue to diminish. However, designers currently lack effective tools and methodologies to construct complex, high-performance accelerator architectures in a productive manner. Existing high-level synthesis (HLS) tools often require intrusive source-level changes to attain satisfactory quality of results. Despite the introduction of several new accelerator design languages (ADLs) aiming to enhance or replace HLS, their advantages are more evident in relatively simple applications with a single kernel. Existing ADLs prove less effective for realistic hierarchical designs with multiple kernels, even if the design hierarchy is flattened. In this paper, we introduce Allo, a composable programming model for efficient spatial accelerator design. Allo decouples hardware customizations, including compute, memory, communication, and data type from algorithm specification, and encapsulates them as a set of customization primitives. Allo preserves the hierarchical structure of an input program by combining customizations from different functions in a bottom-up, type-safe manner. This approach facilitates holistic optimizations that span across function boundaries. We conduct comprehensive experiments on commonly-used HLS benchmarks and several realistic deep learning models. Our evaluation shows that Allo can outperform state-of-the-art HLS tools and ADLs on all test cases in the PolyBench. For the GPT2 model, the inference latency of the Allo generated accelerator is 1.7x faster than the NVIDIA A100 GPU with 5.4x higher energy efficiency, demonstrating the capability of Allo to handle large-scale designs.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). Builds on 35 of its 109 references that are in the map. First posted on arXiv 7 Apr 2024.

Builds on

35 of 109 references.

References · 35

  1. 2017Attention Is All You Needcited by 59,932
  2. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  3. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  4. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  5. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  6. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  7. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
  8. 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
  9. 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
  10. 2017In-Datacenter Performance Analysis of a Tensor Processing Unitcited by 610
  11. 2022Efficiently Scaling Transformer Inferencecited by 529
  12. 2023Atom: Low-bit Quantization for Efficient and Accurate LLM Servingcited by 255
23 more
  1. 2020Ansor: Generating High-Performance Tensor Programs for Deep Learningcited by 199
  2. 2023TPU v4: An Optically Reconfigurable Supercomputer for Machine Learning with Hardware Support for Embeddingscited by 198
  3. 2018Learning to Optimize Tensor Programscited by 138
  4. 2018Fast inference of deep neural networks in FPGAs for particle physicscited by 132
  5. 2018Tensor Comprehensions: Framework-Agnostic High-Performance Machine Learning Abstractionscited by 84
  6. 2018NVIDIA Tensor Core Programmability, Performance & Precisioncited by 77
  7. 2021hls4ml: An Open-Source Codesign Workflow to Empower Scientific Low-Power Machine Learning Devicescited by 61
  8. 2019Gemmini: Enabling Systematic Deep-Learning Architecture Evaluation via Full-Stack Integrationcited by 59
  9. 2018Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Codecited by 53
  10. 2022DFX: A Low-latency Multi-FPGA Appliance for Accelerating Transformer-based Text Generationcited by 46
  11. 2021Torch.fx: Practical Program Capture and Transformation for Deep Learning in Pythoncited by 38
  12. 2022TensorIR: An Abstraction for Automatic Tensorized Program Optimizationcited by 38
  13. 2022Tensor Program Optimization with Probabilistic Programscited by 30
  14. 2023Understanding the Potential of FPGA-Based Spatial Acceleration for Large Language Model Inferencecited by 29
  15. 2019Stateful Dataflow Multigraphs: A Data-Centric Model for Performance Portability on Heterogeneous Architecturescited by 21
  16. 2021ScaleHLS: A New Scalable High-Level Synthesis Framework on Multi-Level Intermediate Representationcited by 21
  17. 2018Transformations of High-Level Synthesis Codes for High-Performance Computingcited by 17
  18. 2023Slapo: A Schedule Language for Progressive Optimization of Large Deep Learning Model Trainingcited by 11
  19. 2022Composable and Modular Code Generation in MLIR: A Structured and Retargetable Approach to Tensor Compiler Constructioncited by 8
  20. 2018GraphIt: A High-Performance DSL for Graph Analyticscited by 5
  21. 2021A Compiler Infrastructure for Accelerator Generatorscited by 5
  22. 2020Predictable Accelerator Design with Time-Sensitive Affine Typescited by 4
  23. 2023Modular Hardware Design with Timeline Typescited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 6; 2026: 9.

16 papers.

Sort:

By area: