A 4-way Matrix Multiply Unit for High Throughput Machine Learning Accelerator

Seung Chan Lee, T. Han
{"title":"A 4-way Matrix Multiply Unit for High Throughput Machine Learning Accelerator","authors":"Seung Chan Lee, T. Han","doi":"10.1109/ISOCC47750.2019.9078493","DOIUrl":null,"url":null,"abstract":"With the rapid growth of modern applications based on machine learning, neural network (NN) algorithm has been widely used in various fields. Accordingly, machine learning accelerators with high performance based on FPGA and ASIC design have become necessary. Machine learning accelerators generally include a matrix multiply unit that performs arithmetic. However, despite the development of dedicated hardware, some NN algorithms still suffer from performance degradation due to computation bounds in the matrix multiply units. Resolving the computation bound is crucial for high throughput machine learning accelerator. In this paper, we propose a 4-way matrix unit to resolve the computation bound by minimizing idle state operation logic and improving overall utilization. A 4-way matrix multiply unit resulted in an average throughput improvement of 29 percent and a 24 percent increase in the total area, comparing to the conventional systolic array-based matrix multiply unit.","PeriodicalId":113802,"journal":{"name":"2019 International SoC Design Conference (ISOCC)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International SoC Design Conference (ISOCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISOCC47750.2019.9078493","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

With the rapid growth of modern applications based on machine learning, neural network (NN) algorithm has been widely used in various fields. Accordingly, machine learning accelerators with high performance based on FPGA and ASIC design have become necessary. Machine learning accelerators generally include a matrix multiply unit that performs arithmetic. However, despite the development of dedicated hardware, some NN algorithms still suffer from performance degradation due to computation bounds in the matrix multiply units. Resolving the computation bound is crucial for high throughput machine learning accelerator. In this paper, we propose a 4-way matrix unit to resolve the computation bound by minimizing idle state operation logic and improving overall utilization. A 4-way matrix multiply unit resulted in an average throughput improvement of 29 percent and a 24 percent increase in the total area, comparing to the conventional systolic array-based matrix multiply unit.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
随着基于机器学习的现代应用的快速增长,神经网络(NN)算法在各个领域得到了广泛的应用。然而,尽管有专用硬件的发展,一些神经网络算法仍然受到矩阵乘单元计算界的影响而导致性能下降。本文提出了一种4路矩阵单元,通过最小化空闲状态操作逻辑和提高整体利用率来解决计算边界问题。与传统的基于收缩阵列的矩阵乘法单元相比,4路矩阵乘法单元的平均吞吐量提高了29%,总面积增加了24%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multi-carrier Signal Detection using Convolutional Neural Networks An RRAM-based Analog Neuron Design for the Weighted Spiking Neural network NTX: A 260 Gflop/sW Streaming Accelerator for Oblivious Floating-Point Algorithms in 22 nm FD-SOI A Low-Power 20 Gbps Multi-phase MDLL-based Digital CDR with Receiver Equalization Scaling Bit-Flexible Neural Networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1