Cited by 206Embedded Systems Design TechniquesAdvanced Neural Network ApplicationsVLSI and FPGA Design Techniques

The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.

FTRANS: energy-efficient acceleration of transformers using FPGA

Li, Bingbing, Pandey, Santosh, Fang, Haowen, Lyv, Yanjun, Li, Ji, Chen, Jieyang, Xie, Mimi, Wan, Lipeng, Liu, Hang, Ding, Caiwen·2020·Proceedings of the ACM/IEEE International Symposium on Low Power Electronics and Design

Abstract

In natural language processing (NLP), the "Transformer" architecture was proposed as the first transduction model replying entirely on self-attention mechanisms without using sequence-aligned recurrent neural networks (RNNs) or convolution, and it achieved significant improvements for sequence to sequence tasks. The introduced intensive computation and storage of these pre-trained language representations has impeded their popularity into computation and memory constrained devices. The field-programmable gate array (FPGA) is widely used to accelerate deep learning algorithms for its high parallelism and low latency. However, the trained models are still too large to accommodate to an FPGA fabric. In this paper, we propose an efficient acceleration framework, Ftrans, for transformer-based large scale language representations. Our framework includes enhanced block-circulant matrix (BCM)-based weight representation to enable model compression on large-scale language representations at the algorithm level with few accuracy degradation, and an acceleration design at the architecture level. Experimental results show that our proposed framework significantly reduce the model size of NLP models by up to 16 times. Our FPGA design achieves 27.07× and 81 × improvement in performance and energy efficiency compared to CPU, and up to 8.80× improvement in energy efficiency compared to GPU.

Overview

Integrity signals

Registry

Crossref · 10.1145/3370748.3406567

Cites

15 of 15 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 14 references

Research works printed but not linked: 5

  1. Kyunghyun Cho , Bart Van Merriënboer , Dzmitry Bahdanau, and Yoshua Bengio. 2014 . On the properties of neural machine translation: encoder-decoder approaches. arXiv preprint arXiv:1409.1259. Kyunghyun Cho, Bart Van Merriënboer, Dzmitry Bahdanau, and Yoshua Bengio. 2014. On the properties of neural machine translation: encoder-decoder approaches. arXiv preprint arXiv:1409.1259. · arXiv
  2. Caiwen Ding Siyu Liao Yanzhi Wang Zhe Li etal 2017. CirCNN: Accelerating and Compressing Deep Neural Networks using Block-circulant Weight Matrices. In MICRO. ACM 395--408. Caiwen Ding Siyu Liao Yanzhi Wang Zhe Li et al. 2017. CirCNN: Accelerating and Compressing Deep Neural Networks using Block-circulant Weight Matrices. In MICRO. ACM 395--408.
  3. Yoon Kim Carl Denton Luong Hoang and Alexander M Rush. 2017. Structured attention networks. arXiv preprint arXiv:1702.00887. Yoon Kim Carl Denton Luong Hoang and Alexander M Rush. 2017. Structured attention networks. arXiv preprint arXiv:1702.00887. · arXiv
  4. Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez Łukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In Advances in neural information processing systems 5998--6008. Ashish Vaswani Noam Shazeer Niki Parmar Jakob Uszkoreit Llion Jones Aidan N Gomez Łukasz Kaiser and Illia Polosukhin. 2017. Attention is all you need. In Advances in neural information processing systems 5998--6008.
  5. Liang Zhao , Siyu Liao , Yanzhi Wang , Zhe Li , Jian Tang , and Bo Yuan . 2017 . Theoretical properties for neural networks with weight matrices of low displacement rank . In International Conference on Machine Learning, 4082--4090 . Liang Zhao, Siyu Liao, Yanzhi Wang, Zhe Li, Jian Tang, and Bo Yuan. 2017. Theoretical properties for neural networks with weight matrices of low displacement rank. In International Conference on Machine Learning, 4082--4090.

Cited by

Sorted by citations

See all 206

Metadata

Authors
Li, B., Pandey, S., Fang, H., Lyv, Y., Li, J., Chen, J., Xie, M., Wan, L., Liu, H., & Ding, C.
Affiliations
  • University of Connecticut (US)
  • Stevens Institute of Technology (US)
  • Syracuse University (US)
  • Microsoft (United States) (US)
  • Oak Ridge National Laboratory (US)
  • The University of Texas at San Antonio (US)
Venue
Proceedings of the ACM/IEEE International Symposium on Low Power Electronics and Design
Publisher
ACM
Published
2020-08-10
Pages
175-180
OpenAlex
W3047848469
Cited by
206
References
14
Citations by year
2026: 23 · 2025: 54 · 2024: 55 · 2023: 38 · 2022: 25 · 2021: 11
FWCI
13.84
Type
conference paper
Language
en
Open access
closed
Locations
International Symposium on Low Power Electronics and Design (ISLPED) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Engineering › Electrical and Electronic Engineering › VLSI and FPGA Design Techniques
Keywords
transformer models, FPGA acceleration, model compression, block circulant matrices, self-attention, energy efficiency, hardware architecture design, deep learning acceleration

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review