Fast Inner-Product Algorithms and Architectures for Deep Neural Network Accelerators
Authors: Trevor E. Pogue, Nicola Nicolici
AI-generated Key Points
- Authors Trevor E. Pogue and Nicola Nicolici introduce the Free-pipeline Fast Inner Product (FFIP) algorithm and its corresponding hardware architecture
- FFIP enhances the fast inner-product algorithm (FIP) proposed by Winograd in 1968, boosting clock frequency and improving throughput without significant hardware cost increase
- FFIP is versatile and applicable to various machine learning model layers involving matrix multiplication like fully-connected, convolutional, recurrent, and attention/transformer layers
- Researchers implement FIP within an ML accelerator for the first time, presenting the FFIP algorithm and its generalized architecture
- FFIP seamlessly integrates into traditional fixed-point systolic array ML accelerators, achieving equivalent throughput with half the number of MAC units or doubling maximum systolic array size under a fixed hardware budget
- FFIP implementation targeting non-sparse ML models with 8 to 16-bit fixed-point inputs demonstrates superior throughput and compute efficiency compared to existing state-of-the-art solutions on similar platforms
Abstract: We introduce a new algorithm called the Free-pipeline Fast Inner Product (FFIP) and its hardware architecture that improve an under-explored fast inner-product algorithm (FIP) proposed by Winograd in 1968. Unlike the unrelated Winograd minimal filtering algorithms for convolutional layers, FIP is applicable to all machine learning (ML) model layers that can mainly decompose to matrix multiplication, including fully-connected, convolutional, recurrent, and attention/transformer layers. We implement FIP for the first time in an ML accelerator then present our FFIP algorithm and generalized architecture which inherently improve FIP's clock frequency and, as a consequence, throughput for a similar hardware cost. Finally, we contribute ML-specific optimizations for the FIP and FFIP algorithms and architectures. We show that FFIP can be seamlessly incorporated into traditional fixed-point systolic array ML accelerators to achieve the same throughput with half the number of multiply-accumulate (MAC) units, or it can double the maximum systolic array size that can fit onto devices with a fixed hardware budget. Our FFIP implementation for non-sparse ML models with 8 to 16-bit fixed-point inputs achieves higher throughput and compute efficiency than the best-in-class prior solutions on the same type of compute platform.
Tools for this paper
Ask questions about this paper to our AI assistant
You can also chat with multiple papers at once here.
⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.
The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.
⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.
Similar papers summarized with our AI tools
Navigate through even more similar papers through a
tree representationLook for similar papers (in beta version)
We compare the title and abstract with papers indexed in our database. For arXiv papers, we search within the same category; for DOI and other sources, we search across sources and subjects. You can rerun the search as our database grows.
Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.