Pith. sign in

REVIEW 1 cited by

SWAT: Scalable and Efficient Window Attention-based Transformers Acceleration on FPGAs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.17025 v1 pith:4J5EZM3D submitted 2024-05-27 cs.AR cs.AI

classification cs.ARcs.AI
keywords attentiondesigntimesacceleratorcomparedcomplexitycomputationefficiency
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

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$\times$ and 5.7$\times$ improvement in latency and energy efficiency compared to the baseline FPGA-based accelerator and 15$\times$ energy efficiency compared to GPU-based solution.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Data-aware Dynamic Execution of Irregular Workloads on Heterogeneous Systems

    cs.DC 2025-02 conditional novelty 6.0 of 10

    DyPE is a data-aware dynamic scheduler for heterogeneous GPU-FPGA systems that outperforms static scheduling on GNN and sliding-window transformer inference benchmarks.

Pith tools