SWAT: Scalable and Efficient Window Attention-based Transformers Acceleration on FPGAs
Not on the map. Why?
Abstract (arXiv)
Efficiently supporting long context length is crucial for Transformer models. The quadratic complexity of the self-attention computation plagues traditional Transformers. Sliding window-based static sparse attention mitigates the problem by limiting the attention scope of the input tokens, reducing the theoretical complexity from quadratic to linear. Although the sparsity induced by window attention is highly structured, it does not align perfectly with the microarchitecture of the conventional accelerators, leading to suboptimal implementation. In response, we propose a dataflow-aware FPGA-based accelerator design, SWAT, that efficiently leverages the sparsity to achieve scalable performance for long input. The proposed microarchitecture is based on a design that maximizes data reuse by using a combination of row-wise dataflow, kernel fusion optimization, and an input-stationary design considering the distributed memory and computation resources of FPGA. Consequently, it achieves up to 22× and 5.7× improvement in latency and energy efficiency compared to the baseline FPGA-based accelerator and 15× energy efficiency compared to GPU-based solution.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 13 of its 20 references that are in the map. First posted on arXiv 27 May 2024.
Builds on
13 of 20 references.
References · 13
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2020Longformer: The Long-Document Transformercited by 3,362
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,462
- 2020Long Range Arena: A Benchmark for Efficient Transformerscited by 696
- 2021FNet: Mixing Tokens with Fourier Transformscited by 343
- 2021Multi-Scale Vision Longformer: A New Vision Transformer for High-Resolution Image Encodingcited by 207
- 2022Efficient Methods for Natural Language Processing: A Surveycited by 78
- 2021Pixelated Butterfly: Simple and Efficient Sparse training for Neural Network Modelscited by 75
- 2019Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizationscited by 73
- 2022ViTCoD: Vision Transformer Acceleration via Dedicated Algorithm and Accelerator Co-Designcited by 41
- 2022Adaptable Butterfly Accelerator for Attention-based NNs via Hardware and Algorithm Co-designcited by 29
Built on by
Citing papers per year: 2025: 4; 2026: 1.
5 papers.
- 2025MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitivenesscited by 4
- 2025AccLLM: Accelerating Long-Context LLM Inference Via Algorithm-Hardware Co-Designcited by 1
- 2025Accelerating Sparse Transformer Inference on GPUcited by 0
- 2025TrackCore-F: Deploying Transformer-Based Subatomic Particle Tracking on FPGAscited by 0
- 2026Recent Developments in Transformer Inference Deployment on FPGA Platforms: A Surveycited by 0
- 2026Recent Developments in Transformer Inference Deployment on FPGA Platforms: A Survey1 Sep 2026
- 2025TrackCore-F: Deploying Transformer-Based Subatomic Particle Tracking on FPGAs30 Sep 2025
- 2025MCBP: A Memory-Compute Efficient LLM Inference Accelerator Leveraging Bit-Slice-enabled Sparsity and Repetitiveness12 Sep 2025
- 2025Accelerating Sparse Transformer Inference on GPU6 Jun 2025
- 2025AccLLM: Accelerating Long-Context LLM Inference Via Algorithm-Hardware Co-Design7 Apr 2025